Clustering on complex graphs

Authors:
Bo Long;Mark Zhang;Philip S. Yu;Tianbing Xu
Affiliations:
Computer Science Dept., SUNY Binghamton, Binghamton, NY;Computer Science Dept., SUNY Binghamton, Binghamton, NY;Dept. of Computer Science, UIC at Chicago, Chicago, IL;Computer Science Dept., SUNY Binghamton, Binghamton, NY
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Year:
2008

Citing 11
Cited 2

Spectral K-way ratio-cut partitioning and clustering

DAC '93 Proceedings of the 30th international Design Automation Conference
A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Cluster ensembles: a knowledge reuse framework for combining partitionings

Eighteenth national conference on Artificial intelligence
A generalized maximum entropy approach to bregman co-clustering and matrix approximation

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Unsupervised learning on k-partite graphs

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Community Learning by Graph Approximation

ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining

Multiple hypergraph clustering of web images by mining Word2Image correlations

Journal of Computer Science and Technology
Detecting communities in K-partite K-uniform (hyper)networks

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and epidemiology. In this study, We propose a general framework for clustering on complex graphs. Under this framework, we derive a family of clustering algorithms including both hard and soft versions, which are capable of learning cluster patterns from complex graphs with various structures and statistical properties. We also establish the connections between the proposed framework and the traditional graph partitioning approaches. The experimental evaluation provides encouraging results to validate the proposed framework and algorithms.