Skip to main content
SpringerLink
Log in

A fuzzy clustering based method for attributed graph partitioning

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Graph partitioning methods in data mining have been widely used to discover protein complexes in protein–protein interaction (PPI) network. However, PPI networks with attributes need more effective attribute graph partitioning methods. Attribute graph partitioning aims to obtain high quality partitions satisfying the requirement: nodes in the same partition not only connect to each other more densely but also share more similar attribute values. In this paper, we propose a novel method for attributed graph partitioning based on fuzzy clustering. This method firstly devises a unified similarity measure using SimRank to construct the fuzzy similarity matrix of the attributed graph and can integrate structural and attribute similarities of nodes into a flexible weighted framework. Then it deduces the corresponding fuzzy equivalent matrix using fuzzy set theory. Finally, the result of partitioning can be obtained using fuzzy clustering algorithm. We conduct some experiments on several typical attributed graphs, which can also simulate PPI networks with attributes. The results show that our method is very effective to identify high quality partitions of attributed graphs and even performs better than some representative methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the 18th annual ACM-SIAM symposium discrete algorithms, ACM, pp 1027–1035

  • Boobalan MP, Lopez D, Gao XZ (2016) Graph clustering using k-neighbourhood attribute structural similarity. Appl Soft Comput 47:216–223

    Article  Google Scholar 

  • Cecile B, David CJ, Matteo M, Barbora M (2015) Clustering attributed graphs: models, measures and methods. Netw Sci 3(3):408–444

    Article  Google Scholar 

  • Cheng H, Zhou Y, Yu JX (2011) Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans Knowl Discov D 5(2):1–33

    Article  MathSciNet  Google Scholar 

  • Dai T, Zhu L, Cai XY, Pan SR, Yuan S (2018) Explore semantic topics and author communities for citation recommendation in bipartite bibliographic network. J Amb Intel Hum Comp 9:957–975

    Article  Google Scholar 

  • Fang YX, Cheng R, Luo SQ (2016) Effective community search for large attributed graphs. VLDB J 9(12):1233–1244

    Google Scholar 

  • Hutair MB, Aghbari ZA, Kamel I (2016) Social community detection based on node distance and interest. In: Proceedings of IEEE/ACM 3rd international conference on big data computing, applications and technologies, IEEE, pp 274–289

  • He TT, Chan KCC (2018) Evolutionary graph clustering for protein complex identification. IEEE ACM Trans Comput Bioinf 15(3):892–904

    Article  Google Scholar 

  • He CB, Fei X, Li HC, Liu hai, Tang T, Chen QM (2017a) Community discovery in large-scale complex networks using distributed SimRank nonnegative matrix factorization. In: Proceedings of the 5th international conference on advanced cloud and big data, IEEE, pp 226–231

  • He CB, Fei X, Li HC, Tang Y, Liu H, Chen QM (2017b) A multi-view clustering method for community discovery integrating links and tags. In: Proceedings of the 14th IEEE international conference on e-business engineering, IEEE, pp 23–30

  • He CB, Li HC, Fei X, Yang AT, Tang Y, Zhu J (2017c) A topic community-based method for friend recommendation in large-scale online social networks. Concurr Comput Pract Exp 29(6):e3924

    Article  Google Scholar 

  • Jin J, Liu Y, Yang LT (2012) An efficient detecting communities algorithm with self-adapted fuzzy C-means clustering in complex networks. In: Proceedings of the 11th international conference on trust, security and privacy in computing and communications, IEEE, pp 1988–1993

  • Jeh G, Widom J (2002) SimRank: a measure of structural-context similarity. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 538–543

  • Liu H, He J, Zhu D, Ling CX, Du X (2013) Measuring similarity based on link information: a comparative study. IEEE Trans Knowl Data Eng 25:2823–2840

    Article  Google Scholar 

  • Noveiri E, Naderan M, Alavi SE (2015) Community detection in social networks using ant colony algorithm and fuzzy clustering. In: Proceedings of the 5th international conference on computer and knowledge engineering, IEEE, pp 73–79

  • Sun PG (2015) Community detection by fuzzy clustering. Physica A 419:408–416

    Article  Google Scholar 

  • Stelzl U, Worm U, Lalowski M (2005) A human protein-protein interaction network: a resource for annotating the proteome. Cell 122(6):957–968

    Article  Google Scholar 

  • Tommasel A, Godoy D (2018) Multi-view community detection with heterogeneous information from social media data. Neurocomputing 289:195–219

    Article  Google Scholar 

  • Wang X, Liu G, Li J (2014) A detecting community method in complex networks with fuzzy clustering. In: Proceedings of 1st international conference on data science and advanced analytics, IEEE, pp 484–490

  • Xu ZQ, Ke YP (2016) Effective and efficient spectral clustering on text and link data. In: Proceedings of the 25th ACM international on conference on information and knowledge management, ACM, pp 357–366

  • Xu ZQ, Ke YP, Wang Y, Cheng H, Cheng J (2012) A model-based approach to attributed graph clustering. In: Proceedings of the 28th ACM SIGMOD international conference on management of data, ACM, pp 505–516

  • Ye W, Zhou LF, Sun X, Plant C, Bohm C (2017) Attributed graph clustering with unimodal normalized cut. In: Proceedings of the 2017 Joint European conference on machine learning and knowledge discovery in databases, Springer, New York, pp 601–606

  • Zhang HS, Lin H, Wang YP (2018a) A new scheme for urban impervious surface classification from SAR images. ISPRS J Photogram 139:103–118

    Article  Google Scholar 

  • Zhang HS, Li J, Wang T, Lin H, Zheng ZZ, Li Y, Lu YF (2018b) A manifold learning approach to urban land cover classification with optical and radar data. Landsc Urban Plan 172:11–24

    Article  Google Scholar 

  • Zanghi H, Volant S, Ambroise C (2010) Clustering based on random graph model embedding vertex features. Pattern Recogn Lett 31(9):830–836

    Article  Google Scholar 

  • Zhu J, Wu XC, Lin XQ, Xiao DY, Xiao J, He CB (2017) A self-learning graph clustering approach for protein complexes detection. Control Theory A 34(6):776–782

    Google Scholar 

  • Zheng WG, Zou L, Chen L, Zhao DY (2017) Efficient SimRank-based similarity join. ACM Trans Database Syst 42(3):1–16

    Article  MathSciNet  Google Scholar 

  • Zhang HS, Zhang YZ, Lin H (2012) A comparison study of impervious surfaces estimation using optical and SAR remote sensing images. Int J Appl Earth Obs 18:148–156

    Article  Google Scholar 

  • Zhang YZ, Zhang HS, Lin H (2014) Improving the impervious surfaces estimation with combined use of optical and SAR remote sensing images. Remote Sens Environ 141:155–167

    Article  Google Scholar 

  • Zhu R, Zou ZN, Li JZ (2016) SimRank computation on uncertain graphs. In: Proceedings of the 32nd IEEE international conference on data engineering, IEEE, pp 565–576

Download references

Acknowledgements

This work was partially supported by the following projects: National Natural Science Foundation of China (No. 61471133), Science and Technology Support Program of Guangdong Province, China (Nos. 2017A040405057, 2017A030303074, 2016A030303058, 2017B010126001, 2017A070712019, 2016A070712020, 2015A040405014, 2016A040402043, 2016A030303058), Science, Technology Support Program of Guangzhou City, China (Nos. 201604016035, 201604046017, 201704020030, 201704030098, 201807010043) and University Technology Support Program of Guangdong Province, China (Nos. 2016KZDXM001, 2017GCZX001, 2016GCZX001, 2017KTSCX094, 2017KQNCX098).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Zhongkai University of Agriculture and Engineering, Guangzhou, China

    Chaobo He, Shuangyin Liu, Lei Zhang & Jianhua Zheng

Authors
  1. Chaobo He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuangyin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianhua Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuangyin Liu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, C., Liu, S., Zhang, L. et al. A fuzzy clustering based method for attributed graph partitioning. J Ambient Intell Human Comput 10, 3399–3407 (2019). https://doi.org/10.1007/s12652-018-1054-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-1054-2

Keywords

Search

Navigation