{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:52:46Z","timestamp":1743115966503,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030896560"},{"type":"electronic","value":"9783030896577"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89657-7_28","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:02:48Z","timestamp":1634850168000},"page":"372-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Peschel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Batko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Valcik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Sedmidubsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adamcsek, B., Palla, G., Farkas, I.J., Der\u00e9nyi, I., Vicsek, T.: CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021\u20131023 (2006)","key":"28_CR1","DOI":"10.1093\/bioinformatics\/btl039"},{"unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499 (1994)","key":"28_CR2"},{"doi-asserted-by":"crossref","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761\u2013764 (2010)","key":"28_CR3","DOI":"10.1038\/nature09182"},{"doi-asserted-by":"publisher","unstructured":"Batko, M., Novak, D., Zezula, P.: MESSIF: metric similarity search implementation framework. In: Thanos, C., Borri, F., Candela, L. (eds.) Digital Libraries: Research and Development. DELOS 2007. LNCS, vol. 4877, pp. 1\u201310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77088-6_1","key":"28_CR4","DOI":"10.1007\/978-3-540-77088-6_1"},{"doi-asserted-by":"crossref","unstructured":"Bhat, S.Y., Abulais, M.: OCMiner: a density-based overlapping community detection method for social networks. Intell. Data Anal. 19(4), 917\u2013947 (2015)","key":"28_CR5","DOI":"10.3233\/IDA-150751"},{"doi-asserted-by":"crossref","unstructured":"Chen, D., Shang, M., Lv, Z., Fu, Y.: Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Stat. Mech. Appl. 389(19), 4177\u20134187 (2010)","key":"28_CR6","DOI":"10.1016\/j.physa.2010.05.046"},{"doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","key":"28_CR7","DOI":"10.1016\/j.physrep.2009.11.002"},{"doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","key":"28_CR8","DOI":"10.1073\/pnas.122653799"},{"doi-asserted-by":"crossref","unstructured":"Kumpula, J.M., Kivel\u00e4, M., Kaski, K., Saram\u00e4ki, J.: Sequential algorithm for fast clique percolation. Phys. Rev. E 78(2), 026109 (2008)","key":"28_CR9","DOI":"10.1103\/PhysRevE.78.026109"},{"doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)","key":"28_CR10","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"doi-asserted-by":"crossref","unstructured":"Newman, M.E.: Communities, modules and large-scale structure in networks. Nat. Phys. 8(1), 25\u201331 (2012)","key":"28_CR11","DOI":"10.1038\/nphys2162"},{"doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","key":"28_CR12","DOI":"10.1103\/PhysRevE.69.026113"},{"doi-asserted-by":"crossref","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\u2013818 (2005)","key":"28_CR13","DOI":"10.1038\/nature03607"},{"doi-asserted-by":"crossref","unstructured":"Peschel, J., Batko, M., Zezula, P.: Techniques for complex analysis of contemporary data. In: Proceedings of the 2020 International Conference on Pattern Recognition and Intelligent Systems, pp. 1\u20135 (2020)","key":"28_CR14","DOI":"10.1145\/3415048.3416097"},{"doi-asserted-by":"crossref","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. 101(9), 2658\u20132663 (2004)","key":"28_CR15","DOI":"10.1073\/pnas.0400054101"},{"doi-asserted-by":"crossref","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","key":"28_CR16","DOI":"10.1016\/j.cosrev.2007.05.001"},{"doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach, vol. 32. Springer, Heidelberg (2006)","key":"28_CR17","DOI":"10.1007\/0-387-29151-2"},{"doi-asserted-by":"crossref","unstructured":"Zhou, X., Liu, Y., Wang, J., Li, C.: A density based link clustering algorithm for overlapping community detection in networks. Physica A: Stat. Mech. Appl. 486, 65\u201378 (2017)","key":"28_CR18","DOI":"10.1016\/j.physa.2017.05.032"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89657-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:15:08Z","timestamp":1634850908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89657-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030896560","9783030896577"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89657-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sisap.org\/2021\/","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":"50","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":"23","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":"5","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":"46% - 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,8","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":"3,2","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)"}}]}}