Network ensemble clustering using latent roles

Authors:
Ulrik Brandes;Jürgen Lerner;Uwe Nagel
Affiliations:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Konstanz, Germany
Venue:
Advances in Data Analysis and Classification
Year:
2011

Citing 16
Cited 0

Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem

Pattern Recognition Letters - Special issue on pattern recognition in practice VI
On Median Graphs: Properties, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Spectral Feature Vectors for Graph Clustering

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Spectral Partitioning of Random Graphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A survey of kernels for structured data

ACM SIGKDD Explorations Newsletter
Central Clustering of Attributed Graphs

Machine Learning
Cyclic pattern kernels for predictive graph mining

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent Substructure-Based Approaches for Classifying Chemical Compounds

IEEE Transactions on Knowledge and Data Engineering
Median graph computation for graph clustering

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Some Simple Algorithms for Structural Comparison

Computational & Mathematical Organization Theory
SVM learning with the Schur-Hadamard inner product for graphs

Neurocomputing
A new median graph algorithm

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph clustering using the weighted minimum common supergraph

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
A random walk kernel derived from graph edit distance

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Cyclic pattern kernels revisited

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Survey: Graph clustering

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a clustering method for collections of graphs based on the assumptions that graphs in the same cluster have a similar role structure and that the respective roles can be founded on implicit vertex types. Given a network ensemble (a collection of attributed graphs with some substantive commonality), we start by partitioning the set of all vertices based on attribute similarity. Projection of each graph onto the resulting vertex types yields feature vectors of equal dimensionality, irrespective of the original graph sizes. These feature vectors are then subjected to standard clustering methods. This approach is motivated by social network concepts, and we demonstrate its utility on an ensemble of personal networks of migrants, where we extract structurally similar groups and show their resemblance to predicted acculturation strategies.