Graph Clustering Via a Discrete Uncoupling Process

A discrete uncoupling process for finite spaces is introduced, called the Markov Cluster Process or the MCL process. The process is the engine for the graph clustering algorithm called the MCL algorithm. The MCL process takes a stochastic matrix as input, and then alternates expansion and inflation,...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on matrix analysis and applications Vol. 30; no. 1; pp. 121 - 141
Main Author:	Van Dongen, Stijn
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008
Subjects:	Algebra Algorithms Applied mathematics Bioinformatics Clustering Exact sciences and technology Graphs Heuristic Image retrieval Kinases Linear and multilinear algebra, matrix theory Markov processes Mathematics Multivariate analysis Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Peer to peer computing Probability and statistics Probability theory and stochastic processes Proteins Sciences and techniques of general use Statistics Markov process Invariant Multiplication Random matrix Markov matrix Limit point Similarity Cluster analysis (statistics) Heuristics 05C90 Connected graph Invariance principle Mapping Image Stochastic process Input Column Ordering circulant matrices Behavior Fast algorithm Mathematical expansion Expansion Markov graph Stochastic matrix 05C85 Cluster Columns diagonal similarity Interpretation graph clustering Numerical analysis Symmetric matrix positive semi-definite matrices stochastic uncoupling Linear algebra Positive definite matrix M matrix 68R10 Power Inequality
ISSN:	0895-4798, 1095-7162
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!