A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Comparing clusterings: an axiomatic view
ICML '05 Proceedings of the 22nd international conference on Machine learning
A new Mallows distance based metric for comparing clusterings
ICML '05 Proceedings of the 22nd international conference on Machine learning
Comparing clusterings---an information based distance
Journal of Multivariate Analysis
Distance measures for image segmentation evaluation
EURASIP Journal on Applied Signal Processing
Engineering Comparators for Graph Clusterings
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
External validation measures for K-means clustering: A data distribution perspective
Expert Systems with Applications: An International Journal
Adapting the right measures for K-means clustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Word Sense Induction Using Graphs of Collocations
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The NVI clustering evaluation measure
CoNLL '09 Proceedings of the Thirteenth Conference on Computational Natural Language Learning
Proceedings of the 2009 International Conference on Hybrid Information Technology
Type level clustering evaluation: new measures and a POS induction case study
CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning
Word sense induction & disambiguation using hierarchical random graphs
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Exploring the performance limit of cluster ensemble techniques
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Learning a nonlinear distance metric for supervised region-merging image segmentation
Computer Vision and Image Understanding
Latent clustering on graphs with multiple edge types
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
DClusterE: A Framework for Evaluating and Understanding Document Clustering Using Visualization
ACM Transactions on Intelligent Systems and Technology (TIST)
SDC: a distributed clustering protocol for peer-to-peer networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Image segmentation evaluation by techniques of comparing clusterings
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
A comparative study of efficient initialization methods for the k-means clustering algorithm
Expert Systems with Applications: An International Journal
Spectral graph multisection through orthogonality
Proceedings of the 4th MultiClust Workshop on Multiple Clusterings, Multi-view Data, and Multi-source Knowledge-driven Clustering
Optimising sum-of-squares measures for clustering multisets defined over a metric space
Discrete Applied Mathematics
Hi-index | 0.00 |
In~[1] a cluster algorithm for graphs was introduced called the Markov cluster algorithm or MCL~algorithm. The algorithm is based on simulation of (stochastic) flow in graphs by means of alternation of two operators, expansion and inflation. The results in~[2] establish an intrinsic relationship between the corresponding algebraic process (MCL~process) and cluster structure in the iterands and the limits of the process. Several kinds of experiments conducted with the MCL~algorithm are described here. Test cases with varying homogeneity characteristics are used to establish some of the particular strengths and weaknesses of the algorithm. In general the algorithm performs well, except for graphs which are very homogeneous (such as weakly connected grids) and for which the natural cluster diameter (i.e. the diameter of a subgraph induced by a natural cluster) is large. This can be understood in terms of the flow characteristics of the MCL~algorithm and the heuristic on which the algorithm is grounded. A generic performance criterion for clusterings of weighted graphs is derived, by a stepwise refinement of a simple and appealing criterion for simple graphs. The most refined criterion uses a particular Schur convex function, several properties of which are established. A metric is defined on the space of partitions, which is useful for comparing different clusterings of the same graph. The metric is compared with the metric known as the equivalence mismatch coefficient. The performance criterion and the metric are used for the quantitative measurement of experiments conducted with the MCL~algorithm on randomly generated test graphs with 10000 nodes. Scaling the MCL~algorithm requires a regime of pruning the stochastic matrices which need to be computed. The effect of pruning on the quality of the retrieved clusterings is also investigated. [1] A cluster algorithm for graphs. Technical report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, 2000. [2] A stochastic uncoupling process for graphs. Technical report INS-R0011, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, 2000.