Subspace clustering for complex data
@inproceedings{Gnnemann2013SubspaceCF, title={Subspace clustering for complex data}, author={Stephan G{\"u}nnemann}, booktitle={BTW}, year={2013} }
Clustering is an established data mining technique for grouping objects based on their mutual similarity. Since in today’s applications, however, usually many characteristics for each object are recorded, one cannot expect to find similar objects by considering all attributes together. In contrast, valuable clusters are hidden in subspace projections of the data. As a general solution to this problem, the paradigm of subspace clustering has been introduced, which aims at automatically… CONTINUE READING
Figures, Tables, and Topics from this paper
Figures and Tables
figure 1.1 figure 1.2 figure 1.3 figure 1.4 figure 1.5 figure 1.6 figure 2.1 figure 2.2 figure 2.3 figure 2.4 figure 2.5 figure 2.6 figure 2.7 figure 2.8 figure 2.9 figure 3.1 figure 3.2 figure 3.3 figure 3.4 figure 3.5 figure 3.6 figure 3.7 figure 3.8 figure 4.1 figure 4.10 figure 4.11 figure 4.12 figure 4.2 figure 4.3 figure 4.4 figure 4.5 figure 4.7 figure 4.9 figure 5.1 figure 5.10 figure 5.11 figure 5.12 figure 5.13 figure 5.14 figure 5.15 figure 5.16 figure 5.2 figure 5.4 figure 5.6 figure 5.8 figure 7.1 figure 7.12 figure 7.13 figure 7.16 figure 7.17 figure 7.18 figure 7.2 figure 7.3 figure 7.4 figure 7.5 figure 7.6 figure 7.8 figure 7.9 table 8.1 figure 8.10 figure 8.11 figure 8.12 figure 8.2 figure 8.3 figure 8.4 figure 8.5 figure 8.7 figure 8.8 figure 8.9 figure 10.1 figure 10.11 figure 10.13 figure 10.14 figure 10.15 figure 10.16 figure 10.17 figure 10.19 figure 10.2 figure 10.3 figure 10.4 figure 10.5 figure 10.6 figure 10.7 figure 10.8 figure 10.9 figure 11.1 figure 11.10 figure 11.11 figure 11.2 figure 11.3 figure 11.4 figure 11.5 figure 11.6 figure 11.7 figure 11.9 figure 12.1 figure 12.10 figure 12.11 figure 12.2 figure 12.3 figure 12.4 figure 12.5 figure 12.6 figure 12.8 figure 12.9
2 Citations
Community detection in node-attributed social networks: a survey
- Computer Science
- Comput. Sci. Rev.
- 2020
- 11
- PDF
BTW 2013 – Zwischen wissenschaftlicher Geschichte und moderner Herausforderung
- Computer Science
- Datenbank-Spektrum
- 2013
References
SHOWING 1-10 OF 184 REFERENCES
Density-Connected Subspace Clustering for High-Dimensional Data
- Mathematics, Computer Science
- SDM
- 2004
- 401
- PDF
Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
- Mathematics, Computer Science
- 2010 IEEE International Conference on Data Mining
- 2010
- 115
- PDF
Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering
- Mathematics, Computer Science
- KDD
- 2008
- 134
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
- Computer Science
- ICDE
- 2012
- 15
Finding density-based subspace clusters in graphs with feature vectors
- Computer Science, Mathematics
- Data Mining and Knowledge Discovery
- 2012
- 25