{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:59:06Z","timestamp":1752361146899},"publisher-location":"Cham","reference-count":31,"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_21","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:04:42Z","timestamp":1587510282000},"page":"261-273","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Overlapping Hierarchical Clustering (OHC)"],"prefix":"10.1007","author":[{"given":"Ian","family":"Jeantet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Mikl\u00f3s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gross-Amblard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"key":"21_CR1","unstructured":"Achtert, E.: Hierarchical subspace clustering. Ph.D. thesis, LMU (2007)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10618-005-1396-1","volume":"11","author":"R Agrawal","year":"2005","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data. Data Min. Knowl. Disc. 11(1), 5\u201333 (2005)","journal-title":"Data Min. Knowl. Disc."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: ACM SIGMOD Record, vol. 28, pp. 49\u201360. ACM (1999)","DOI":"10.1145\/304181.304187"},{"issue":"1","key":"21_CR4","first-page":"3831","volume":"15","author":"MF Balcan","year":"2014","unstructured":"Balcan, M.F., Liang, Y., Gupta, P.: Robust hierarchical clustering. J. Mach. Learn. Res. 15(1), 3831\u20133871 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02458841","volume":"51","author":"HJ Bandelt","year":"1989","unstructured":"Bandelt, H.J., Dress, A.W.: Weak hierarchies associated with similarity measures-an additive clustering technique. Bull. Math. Biol. 51(1), 133\u2013166 (1989). https:\/\/doi.org\/10.1007\/BF02458841","journal-title":"Bull. Math. Biol."},{"key":"21_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern Recognition with Fuzzy Objective Function Algorithms","author":"James C Bezdek","year":"1981","unstructured":"Bezdek, James C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Springer, Boston (1981)"},{"issue":"4","key":"21_CR7","first-page":"467","volume":"18","author":"PF Brown","year":"1992","unstructured":"Brown, P.F., Desouza, P.V., Mercer, R.L., Pietra, V.J.D., Lai, J.C.: Class-based n-gram models of natural language. Comput. Linguist. 18(4), 467\u2013479 (1992)","journal-title":"Comput. Linguist."},{"issue":"1","key":"21_CR8","first-page":"5","volume":"10","author":"RJ Campello","year":"2015","unstructured":"Campello, R.J., Moulavi, D., Zimek, A., Sander, J.: Hierarchical density estimates for data clustering, visualization, and outlier detection. ACM Trans. Knowl. Discov. Data (TKDD) 10(1), 5 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"e54847","DOI":"10.1371\/journal.pone.0054847","volume":"8","author":"D Chavalarias","year":"2013","unstructured":"Chavalarias, D., Cointet, J.P.: Phylomemetic patterns in science evolution - the rise and fall of scientific fields. PloS One 8(2), e54847 (2013)","journal-title":"PloS One"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H., Guo, G., Huang, Y., Huang, T.: A spatial overlapping based similarity measure applied to hierarchical clustering. In: Fuzzy Systems and Knowledge Discovery (FSKD 2008), vol. 2, pp. 371\u2013375. IEEE (2008)","DOI":"10.1109\/FSKD.2008.379"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Kanade, V., Mallmann-Trenn, F., Mathieu, C.: Hierarchical clustering: objective functions and algorithms. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 378\u2013397. SIAM (2018)","DOI":"10.1137\/1.9781611975031.26"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2629511","volume":"9","author":"M Coscia","year":"2014","unstructured":"Coscia, M., Rossetti, G., Giannotti, F., Pedreschi, D.: Uncovering hierarchical and overlapping communities with a local-first approach. ACM Trans. Knowl. Discov. Data 9(1), 6:1\u20136:27 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Derczynski, L., Chester, S.: Generalised brown clustering and roll-up feature generation. In: AAAI, pp. 1533\u20131539 (2016)","DOI":"10.1609\/aaai.v30i1.10190"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"171545","DOI":"10.1098\/rsos.171545","volume":"5","author":"L Dias","year":"2018","unstructured":"Dias, L., Gerlach, M., Scharloth, J., Altmann, E.G.: Using text analysis to quantify the similarity and evolution of scientific disciplines. R. Soc. Open Sci. 5(1), 171545 (2018)","journal-title":"R. Soc. Open Sci."},{"key":"21_CR15","unstructured":"Diday, E.: Une repr\u00e9sentation visuelle des classes empi\u00e9tantes: les pyramides (1984)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 101 (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"21_CR17","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226\u2013231 (1996)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Florek, K., \u0141ukaszewicz, J., Perkal, J., Steinhaus, H., Zubrzycki, S.: Sur la liaison et la division des points d\u2019un ensemble fini. In: Colloquium Mathematicae, vol. 2, p. 282 (1951)","DOI":"10.4064\/cm-2-3-4-282-285"},{"issue":"383","key":"21_CR19","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes, E.B., Mallows, C.L.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78(383), 553\u2013569 (1983)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1162\/tacl_a_00134","volume":"3","author":"O Levy","year":"2015","unstructured":"Levy, O., Goldberg, Y., Dagan, I.: Improving distributional similarity with lessons learned from word embeddings. Trans. Assoc. Comput. Linguist. 3, 211\u2013225 (2015)","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J.: Accelerated hierarchical density based clustering. In: 2017 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 33\u201342. IEEE (2017)","DOI":"10.1109\/ICDMW.2017.12"},{"key":"21_CR22","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)"},{"key":"21_CR23","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111\u20133119 (2013)"},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"7043","key":"21_CR25","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814 (2005)","journal-title":"Nature"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Qu, J., Jiang, Q., Weng, F., Hong, Z.: A hierarchical clustering based on overlap similarity measure. In: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing (SNPD 2007), vol. 3, pp. 905\u2013910. IEEE (2007)","DOI":"10.1109\/SNPD.2007.502"},{"issue":"8","key":"21_CR27","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Phys. A: Stat. Mech. Appl. 388(8), 1706\u20131712 (2009)","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: SLINK: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"issue":"301","key":"21_CR29","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward Jr., J.H.: Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc. 58(301), 236\u2013244 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587\u2013596. ACM (2013)","DOI":"10.1145\/2433396.2433471"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.physa.2017.05.032","volume":"486","author":"X Zhou","year":"2017","unstructured":"Zhou, X., Liu, Y., Wang, J., Li, C.: A density based link clustering algorithm for overlapping community detection in networks. Phys. A: Stat. Mech. Appl. 486, 65\u201378 (2017)","journal-title":"Phys. A: Stat. Mech. Appl."}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T23:38:53Z","timestamp":1666395533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44584-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030445836","9783030445843"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44584-3_21","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)"}}]}}