A spectral method to separate disconnected and nearly-disconnected web graph components

Authors:
Chris H. Q. Ding;Xiaofeng He;Hongyuan Zha
Affiliations:
Lawrence Berkeley National Laboratory, University of California, Berkeley, CA;The Pennsylvania State University, University Park, PA;The Pennsylvania State University, University Park, PA
Venue:
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2001

Citing 13
Cited 14

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

IEEE Transactions on Computers
Introduction to algorithms

Introduction to algorithms
Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
An optimal randomized parallel algorithm for finding connected components in a graph

SIAM Journal on Computing
A comparison of parallel algorithms for connected components

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Silk from a sow's ear: extracting usable structures from the Web

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
The symmetric eigenvalue problem

The symmetric eigenvalue problem
Improved algorithms for topic distillation in a hyperlinked environment

Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Efficient identification of Web communities

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Toward a Qualitative Search Engine

IEEE Internet Computing

Analysis of gene expression profiles: class discovery and leaf ordering

Proceedings of the sixth annual international conference on Computational biology
Unsupervised Learning: Self-aggregation in Scaled Principal Component Space

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Eigenspace-based anomaly detection in computer systems

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Spectral clustering in telephone call graphs

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Spectral geometry for simultaneously clustering and ranking query search results

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets

International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Spectral Clustering in Social Networks

Advances in Web Mining and Web Usage Analysis
Predicting Click Rates by Consistent Bipartite Spectral Graph Model

ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Data clustering: principal components, Hopfield and self-aggregation networks

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Enhancing the stability and efficiency of spectral ordering with partial supervision and feature selection

Knowledge and Information Systems
Effecting parallel graph eigensolvers through library composition

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Assessing the vulnerability of replicated network services

Proceedings of the 6th International COnference
ECODE: event-based community detection from social networks

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Active constrained clustering by examining spectral eigenvectors

DS'05 Proceedings of the 8th international conference on Discovery Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Separation of connected components from a graph with disconnected graph components mostly use breadth-first search (BFS) or depth-first search (DFS) graph algorithms. Here we propose a new algebraic method to separate disconnected and nearly-disconnected components. This method is based on spectral graph partitioning, following a key observation that disconnected components will show up, after properly sorted, as step-function like curve in the lowest eigenvectors of the Laplacian matrix of the graph. Following an perturbative analysis framework, we systematically analyzed the graph structures, first on the disconnected subgraph case, and second on the effects of adding edges sparsely connecting different subgraphs as a perturbation. Several new results are derived, providing insights to spectral methods and related clustering objective function. Examples are given illustrating the concepts and results our methods. Comparing to the standard graph algorithms, this method has the same O(‖E ‖ + ‖V‖log(‖V‖)) complexity, but is easier to implement (using readily available eigensolvers). Further more the method can easily identify articulation points and bridges on nearly-disconnected graphs. Segmentation of a real example of Web graph for query amazon is given. We found that each disconnected or nearly-disconnected components forms a cluster on a clear topic.