乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:34:19Z","timestamp":1726850059677},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Electron Commer Res"],"published-print":{"date-parts":[[2021,12]]},"abstract":"Abstract<\/jats:title>Automated community detection is an important problem in the study of complex networks. The idea of community detection is closely related to the concept of data clustering in pattern recognition. Data clustering refers to the task of grouping similar objects and segregating dissimilar objects. The community detection problem can be thought of as finding groups of densely interconnected nodes with few connections to nodes outside the group. A node similarity measure is proposed here that finds the similarity between two nodes by considering both neighbors and non-neighbors of these two nodes. Subsequently, a method is introduced for identifying communities in complex networks using this node similarity measure and the notion of data clustering. The significant characteristic of the proposed method is that it does not need any prior knowledge about the actual communities of a network. Extensive experiments on several real world and artificial networks with known ground-truth communities are reported. The proposed method is compared with various state of the art community detection algorithms by using several criteria, viz. normalized mutual information, f-measure etc. Moreover, it has been successfully applied in improving the effectiveness of a recommender system which is rapidly becoming a crucial tool in e-commerce applications. The empirical results suggest that the proposed technique has the potential to improve the performance of a recommender system and hence it may be useful for other e-commerce applications.<\/jats:p>","DOI":"10.1007\/s10660-019-09395-y","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T08:02:35Z","timestamp":1578297755000},"page":"917-954","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Towards effective discovery of natural communities in complex networks and implications in e-commerce"],"prefix":"10.1007","volume":"21","author":[{"given":"Swarup","family":"Chattopadhyay","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9536-8075","authenticated-orcid":false,"given":"Tanmay","family":"Basu","sequence":"additional","affiliation":[]},{"given":"Asit K.","family":"Das","sequence":"additional","affiliation":[]},{"given":"Kuntal","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Late C. A.","family":"Murthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"issue":"8","key":"9395_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","volume":"22","author":"B Adamcsek","year":"2006","unstructured":"Adamcsek, B., Palla, G., Farkas, I. J., Der\u00e9nyi, I., & Vicsek, T. (2006). CFinder: Locating cliques and overlapping modules in biological networks. Bioinformatics, 22(8), 1021\u20131023.","journal-title":"Bioinformatics"},{"key":"9395_CR2","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn, Y. Y., Bagrow, J. P., & Lehmann, S. (2010). Link communities reveal multiscale complexity in networks. Nature, 466, 761.","journal-title":"Nature"},{"issue":"1","key":"9395_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., & Barabasi, A. L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1), 47\u201397.","journal-title":"Reviews of Modern Physics"},{"key":"9395_CR4","doi-asserted-by":"crossref","unstructured":"Amelio, A., & Pizzuti, C. (2014). Overlapping community discovery methods: A survey. In Social networks: Analysis and case studies (pp. 105\u2013125).","DOI":"10.1007\/978-3-7091-1797-2_6"},{"key":"9395_CR5","doi-asserted-by":"crossref","unstructured":"Baluja, S., Seth, R., Sivakumar, D., Jing, Y., Yagnik, J., Kumar, S., Ravichandran, D., & Aly, M. (2008). Video suggestion and discovery for youtube: Taking random walks through the view graph. In Proceedings of the 17th international conference on World Wide Web (pp. 895\u2013904). ACM.","DOI":"10.1145\/1367497.1367618"},{"issue":"1","key":"9395_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.13176\/11.459","volume":"8","author":"T Basu","year":"2013","unstructured":"Basu, T., & Murthy, C. A. (2013). Cues: A new hierarchical approach for document clustering. Journal of Pattern Recognition Research, 8(1), 66\u201384.","journal-title":"Journal of Pattern Recognition Research"},{"key":"9395_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2015.03.038","volume":"311","author":"T Basu","year":"2015","unstructured":"Basu, T., & Murthy, C. A. (2015). A similarity assessment technique for effective grouping of documents. Information Sciences, 311, 149\u2013162.","journal-title":"Information Sciences"},{"key":"9395_CR8","unstructured":"Bell, R. M., & Koren, Y. (2007). Improved neighborhood-based collaborative filtering. In KDD cup and workshop at the 13th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 7\u201314). Citeseer."},{"issue":"10","key":"9395_CR9","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"9","key":"9395_CR10","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Hongchao, L., et al. (2003). Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Research, 31(9), 2443\u20132450.","journal-title":"Nucleic Acids Research"},{"key":"9395_CR11","doi-asserted-by":"publisher","first-page":"121338","DOI":"10.1016\/j.physa.2019.121338","volume":"527","author":"S Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, S., Basu, T., Das, A. K., Ghosh, K., & Murthy, C. A. (2019). A similarity based generalized modularity measure towards effective community discovery in complex networks. Physica A: Statistical Mechanics and its Applications, 527, 121338.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"9395_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-019-00820-4","author":"S Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, S., Das, A. K., & Ghosh, K. (2019). Finding patterns in the degree distribution of real-world complex networks: Going beyond power law. Pattern Analysis and Applications. https:\/\/doi.org\/10.1007\/s10044-019-00820-4.","journal-title":"Pattern Analysis and Applications"},{"issue":"6","key":"9395_CR13","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M. E. J., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70(6), 066111.","journal-title":"Physical Review E"},{"key":"9395_CR14","unstructured":"Coscia, M., Giannotti, F., & Pedreschi, D. (2012). A classification for community discovery methods in complex networks. In CoRR. arXiv:abs\/1206.3552."},{"issue":"1","key":"9395_CR15","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2013.03.012","volume":"80","author":"P De Meo","year":"2014","unstructured":"De Meo, P., Ferrara, E., Fiumara, G., & Provetti, A. (2014). Mixing local and global information for community detection in large networks. Journal of Computer and System Sciences, 80(1), 72\u201387.","journal-title":"Journal of Computer and System Sciences"},{"key":"9395_CR16","doi-asserted-by":"crossref","unstructured":"Desrosiers, C., & Karypis, G. (2011). A comprehensive survey of neighborhood-based recommendation methods. In Recommender systems handbook (pp. 107\u2013144). Springer.","DOI":"10.1007\/978-0-387-85820-3_4"},{"key":"9395_CR17","unstructured":"Ding, C., He, X., Zha, H., Gu, M., & Simon, H. (2001). A min\u2013max cut algorithm for graph partitioning and data clustering. In: Proceeding of ICDM, New York, USA."},{"issue":"6","key":"9395_CR18","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1002\/wics.1319","volume":"6","author":"S Harenberg","year":"2014","unstructured":"Harenberg, S., Bello, G., Gjeltema, L., Ranshous, S., Harlalka, J., Seay, R., et al. (2014). Community detection in large-scale networks: A survey and empirical evaluation. Wiley Interdisciplinary Reviews: Computational Statistics, 6(6), 426\u2013439.","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"},{"issue":"8","key":"9395_CR19","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1093\/bioinformatics\/btq078","volume":"26","author":"P Jiang","year":"2010","unstructured":"Jiang, P., & Singh, M. (2010). SPICi: A fast clustering algorithm for large biological networks. Bioinformatics, 26(8), 1105\u20131111.","journal-title":"Bioinformatics"},{"issue":"5","key":"9395_CR20","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., & Fortunato, S. (2009). Community detection algorithms: A comparative analysis. Physical Review E, 80(5), 056117.","journal-title":"Physical Review E"},{"issue":"4","key":"9395_CR21","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008). Benchmark graphs for testing community detection algorithms. Physical Review E, 78(4), 046110.","journal-title":"Physical Review E"},{"issue":"4","key":"9395_CR22","doi-asserted-by":"publisher","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A., Radicchi, F., Ramasco, J. J., & Fortunato, S. (2011). Finding statistically significant communities in networks. PLoS ONE, 6(4), e18961.","journal-title":"PLoS ONE"},{"key":"9395_CR23","volume-title":"Testing of statistical hypotheses","author":"EL Lehmann","year":"1976","unstructured":"Lehmann, E. L. (1976). Testing of statistical hypotheses. New York: Wiley."},{"key":"9395_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K. J., & Mahoney, M. (2010). Empirical comparison of algorithms for network community detection. In Proceedings of the 19th international conference on World wide web (pp. 631\u2013640). ACM.","DOI":"10.1145\/1772690.1772755"},{"key":"9395_CR25","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","volume":"1","author":"G Linden","year":"2003","unstructured":"Linden, G., Smith, B., & York, J. (2003). Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 1, 76\u201380.","journal-title":"IEEE Internet Computing"},{"issue":"6","key":"9395_CR26","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L., & Zhou, T. (2011). Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, 390(6), 1150\u20131170.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"9395_CR27","first-page":"693","volume":"3","author":"K Macropol","year":"2010","unstructured":"Macropol, K., & Singh, A. (2010). Scalable discovery of best clusters on large graphs. VLDB, 3, 693\u2013702.","journal-title":"VLDB"},{"issue":"4","key":"9395_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros, F. D., & Vazirgiannis, M. (2013). Clustering and community detection in directed networks: A survey. Physics Reports, 533(4), 95\u2013142.","journal-title":"Physics Reports"},{"key":"9395_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen, D.\u00a0T., Thai, M. T., Nguyen, N.\u00a0P., & Dinh, T. N. (2011). Overlapping community structures and their detection on social networks. In Proceedings of international conference on social computing (pp. 35\u201340), Boston: IEEE.","DOI":"10.1109\/PASSAT\/SocialCom.2011.16"},{"issue":"23","key":"9395_CR30","doi-asserted-by":"publisher","first-page":"8578","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M. E. J. (2006). Modularity and community structure in networks. PNAS, 103(23), 8578\u20138582.","journal-title":"PNAS"},{"issue":"6","key":"9395_CR31","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M. E. J. (2004). Fast algorithm for detecting community structure in networks. Physical Review E, 69(6), 066133.","journal-title":"Physical Review E"},{"issue":"3","key":"9395_CR32","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M. E. J. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 036104.","journal-title":"Physical Review E"},{"issue":"2","key":"9395_CR33","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman, M. E. J. (2001). The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2), 404\u2013409.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"9395_CR34","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45(2), 167\u2013256.","journal-title":"SIAM Review"},{"issue":"2","key":"9395_CR35","doi-asserted-by":"publisher","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2), 026118.","journal-title":"Physical Review E"},{"key":"9395_CR36","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1090\/conm\/588\/11701","volume":"588","author":"M Ovelg\u00f6nne","year":"2012","unstructured":"Ovelg\u00f6nne, M., & Geyer-Schulz, A. (2012). An ensemble learning strategy for graph clustering. Graph Partitioning and Graph Clustering, 588, 187.","journal-title":"Graph Partitioning and Graph Clustering"},{"key":"9395_CR37","doi-asserted-by":"crossref","unstructured":"Paolillo, J. C. (2008). Structure and network in the YouTube core. In Proceedings of international conference on system sciences (p. 156).","DOI":"10.1109\/HICSS.2008.415"},{"key":"9395_CR38","doi-asserted-by":"crossref","unstructured":"Parimi, R., & Caragea, D. (2014). Community detection on large graph datasets for recommender systems. In 2014 IEEE international conference on data mining workshop (pp. 589\u2013596). IEEE.","DOI":"10.1109\/ICDMW.2014.159"},{"key":"9395_CR39","doi-asserted-by":"crossref","unstructured":"Pons, P., & Latapy, M. (2005). Computing communities in large networks using random walks. In Computer and information sciences-ISCIS 2005 (pp. 284\u2013293). Springer.","DOI":"10.1007\/11569596_31"},{"key":"9395_CR40","doi-asserted-by":"crossref","unstructured":"Prat-P\u00e9rez, A., Dominguez-Sal, D., & Larriba-Pey, J.-L. (2014). High quality, scalable and parallel community detection for large real graphs. In Proceedings of the 23rd international conference on World Wide Web (pp. 225\u2013236). ACM.","DOI":"10.1145\/2566486.2568010"},{"issue":"3","key":"9395_CR41","doi-asserted-by":"publisher","first-page":"036","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U. N., Albert, R., & Kumara, S. (2007). Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3), 036\u2013106.","journal-title":"Physical Review E"},{"key":"9395_CR42","volume-title":"Formulae and tables for statistical work","year":"1966","unstructured":"Rao, C. R., Mitra, S. K., Matthai, A., & Ramamurthy, K. G. (Eds.). (1966). Formulae and tables for statistical work. Calcutta: Statistical Publishing Society."},{"key":"9395_CR43","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E Ravasz","year":"2002","unstructured":"Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barab\u00e1si, A.-L. (2002). Hierarchical organization of modularity in metabolic networks. Science, 297, 1551.","journal-title":"Science"},{"key":"9395_CR44","doi-asserted-by":"crossref","unstructured":"Rossi, R. A., & Ahmed, N. K. (2015). The network data repository with interactive graph analytics and visualization. In Proceedings of the twenty-ninth AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"9395_CR45","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10660-017-9257-8","volume":"18","author":"JK Rout","year":"2018","unstructured":"Rout, J. K., Choo, K.-K. R., Dash, A. K., Bakshi, S., Jena, S. K., & Williams, K. L. (2018). A model for sentiment and emotion analysis of unstructured social media text. Electronic Commerce Research, 18(1), 181\u2013199.","journal-title":"Electronic Commerce Research"},{"key":"9395_CR46","unstructured":"Sahebi, S., & Cohen, W. W. (1997). Community-based recommendations: A solution to the cold start problem. In Proceedings of WOODSTOCK\u201997."},{"key":"9395_CR47","unstructured":"Sarwar, B. M., Karypis, G., Konstan, J., & Riedl, J. (2002). Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In Proceedings of the fifth international conference on computer and information technology (Vol. 1, pp. 291\u2013324)."},{"key":"9395_CR48","doi-asserted-by":"crossref","unstructured":"Schafer, J. B., Frankowski, D., Herlocker, J., & Sen, S. (2007). Collaborative filtering recommender systems. In The adaptive web (pp. 291\u2013324). Springer.","DOI":"10.1007\/978-3-540-72079-9_9"},{"key":"9395_CR49","unstructured":"Schr\u00f6der, G., Thiele, M., & Lehner, W. (2011). Setting goals and choosing metrics for recommender system evaluations. In UCERSTI2 workshop at the 5th ACM conference on recommender systems, Chicago, USA (Vol. 23, p. 53)."},{"issue":"4","key":"9395_CR50","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/asi.4630240406","volume":"24","author":"H Small","year":"1973","unstructured":"Small, H. (1973). Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the American Society for Information Science, 24(4), 265\u2013269.","journal-title":"Journal of the American Society for Information Science"},{"key":"9395_CR51","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl, A., & Ghosh, J. (2003). Cluster ensembles\u2014A knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research, 3, 583\u2013617.","journal-title":"The Journal of Machine Learning Research"},{"key":"9395_CR52","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425","author":"X Su","year":"2009","unstructured":"Su, X., & Khoshgoftaar, T. M. (2009). A survey of collaborative filtering techniques. Advances in Artificial Intelligence. https:\/\/doi.org\/10.1155\/2009\/421425.","journal-title":"Advances in Artificial Intelligence"},{"issue":"3","key":"9395_CR53","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.elerap.2010.11.002","volume":"10","author":"W Roung-Shiunn","year":"2011","unstructured":"Roung-Shiunn, W., & Chou, P.-H. (2011). Customer segmentation of multiple category data in e-commerce using a soft-clustering approach. Electronic Commerce Research and Applications, 10(3), 331\u2013341.","journal-title":"Electronic Commerce Research and Applications"},{"issue":"1","key":"9395_CR54","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10660-016-9233-8","volume":"17","author":"D Wang","year":"2017","unstructured":"Wang, D., Li, J., Kaiquan, X., & Yizhen, W. (2017). Sentiment community detection: Exploring sentiments and relationships in social networks. Electronic Commerce Research, 17(1), 103\u2013132.","journal-title":"Electronic Commerce Research"},{"key":"9395_CR55","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie, J., Kelley, S., & Szymanski, B. K. (2013). Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Computing Surveys, 45, 43.","journal-title":"ACM Computing Surveys"},{"key":"9395_CR56","doi-asserted-by":"crossref","unstructured":"Yang, J., & Leskovec, J. (2012). Community-affiliation graph model for overlapping network community detection. In 2012 IEEE 12th international conference on data mining (ICDM) (pp. 1170\u20131175). IEEE.","DOI":"10.1109\/ICDM.2012.139"},{"issue":"1","key":"9395_CR57","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., & Leskovec, J. (2015). Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, 42(1), 181\u2013213.","journal-title":"Knowledge and Information Systems"},{"key":"9395_CR58","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang, Z., Algesheimer, R., & Tessone, C. J. (2016). A comparative analysis of community detection algorithms on artificial networks. Scientific Reports, 6, 30750.","journal-title":"Scientific Reports"},{"key":"9395_CR59","doi-asserted-by":"crossref","unstructured":"Ying, J.-C., Shi, B.-N., Tseng, V. S., Tsai, H.-W., Cheng, K. H., & Lin, S.-C. (2013). Preference-aware community detection for item recommendation. In 2013 conference on technologies and applications of artificial intelligence (pp. 49\u201354). IEEE.","DOI":"10.1109\/TAAI.2013.23"},{"key":"9395_CR60","doi-asserted-by":"crossref","unstructured":"Zhongying, Z., Shaoqiang, Z., Li, C., Jinqing, S., Liang, C., & Francisco, C. (2018). A comparative study on community detection methods in complex networks. Journal of Intelligent & Fuzzy Systems, pages 1\u201310.","DOI":"10.3233\/JIFS-17682"},{"key":"9395_CR61","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou, T., L\u00fc, L., & Zhang, Y. C. (2009). Predicting missing links via local information. European Physical Journal B, 71, 623\u2013630.","journal-title":"European Physical Journal B"}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-019-09395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10660-019-09395-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-019-09395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T01:54:45Z","timestamp":1665366885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10660-019-09395-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["9395"],"URL":"https:\/\/doi.org\/10.1007\/s10660-019-09395-y","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"6 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}