[8] |
NEWMAN M . Detecting community structure in networks[J]. The European Physical Journal B-Condensed Matter and Complex System, 2004,38(2): 321-330.
|
[9] |
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.
|
[10] |
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.
|
[11] |
黄健斌, 白杨, 康剑梅 ,等. 一种基于同步动力学模型的网络社团发现方法[J]. 计算机研究与发展, 2012,49(10): 2198-2207. 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.
|
[12] |
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.
|
[13] |
KITSAK M , GALLOS L K , HAVLIN S ,et al. Identification of influential spreaders in complex networks[J]. Nature Physics, 2010,6(11): 888-893.
|
[14] |
BRYAN K , LEISE T . The $25,000,000,000 eigenvector:The linear algebrabehind Google[J]. Siam Review, 2006,48(3): 569-581.
|
[15] |
GIRVAN M , NEWMAN E . Community structure in social and biologicalnetworks[J]. PNAS, 2002,99(12): 7821-7826.
|
[16] |
ZACHARY W W . An informationflow model for conflict and fission in small groups[J]. Journal of anthropological research, 1977,33(4): 452-473.
|
[17] |
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.
|
[1] |
GUAN J , GAN Y , WANG H . Discovering pattern-based subspace clusters by pattern tree[J]. Knowledge-Based Systems, 2009,22(8): 569-579.
|
[2] |
ZHU S , WANG D , LI T . Data clustering with size constraints[J]. Knowledge-Based Systems, 2010,23(8): 883-889.
|
[3] |
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.
|
[4] |
KARYPIS G , HAN E H , KUMAR V . Chameleon:hierarchical clusteringusing dynamic modeling[J]. Computer, 1999,32(8): 68-75.
|
[5] |
NEWMAN M E , GIRVAN M . Finding and evaluating community structurein networks[J]. Physical review E, 2004,69(2):026113.
|
[6] |
CLAUSET A , NEWMAN M E , Moore C . Finding community structure invery large networks[J]. Physical review E, 2004,70(6): 6111-6116.
|
[7] |
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.
|