The Program for Changjiang Scholars and Innovative Research Team in University(IRT1078);The Major National Science and Technology Program(2011ZX03005-002);The National Natural Science Foundation of China(61303219);The Natural Science Basic Research Plan in Shaanxi Province(2014JQ8297);The Natural Science Basic Research Plan in Shaanxi Province(2014JQ8295);The Fundamental Research Funds for the Central Universities(Y10000903006);The Fundamental Research Funds for the Central Universities(K5051303007)
Clustering is an important research field in data mining.Based on dynamical synchronization model
an efficient synchronization clustering algorithm ESYN is proposed.Firstly
based on local structure information of a non-vector network
a new concept vertex similarity is brought up to describe the link density between vertices.Secondly
the network is vectoried by OPTICS algorithm and turned into one-dimensional coordination sequence.Finally
global coupling analysis is applied to generalized Kuramoto synchronization model
synchronization radius is increased and the optimal clustering result is automatically selected.The experimental results on a large number of synthetic and real-world networks show that proposed algorithm achieves high accuracy.
关键词
Keywords
references
GUAN J , GAN Y , WANG H . Discovering pattern-based subspace clusters by pattern tree [J ] . Knowledge-Based Systems , 2009 , 22 ( 8 ): 569 - 579 .
ZHU S , WANG D , LI T . Data clustering with size constraints [J ] . Knowledge-Based Systems , 2010 , 23 ( 8 ): 883 - 889 .
ESTER M , KRIEGEL H P , SANDER J , et al . A density-based algorithmfor discovering clusters in large spatial databases with noise [A ] . Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining [C ] . 1996 . 226 - 231 .
KARYPIS G , HAN E H , KUMAR V . Chameleon:hierarchical clusteringusing dynamic modeling [J ] . Computer , 1999 , 32 ( 8 ): 68 - 75 .
NEWMAN M E , GIRVAN M . Finding and evaluating community structurein networks [J ] . Physical review E , 2004 , 69 ( 2 ):026113.
CLAUSET A , NEWMAN M E , Moore C . Finding community structure invery large networks [J ] . Physical review E , 2004 , 70 ( 6 ): 6111 - 6116 .
LEUNG I X , HUI P , LIO P , et al . Towards real-time communitydetection in large networks [J ] . Physical Review E , 2009 , 79 ( 6 ): 6107 - 6117 .
NEWMAN M . Detecting community structure in networks [J ] . The European Physical Journal B-Condensed Matter and Complex System , 2004 , 38 ( 2 ): 321 - 330 .
DEKKER A H , TAYLOR R . Synchronization properties of trees in the Kuramoto model [J ] . SIAM Journal on Applied Dynamical Systems , 2013 , 12 ( 2 ): 596 - 617 .
BÖHM C , PLANT C , SHAO J , et al . Clustering by synchronization [A ] . Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining [C ] . 2010 . 583 - 592 .
HUANG J B , BAI Y , KANG J M , et al . A network community detection method based on dynamic model of synchronization [J ] . Journal of Computer Research and Development , 2012 , 49 ( 10 ): 2198 - 2207 .
ANKERST M , BREUNIG M M , KRIEGEL H P , et al . OPTICS:orderingpoints to identify the clustering structure [J ] . ACM SIGMOD Record , 1999 , 28 ( 2 ): 49 - 60 .
KITSAK M , GALLOS L K , HAVLIN S , et al . Identification of influential spreaders in complex networks [J ] . Nature Physics , 2010 , 6 ( 11 ): 888 - 893 .
BRYAN K , LEISE T . The $25,000,000,000 eigenvector:The linear algebrabehind Google [J ] . Siam Review , 2006 , 48 ( 3 ): 569 - 581 .
GIRVAN M , NEWMAN E . Community structure in social and biologicalnetworks [J ] . PNAS , 2002 , 99 ( 12 ): 7821 - 7826 .
ZACHARY W W . An informationflow model for conflict and fission in small groups [J ] . Journal of anthropological research , 1977 , 33 ( 4 ): 452 - 473 .
VINH N X , EPPS J , BAILEY J . Information theoretic measures for clusterings comparison:is a correction for chance necessary [A ] . Proceedings of the 26th Annual International Conference on Machine Learning [C ] . ACM , 2009 . 1073 - 1080 .