Name
Abstract | ||
|---|---|---|
Data can encapsulate different object groupings in subspaces of arbitrary dimension and orientation. Finding such subspaces and the groupings within them is the goal of generalized subspace clustering. In this work we present a generalized subspace clustering technique capable of finding multiple non-redundant clusterings in arbitrarily-oriented subspaces. We use Independent Subspace Analysis (ISA) to find the subspace collection that minimizes the statistical dependency (redundancy) between clusterings. We then cluster in the arbitrarily-oriented subspaces identified by ISA. Our algorithm ISAAC (Independent Subspace Analysis and Clustering) uses the Minimum Description Length principle to automatically choose parameters that are otherwise difficult to set. We comprehensively demonstrate the effectiveness of our approach on synthetic and real-world data. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICDM.2016.0068 | 2016 IEEE 16th International Conference on Data Mining (ICDM) |
Keywords | Field | DocType |
generalized independent subspace clustering technique,multiple nonredundant clusterings,independent subspace analysis,subspace collection,statistical dependency minimization,arbitrarily-oriented subspaces,ISAAC algorithm,independent subspace analysis and clustering,minimum description length principle | Data mining,Data modeling,Computer science,Redundancy (engineering),Artificial intelligence,Cluster analysis,Kernel (linear algebra),Subspace topology,Pattern recognition,Minimum description length,Linear subspace,Principal component analysis,Machine learning | Conference |
ISSN | ISBN | Citations |
1550-4786 | 978-1-5090-5474-9 | 2 |
PageRank | References | Authors |
0.36 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Ye | 1 | 60 | 10.29 |
| Samuel Maurus | 2 | 27 | 2.72 |
| Nina Hubig | 3 | 13 | 4.64 |
| Claudia Plant | 4 | 536 | 54.69 |