{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:55:00Z","timestamp":1743094500848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214616"},{"type":"electronic","value":"9783030214623"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_18","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:04:14Z","timestamp":1560452654000},"page":"274-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Concept Lattices as a Search Space for Graph Compression"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bourneuf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Nicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"4385","DOI":"10.1038\/srep04385","volume":"4","author":"SE Ahnert","year":"2014","unstructured":"Ahnert, S.E.: Generalised power graph compression reveals dominant relationship patterns in complex networks. Sci. Rep. 4, 4385 (2014)","journal-title":"Sci. Rep."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-59271-8_6","volume-title":"Formal Concept Analysis","author":"L Bourneuf","year":"2017","unstructured":"Bourneuf, L., Nicolas, J.: FCA in a logical programming setting for visualization-oriented graph compression. In: Bertet, K., Borchmann, D., Cellier, P., Ferr\u00e9, S. (eds.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 89\u2013105. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_6"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-19545-2_18","volume-title":"Formal Concept Analysis","author":"G Chiaselotti","year":"2015","unstructured":"Chiaselotti, G., Ciucci, D., Gentile, T.: Simple undirected graphs as formal contexts. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS (LNAI), vol. 9113, pp. 287\u2013302. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19545-2_18"},{"issue":"12","key":"18_CR4","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/TVCG.2013.151","volume":"19","author":"T Dwyer","year":"2013","unstructured":"Dwyer, T., Riche, N.H., Marriott, K., Mears, C.: Edge compression techniques for visualization of dense directed graphs. IEEE Trans. Vis. Comput. Graph. 19(12), 2596\u20132605 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Mears, C., Morgan, K., Niven, T., Marriott, K., Wallace, M.: Improved optimal and approximate power graph compression for clearer visualisation of dense graphs. CoRR, abs\/1311.6996 (2013)","DOI":"10.1109\/PacificVis.2014.46"},{"issue":"8","key":"18_CR6","doi-asserted-by":"publisher","first-page":"R57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biol. 5(8), R57 (2004)","journal-title":"Genome Biol."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-01851-1_5","volume-title":"Foundations of Intelligent Systems","author":"J Bernard","year":"2018","unstructured":"Bernard, J., Seba, H.: Solving the maximal clique problem on compressed graphs. In: Ceci, M., Japkowicz, N., Liu, J., Papadopoulos, G.A., Ra\u015b, Z.W. (eds.) ISMIS 2018. LNCS (LNAI), vol. 11177, pp. 45\u201355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01851-1_5"},{"issue":"17","key":"18_CR9","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1093\/bioinformatics\/bth351","volume":"20","author":"AD King","year":"2004","unstructured":"King, A.D., Pr\u017eulj, N., Jurisica, I.: Protein complex prediction via cost-based clustering. Bioinformatics 20(17), 3013\u20133020 (2004)","journal-title":"Bioinformatics"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"S Navlakha","year":"2009","unstructured":"Navlakha, S., Schatz, M.C., Kingsford, C.: Revealing biological modules via graph summarization. J. Comput. Biol. 16(2), 253\u2013264 (2009)","journal-title":"J. Comput. Biol."},{"issue":"20","key":"18_CR11","doi-asserted-by":"publisher","first-page":"4021","DOI":"10.1093\/nar\/28.20.4021","volume":"28","author":"H Ogata","year":"2000","unstructured":"Ogata, H., Fujibuchi, W., Goto, S., Kanehisa, M.: A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Res. 28(20), 4021\u20134028 (2000)","journal-title":"Nucleic Acids Res."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11618058_31","volume-title":"Graph Drawing","author":"C Papadopoulos","year":"2006","unstructured":"Papadopoulos, C., Voglis, C.: Drawing graphs using modular decomposition. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 343\u2013354. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_31"},{"issue":"7","key":"18_CR13","doi-asserted-by":"publisher","first-page":"e1000108","DOI":"10.1371\/journal.pcbi.1000108","volume":"4","author":"L Royer","year":"2008","unstructured":"Royer, L., Reimann, M., Andreopoulos, B., Schroeder, M.: Unraveling protein networks with power graph analysis. PLoS Comput. Biol. 4(7), e1000108 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Serafino, P.: Speeding up graph clustering via modular decomposition based compression. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC 2013, pp. 156\u2013163. ACM, New York (2013)","DOI":"10.1145\/2480362.2480394"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Tsatsaronis, G., Reimann, M., Varlamis, I., Gkorgkas, O., N\u00f8rv\u00e5g, K.: Efficient community detection using power graph analysis. In: Proceedings of the 9th Workshop on Large-scale and Distributed Informational Retrieval, LSDS-IR 2011, pp. 21\u201326. ACM, New York (2011)","DOI":"10.1145\/2064730.2064738"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21462-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:57:22Z","timestamp":1710233842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","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":"36","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":"15","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":"42% - 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","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":"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)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}