Show simple item record

dc.contributor.author Boongoen, Tossapon
dc.contributor.author Shang, Changjing
dc.contributor.author Iam-On, Natthakan
dc.contributor.author Shen, Qiang
dc.date.accessioned 2011-12-12T09:40:47Z
dc.date.available 2011-12-12T09:40:47Z
dc.date.issued 2011-12-12
dc.identifier.citation Boongoen , T , Shang , C , Iam-On , N & Shen , Q 2011 , ' Extending Data Reliability Measure to a Filter Approach for Soft Subspace Clustering ' IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics , vol 41 , no. 6 , pp. 1705-1714 . , 10.1109/TSMCB.2011.2160341 en
dc.identifier.other PURE: 173903
dc.identifier.other dspace: 2160/7708
dc.identifier.uri http://hdl.handle.net/2160/7708
dc.description Boongoen, T., Shang, C., Iam-On, N., Shen, Q. (2011). Extending Data Reliability Measure to a Filter Approach for Soft Subspace Clustering. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41 (6), 1705-1714 en
dc.description.abstract The measure of data reliability has recently proven useful for a number of data analysis tasks. This paper extends the underlying metric to a new problem of soft subspace clustering. The concept of subspace clustering has been increasingly recognized as an effective alternative to conventional algorithms (which search for clusters without differentiating the significance of different data attributes). While a large number of crisp subspace approaches have been proposed, only a handful of soft counterparts are developed with the common goal of acquiring the optimal cluster-specific dimension weights. Most soft subspace clustering methods work based on the exploitation of k-means and greatly rely on the iteratively disclosed cluster centers for the determination of local weights. Unlike such wrapper techniques, this paper presents a filter approach which is efficient and generally applicable to different types of clustering. Systematical experimental evaluations have been carried out over a collection of published gene expression data sets. The results demonstrate that the reliability-based methods generally enhance their corresponding baseline models and outperform several well-known subspace clustering algorithms. en
dc.format.extent 10 en
dc.language.iso eng
dc.relation.ispartof IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics en
dc.title Extending Data Reliability Measure to a Filter Approach for Soft Subspace Clustering en
dc.type Text en
dc.type.publicationtype Article (Journal) en
dc.identifier.doi http://dx.doi.org/10.1109/TSMCB.2011.2160341
dc.contributor.institution Department of Computer Science en
dc.contributor.institution Advanced Reasoning Group en
dc.description.status Peer reviewed en


Files in this item

Aside from theses and in the absence of a specific licence document on an item page, all works in Cadair are accessible under the CC BY-NC-ND Licence. AU theses and dissertations held on Cadair are made available for the purposes of private study and non-commercial research and brief extracts may be reproduced under fair dealing for the purpose of criticism or review. If you have any queries in relation to the re-use of material on Cadair, contact is@aber.ac.uk.

This item appears in the following Collection(s)

Show simple item record

Search Cadair


Advanced Search

Browse

Statistics