{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:57:01Z","timestamp":1726081021665},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030445836"},{"type":"electronic","value":"9783030445843"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44584-3_11","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:04:42Z","timestamp":1587510282000},"page":"132-144","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Dalleau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Couceiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malika","family":"Smail-Tabbone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"issue":"10","key":"11_CR1","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.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bojchevski, A., G\u00fcnnemann, S.: Bayesian robust attributed graph clustering: joint learning of partial anomalies and group structure (2018)","DOI":"10.1609\/aaai.v32i1.11642"},{"issue":"2","key":"11_CR3","first-page":"12","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng, H., Zhou, Y., Yu, J.X.: Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans. Knowl. Discov. Data (TKDD) 5(2), 12 (2011)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Combe, D., Largeron, C., Egyed-Zsigmond, E., G\u00e9ry, M.: Combining relations and text in scientific network clustering. In: 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1248\u20131253. IEEE (2012)","DOI":"10.1109\/ASONAM.2012.215"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-24465-5_16","volume-title":"Advances in Intelligent Data Analysis XIV","author":"D Combe","year":"2015","unstructured":"Combe, D., Largeron, C., G\u00e9ry, M., Egyed-Zsigmond, E.: I-Louvain: an attributed graph clustering method. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds.) IDA 2015. LNCS, vol. 9385, pp. 181\u2013192. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24465-5_16"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cruz, J.D., Bothorel, C., Poulet, F.: Entropy based community detection in augmented social networks. In: 2011 International Conference on Computational Aspects of Social Networks (CASoN), pp. 163\u2013168. IEEE (2011)","DOI":"10.1109\/CASON.2011.6085937"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-319-93040-4_38","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K Dalleau","year":"2018","unstructured":"Dalleau, K., Couceiro, M., Smail-Tabbone, M.: Unsupervised extremely randomized trees. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 478\u2013489. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_38"},{"key":"11_CR8","unstructured":"Dongen, S.: A cluster algorithm for graphs (2000)"},{"key":"11_CR9","unstructured":"Ehrlinger, L., W\u00f6\u00df, W.: Towards a definition of knowledge graphs. In: SEMANTiCS (Posters, Demos, SuCCESS) (2016)"},{"issue":"1","key":"11_CR10","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"11_CR11","unstructured":"Fan, M., Cao, K., He, Y., Grishman, R.: Jointly embedding relations and mentions for knowledge population. In: Proceedings of the International Conference Recent Advances in Natural Language Processing, pp. 186\u2013191 (2015)"},{"issue":"12","key":"11_CR12","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002). https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc. Natl. Acad. Sci."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864. ACM (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Huang, X., Li, J., Hu, X.: Accelerated attributed network embedding. In: Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 633\u2013641. SIAM (2017)","DOI":"10.1137\/1.9781611974973.71"},{"key":"11_CR15","unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: SODA 1993, pp. 21\u201330 (1993)"},{"key":"11_CR16","unstructured":"Krebs, V.: Political books network (2004, Unpublished). Retrieved from Mark Newman\u2019s website. www-personal.umich.edu\/mejn\/netdata"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A., Fortunato, S.: Limits of modularity maximization in community detection. Phys. Rev. E 84(6), 066122 (2011)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (TKDD) 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"Nov","key":"11_CR19","first-page":"2579","volume":"9","author":"L Maaten van der","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR20","unstructured":"Neville, J., Adler, M., Jensen, D.: Clustering relational data using attribute and link information. In: Proceedings of the Text Mining and Link Analysis Workshop, 18th International Joint Conference on Artificial Intelligence, pp. 9\u201315. Morgan Kaufmann Publishers, San Francisco (2003)"},{"issue":"23","key":"11_CR21","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"Oct","key":"11_CR22","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12(Oct), 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710. ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"issue":"8","key":"11_CR25","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-46784-X_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Stein","year":"1999","unstructured":"Stein, B., Niggemann, O.: On the nature of structure and its identification. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 122\u2013134. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46784-X_13"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-0-387-77672-9_19","volume-title":"Social Computing, Behavioral Modeling, and Prediction","author":"K Steinhaeuser","year":"2008","unstructured":"Steinhaeuser, K., Chawla, N.V.: Community detection in a large real-world social network. In: Liu, H., Salerno, J.J., Young, M.J. (eds.) Social Computing, Behavioral Modeling, and Prediction, pp. 168\u2013175. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77672-9_19"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Ting, K.M., Zhu, Y., Carman, M., Zhu, Y., Zhou, Z.H.: Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1205\u20131214. ACM (2016)","DOI":"10.1145\/2939672.2939779"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 505\u2013516. ACM (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"11_CR30","unstructured":"Yang, Z., Tang, J., Cohen, W.: Multi-modal Bayesian embeddings for learning social knowledge graphs. arXiv preprint arXiv:1508.00715 (2015)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 555\u2013564. ACM (2017)","DOI":"10.1145\/3097983.3098069"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endow. 2(1), 718\u2013729 (2009). https:\/\/doi.org\/10.14778\/1687627.1687709","journal-title":"Proc. VLDB Endow."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: an efficient incremental approach. In: 2010 IEEE International Conference on Data Mining, pp. 689\u2013698. IEEE (2010)","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XVIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44584-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T23:38:49Z","timestamp":1666395529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44584-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030445836","9783030445843"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44584-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Konstanz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}