Corpus ID: 5710555

Subspace clustering for complex data

@inproceedings{Gnnemann2013SubspaceCF,
  title={Subspace clustering for complex data},
  author={Stephan G{\"u}nnemann},
  booktitle={BTW},
  year={2013}
}
  • Stephan Günnemann
  • Published in BTW 2013
  • Computer Science
  • 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
    2 Citations
    Community detection in node-attributed social networks: a survey
    • 11
    • PDF
    BTW 2013 – Zwischen wissenschaftlicher Geschichte und moderner Herausforderung

    References

    SHOWING 1-10 OF 184 REFERENCES
    Detection of orthogonal concepts in subspaces of high dimensional data
    • 46
    Density-Connected Subspace Clustering for High-Dimensional Data
    • 401
    • PDF
    Entropy-based subspace clustering for mining numerical data
    • 577
    Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
    • 115
    • PDF
    Subspace clustering for high dimensional data: a review
    • 1,254
    • PDF
    Finding density-based subspace clusters in graphs with feature vectors
    • 25