Finding density-based subspace clusters in graphs with feature vectors
- 3 June 2012
- journal article
- Published by Springer Science and Business Media LLC in Data Mining and Knowledge Discovery
- Vol. 25 (2), 243-269
- https://doi.org/10.1007/s10618-012-0272-z
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two ParadigmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Subspace Clustering for Uncertain DataPublished by Society for Industrial & Applied Mathematics (SIAM) ,2010
- Managing and Mining Graph DataPublished by Springer Science and Business Media LLC ,2010
- Detection of orthogonal concepts in subspaces of high dimensional dataPublished by Association for Computing Machinery (ACM) ,2009
- EDSCPublished by Association for Computing Machinery (ACM) ,2008
- Community detection in large-scale social networksPublished by Association for Computing Machinery (ACM) ,2007
- Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center ProblemPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- -Core Organization of Complex NetworksPhysical Review Letters, 2006
- When Is “Nearest Neighbor” Meaningful?Lecture Notes in Computer Science, 1999
- Automatic subspace clustering of high dimensional data for data mining applicationsACM SIGMOD Record, 1998