{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T07:11:52Z","timestamp":1694848312152},"reference-count":44,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems"],"published-print":{"date-parts":[[2018,12]]},"abstract":"Abstract<\/jats:title>Clustering helps in understanding the patterns present in networks and thus helps in getting useful insights. In real\u2010world complex networks, analysing the structure of the network plays a vital role in clustering. Most of the existing clustering algorithms identify disjoint clusters, which do not consider the structure of the network. Moreover, the clustering results do not provide consistency and precision. This paper presents an efficient parallel fuzzy clustering algorithm named \u201cPFCA\u201d for large complex networks using Hadoop and Pregel (parallel processing framework for large graphs). The proposed algorithm first selects the candidate cluster heads on the basis of their influence in the network and then determines the number of clusters by analysing the graph structure using PageRank algorithm. The proposed algorithm identifies both disjoint and fuzzy clusters efficiently and finds membership of only those vertices, which are the part of more than one cluster. The performance is validated on 6 real\u2010life networks having up to billions of connections. The experimental results show that the proposed algorithm scales up linearly with the increase in size of network. It is also shown that the proposed algorithm is efficient and has high precision in comparison with the other state\u2010of\u2010art fuzzy clustering algorithms in terms of F<\/jats:italic> score and modularity.<\/jats:p>","DOI":"10.1111\/exsy.12295","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T09:00:50Z","timestamp":1531990850000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PFCA: An influence\u2010based parallel fuzzy clustering algorithm for large complex networks"],"prefix":"10.1111","volume":"35","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3289-0354","authenticated-orcid":false,"given":"Vandana","family":"Bhatia","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering Thapar University Patiala India"}]},{"given":"Rinkle","family":"Rani","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Thapar University Patiala India"}]}],"member":"311","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.07.002"},{"key":"e_1_2_8_3_1","unstructured":"Apache Giraph. (2016). Retrieved March 10 2017 fromhttp:\/\/giraph.apache.org\/"},{"key":"e_1_2_8_4_1","first-page":"1027","article-title":"k\u2010means ++ : The advantages of careful seeding","author":"Arthur D.","year":"2007","journal-title":"Proceedings of the 18th annual ACM\u2010SIAM symposium on Discrete algorithms"},{"key":"e_1_2_8_5_1","first-page":"973","article-title":"Fast personalized PageRank on MapReduce","author":"Bahmani B.","year":"2011","journal-title":"Proceedings of ACM SIGMOD International Conference on Management of Data"},{"key":"e_1_2_8_6_1","unstructured":"Ball G. H. &Hall D. J.(1965).ISODATA a novel method of data anlysis and pattern classification.Technical Report NTIS AD 699616 Stanford Research Institute Stanford CA."},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2015.08.005"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(84)90020-7"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.005"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74839-7_12"},{"issue":"1","key":"e_1_2_8_12_1","first-page":"718","article-title":"A graph clustering method for community detection in complex networks","volume":"469","author":"Chun H.","year":"2017","journal-title":"Knowledge and Information Systems"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_8_15_1","unstructured":"Jin D. Yang B. &Idea A. T. M.(2013).Fast complex network clustering algorithm using agents.arXiv Preprint arXiv:1303.5912."},{"key":"e_1_2_8_16_1","unstructured":"J.Kunegis. (2016).The Koblenz Network Collection. Retrieved June 10 2016 fromhttp:\/\/konect.uni\u2010koblenz.de\/"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.02.003"},{"key":"e_1_2_8_18_1","unstructured":"Leskovec J. &Andrej K.(2014).Stanford Large Network Dataset Collection. Retrieved March 10 2017 fromhttps:\/\/snap.stanford.edu\/data\/"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.066107"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.08.003"},{"issue":"225","key":"e_1_2_8_21_1","first-page":"1","article-title":"Patterns of collaboration in complex networks: The example of a translational research network","volume":"14","author":"Long J. C.","year":"2014","journal-title":"BMC Health Services Research"},{"key":"e_1_2_8_22_1","first-page":"8","article-title":"GraphLab: A new framework for parallel machine learning","author":"Low Y.","year":"2010","journal-title":"Proceeedings of 26th Conference on Uncertainty in Artificial Intelligence"},{"key":"e_1_2_8_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-015-0367-0"},{"key":"e_1_2_8_24_1","first-page":"2339","article-title":"A spectral algorithm for improving graph partitions with applications to exploring data graphs locally","volume":"13","author":"Mahoney M. W.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/int.21743"},{"key":"e_1_2_8_26_1","first-page":"135","article-title":"Pregel: A system for large\u2010scale graph processing","author":"Malewicz G.","year":"2010","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of data"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-syb:20060038"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.016107"},{"key":"e_1_2_8_29_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnv005"},{"issue":"1999","key":"e_1_2_8_31_1","first-page":"1","article-title":"The PageRank citation ranking: Bringing order to the web","volume":"54","author":"Page L.","year":"1998","journal-title":"World Wide Web Internet and Web Information Systems"},{"key":"e_1_2_8_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_8_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.04.025"},{"key":"e_1_2_8_34_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00124"},{"issue":"16107","key":"e_1_2_8_35_1","first-page":"1","article-title":"Clustering algorithm for determining community structure in large networks","volume":"74","author":"Pujol J. M.","year":"2006","journal-title":"Physical Review E"},{"key":"e_1_2_8_36_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_8_37_1","first-page":"505","article-title":"Trinity\u2014A distributed graph engine on a memory cloud","author":"Shao B.","year":"2013","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"e_1_2_8_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.05.014"},{"key":"e_1_2_8_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.07.021"},{"issue":"6","key":"e_1_2_8_40_1","first-page":"1","article-title":"Efficiently identifying critical nodes in large complex networks","volume":"2","author":"Ventresca M.","year":"2015","journal-title":"Computational Social Networks"},{"key":"e_1_2_8_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.11.008"},{"key":"e_1_2_8_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13562-0_41"},{"key":"e_1_2_8_43_1","unstructured":"Wang P. Ribeiro B. Zhao J. Lui J. C. S. Towsley D. &Guan X.(2013).Practical characterization of large networks using neighborhood information.CoRR abs\/1311.3."},{"key":"e_1_2_8_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.109"},{"key":"e_1_2_8_45_1","first-page":"188","article-title":"Community detection using a neighborhood strength driven label propagation algorithm","author":"Xie J.","year":"2011","journal-title":"Proceedings of the IEEE 1st International Network Science Workshop"}],"container-title":["Expert Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fexsy.12295","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/exsy.12295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T03:05:39Z","timestamp":1694747139000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/exsy.12295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,18]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["10.1111\/exsy.12295"],"URL":"https:\/\/doi.org\/10.1111\/exsy.12295","archive":["Portico"],"relation":{},"ISSN":["0266-4720","1468-0394"],"issn-type":[{"value":"0266-4720","type":"print"},{"value":"1468-0394","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,18]]},"assertion":[{"value":"2017-10-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-27","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}