Abstract
The vertex-clustering algorithm based on intra connection ratio (MV-ICR algorithm) is a graph-clustering algorithm proposed by Moussiades and Vakali[Clustering dense graph: A web site graph paradigm. Information Processing and Management, 2010, 46:247-267]. In this paper, we propose a new conception called cluster-clique for vertex-clustering of graphs. And based on the cluster-clique and the intra connection ratio, a new vertex-clustering algorithm is proposed. This algorithm is more reasonable and effective than MV-ICR algorithm for some clusters which have the same maximum intra connection ratio.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alexandros, N., Yannis, T., Yannis, M.: C2P: clustering based on closest pairs. In: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 331–340. Morgan Kaufmann Publishers, Roma (2001)
Bradley, P.S., Mangasarian, L.: k-plane Clustering. Journal of Global Optimization 16(1), 23–32 (2000)
Brandes, U., Gaertler, M., Wagner, D.: Engineering graph clustering: Models and experimental evaluation. ACM Journal of Experimental Algorithmics 12(1.1), 1–5 (2007)
Eades, P., Huang, M.L.: Navigating clustered graphs using force-directed methods. Journal of Graph Algorithms and Applications 4(3), 157–181 (2002)
Gomory, R., Hu, T.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics 9(4), 551–570 (1961)
Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23, 401–417 (2002)
Kaburlasos, V.G., Moussiades, L., Vakali, A.: Granular graph clustering in the web. In: Proceedingsof the 8th International Conference on Natural Computing, pp. 1639–1645. World Scientific Publishing, Utah (2007)
Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition 36(10), 2213–2223 (2003)
Moussiades, L., Vakali, A.: Clustering dense graph: A web site graph paradigm. Information Processing and Management 46, 247–267 (2010)
Moussiades, L., Vakali, A.: PDetect: A clustering approach for detecting plagiarism in source code datasets. The Computer Journal 48(6), 651–661 (2005)
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review E 69(066133), 1–5 (2004)
Palla, G., Dernyi, I., Farkas, I.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
Saha, B., Mitra, P.: Dynamic algorithm for graph clustering using minimum cut tree. In: ICDM Workshops, pp. 667–671 (2006)
Serratosa, F., Alquezar, R., Sanfeliu, A.: Synthesis of function-described graphs and clustering of attributed graphs. International Journal of Pattern Recognition and Artificial Intelligence 16(6), 621–655 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, D., Zhang, B., Wang, K. (2014). A Vertex-Clustering Algorithm Based on the Cluster-Clique. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8631. Springer, Cham. https://doi.org/10.1007/978-3-319-11194-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-11194-0_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11193-3
Online ISBN: 978-3-319-11194-0
eBook Packages: Computer ScienceComputer Science (R0)