NDLI: Graph clustering based on mixing time of random walks

Content Provider	IEEE Xplore Digital Library
Author	Avrachenkov, K. El Chamie, M. Neglia, G.
Copyright Year	2014
Description	Author affiliation: INRIA Sophia Antipolis - Mediterranee, Sophia Antipolis, France (Avrachenkov, K.; El Chamie, M.; Neglia, G.)
Abstract	Clustering of a graph is the task of grouping its nodes in such a way that the nodes within the same cluster are well connected, but they are less connected to nodes in different clusters. In this paper we propose a clustering metric based on the random walks' properties to evaluate the quality of a graph clustering. We also propose a randomized algorithm that identifies a locally optimal clustering of the graph according to the metric defined. The algorithm is intrinsically distributed and asynchronous. If the graph represents an actual network where nodes have computing capabilities, each node can determine its own cluster relying only on local communications. We show that the size of clusters can be adapted to the available processing capabilities to reduce the algorithm's complexity.
Starting Page	4089
Ending Page	4094
File Size	766730
Page Count	6
File Format	PDF
ISBN	9781479920037
DOI	10.1109/ICC.2014.6883961
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-06-10
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Proposals Measurement Classification algorithms Complexity theory Eigenvalues and eigenfunctions Games
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-agent Random Walks for Local Clustering on Graphs

Graph Clustering Based on Mixing Time of Random Walks (2014)

Subexponential Algorithms for Unique Games and Related Problems

Clustering using a random walk on graph for head pose estimation

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

A Note on Spectral Clustering Method Based on Normalized Cut Criterion

Simulation of Quantum Walks and Fast Mixing with Classical Processes

An improved random walk based clustering algorithm for community detection in complex networks

Mode-seeking on graphs via random walks

Graph clustering based on mixing time of random walks

Similar Documents

Multi-agent Random Walks for Local Clustering on Graphs

Graph Clustering Based on Mixing Time of Random Walks (2014)

Subexponential Algorithms for Unique Games and Related Problems

Clustering using a random walk on graph for head pose estimation

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

A Note on Spectral Clustering Method Based on Normalized Cut Criterion

Simulation of Quantum Walks and Fast Mixing with Classical Processes

An improved random walk based clustering algorithm for community detection in complex networks

Mode-seeking on graphs via random walks

Graph clustering based on mixing time of random walks