An algorithm for identifying useful structure in graphs clustering

2nd International Workshop on Education Technology and Computer Science, ETCS 2010

Volumn 1, Issue , 2010, Pages 63-66

  Chen, Dongming ^a   Xu, Xiaowei ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b University of Arkansas ^*  (United States)

Author keywords

Breadth first search; Clustering; Complex networks

Indexed keywords

BREADTH-FIRST-SEARCH; CLUSTERING METHODS; COMPLEX NETWORKS; DENDROGRAMS; HIERARCHICAL CLUSTERS; OTHER ALGORITHMS; REAL DATA SETS; RUNNING TIME; SYNTHETIC NETWORKS;

CIRCUIT THEORY; COMPUTER SCIENCE; EDUCATION COMPUTING; ENGINEERING EDUCATION; HIERARCHICAL SYSTEMS;

CLUSTERING ALGORITHMS;

EID: 77953178880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ETCS.2010.222     Document Type: Conference Paper

References (17)

1. Zach Solan, David Horn, Eytan Ruppin, Shimon Edelman. Unsupervised learning of natural languages. PNAS, 2005, 102(33):11629-11634.
2. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, X. Xu. Incremental Clustering for Mining in a Data Warehouse Environment. In Proc. of 24th VLDB Conference, 1998.
3. M. Ester, H.-P. Kriegel, J. Sander, X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. Of ACM SIGKDD96, 1996, pp.226-231.
4. A. Clauset, M. E. J. Newman, C. Moore. Finding community structure in very large networks. Physical Review, E 70, 066111 (2004).
5. C. Ding, X. He, H. Zha, M. Gu, H. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proc. of ICDM, 2001.
6. J. Shi, J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8).
7. M. E. J. Newman, M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004).
8. R. Guimera, L. A. N. Amaral. Functional cartography of complex metabolic networks. Nature, 2005, 433:895-900. (Pubitemid 40314902)
9. Watts DJ, Strogatz SH. Collective dynamics of 'small-world' networks. Nature, 1998, 393:440-442.
10. Erdös P, Rényi A. On random graphs. Publ. Math (Debrecen), 1959, 6:290-297.
11. Faloutsos M, Faloutsos P, Faloutsos C. On Power-Law Relationships of the Internet Topology. SIGCOMM, 1999.
12. A.-L. Barabási, Z. N. Oltvai. Nature Reviews Genetics 5, 2004, 101-113.
13. http://cs.unm.edu/~aaron/research/fastmodularity.htm.
14. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 1977, 33: 452-473.
15. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, S. M. Dawson. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations-Can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology, 2003, 54(4):396-405.
16. D. Lusseau. The emergent properties of a dolphin social network. In Proc. R. Soc. London B, 2003 (sup.), 270:186-188.
17. M. Girvan, M. E. J. Newman. Community structure in social and biological networks. PNAS, 2002, 99(12):7821-7826. (Pubitemid 34650963)