• Corpus ID: 27087261

Data clustering with edge domination in complex networks

@article{Urio2017DataCW,
  title={Data clustering with edge domination in complex networks},
  author={Paulo Roberto Urio and Zhao Liang},
  journal={ArXiv},
  year={2017},
  volume={abs/1705.05494}
}
This paper presents a model for a dynamical system where particles dominate edges in a complex network. The proposed dynamical system is then extended to an application on the problem of community detection and data clustering. In the case of the data clustering problem, 6 different techniques were simulated on 10 different datasets in order to compare with the proposed technique. The results show that the proposed algorithm performs well when prior knowledge of the number of clusters is known… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 17 REFERENCES

Finding community structure in very large networks.

TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.

Fast algorithm for detecting community structure in networks.

  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.

Community detection in graphs

Dynamical Processes on Complex Networks

TLDR
A new and recent account presents a comprehensive explanation of the effect of complex connectivity patterns on dynamical phenomena in a vast number of everyday systems that can be represented as large complex networks.

Chameleon: Hierarchical Clustering Using Dynamic Modeling

TLDR
Chameleon's key feature is that it accounts for both interconnectivity and closeness in identifying the most similar pair of clusters, which is important for dealing with highly variable clusters.

Density-Based Clustering Based on Hierarchical Density Estimates

TLDR
This work proposes a theoretically and practically improved density-based, hierarchical clustering method, providing a clustering hierarchy from which a simplified tree of significant clusters can be constructed, and proposes a novel cluster stability measure.

Density-Based Clustering Validation

TLDR
A relative validation index for density-based, arbitrarily shaped clusters is proposed that assesses clustering quality based on the relative density connection between pairs of objects and is formulated on the basis of a new kernel density function.

On comparing partitions

Rand (1971) proposed the Rand Index to measure the stability of two partitions of one set of units. Hubert and Arabie (1985) corrected the Rand Index for chance (Adjusted Rand Index). In this paper,

mclust Version 4 for R : Normal Mixture Modeling for Model-Based Clustering , Classification , and Density Estimation

TLDR
This version of mclust provides functions for parameter estimation via the EM algorithm for normal mixture models with a variety of covariance structures, and functions for simulation from these models.

Statistical Comparisons of Classifiers over Multiple Data Sets

  • J. Demšar
  • Computer Science
    J. Mach. Learn. Res.
  • 2006
TLDR
A set of simple, yet safe and robust non-parametric tests for statistical comparisons of classifiers is recommended: the Wilcoxon signed ranks test for comparison of two classifiers and the Friedman test with the corresponding post-hoc tests for comparisons of more classifiers over multiple data sets.