DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Mining coherent subgraphs in multi-layer graphs with edge labels
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Substructure clustering: a novel mining paradigm for arbitrary data types
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Tracing clusters in evolving graphs with node attributes
Proceedings of the 21st ACM international conference on Information and knowledge management
A survey on enhanced subspace clustering
Data Mining and Knowledge Discovery
Combining Relations and Text in Scientific Network Clustering
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Finding contexts of social influence in online social networks
Proceedings of the 7th Workshop on Social Network Mining and Analysis
Detecting and exploring clusters in attributed graphs: a plugin for the gephi platform
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Today's applications deal with multiple types of information: graph data to represent the relations between objects and attribute data to characterize single objects. Analyzing both data sources simultaneously can increase the quality of mining methods. Recently, combined clustering approaches were introduced, which detect densely connected node sets within one large graph that also show high similarity according to all of their attribute values. However, for attribute data it is known that this full-space clustering often leads to poor clustering results. Thus, subspace clustering was introduced to identify locally relevant subsets of attributes for each cluster. In this work, we propose a method for finding homogeneous groups by joining the paradigms of subspace clustering and dense sub graph mining, i.e. we determine sets of nodes that show high similarity in subsets of their dimensions and that are as well densely connected within the given graph. Our twofold clusters are optimized according to their density, size, and number of relevant dimensions. Our developed redundancy model confines the clustering to a manageable size of only the most interesting clusters. We introduce the algorithm Gamer for the efficient calculation of our clustering. In thorough experiments on synthetic and real world data we show that Gamer achieves low runtimes and high clustering qualities.