{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:56:51Z","timestamp":1777733811410,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512191","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"page":"1444-1454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["FreSCo: Mining Frequent Patterns in Simplicial Complexes"],"prefix":"10.1145","author":[{"given":"Giulia","family":"Preti","sequence":"first","affiliation":[{"name":"ISI Foundation, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianmarco","family":"De Francisci Morales","sequence":"additional","affiliation":[{"name":"ISI Foundation, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"ISI Foundation, Italy and Eurecat, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Ehab Abdelhamid Ibrahim Abdelaziz Panos Kalnis Zuhair Khayyat and Fuad Jamour. 2016. ScaleMine: Scalable parallel frequent subgraph mining in a single large graph. In SC. 716\u2013727.","DOI":"10.1109\/SC.2016.60"},{"key":"e_1_3_2_1_2_1","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB. 487\u2013499."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2180861.2180866"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Md Alam Chowdhury\u00a0Farhan Ahmed Md Samiullah Carson\u00a0K Leung 2021. Discriminating frequent pattern based supervised graph embedding for classification. In PAKDD. 16\u201328.","DOI":"10.1007\/978-3-030-75765-6_2"},{"key":"e_1_3_2_1_5_1","unstructured":"Vikraman Arvind Bireswar Das Johannes K\u00f6bler and Seinosuke Toda. 2010. Colored hypergraph isomorphism is fixed parameter tractable. In FSTTCS. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_6_1","volume-title":"Gianmarco De\u00a0Francisci\u00a0Morales, and Aristides Gionis.","author":"Aslay Cigdem","year":"2018","unstructured":"Cigdem Aslay, Muhammad Anis\u00a0Uddin Nasir, Gianmarco De\u00a0Francisci\u00a0Morales, and Aristides Gionis. 2018. Mining Frequent Patterns in Evolving Graphs. In CIKM. 923\u2013932."},{"key":"e_1_3_2_1_7_1","volume-title":"Mathematical structure in human affairs","author":"Atkin Ron","unstructured":"Ron Atkin. 1974. Mathematical structure in human affairs. Heinemann Educational Publishers."},{"key":"e_1_3_2_1_8_1","volume-title":"Higher-order organization of complex networks. Science 353, 6295","author":"Benson Austin","year":"2016","unstructured":"Austin Benson, David\u00a0F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science 353, 6295 (2016), 163\u2013166."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_10_1","series-title":"SIAM News","volume-title":"Fueled by Classical Ideas and New Data","author":"Benson R.","year":"2021","unstructured":"Austin\u00a0R. Benson, David\u00a0F. Gleich, and Desmond\u00a0J. Higham. 2021. Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data. SIAM News (2021)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0331-0"},{"key":"e_1_3_2_1_12_1","unstructured":"Jacob Charles\u00a0Wright Billings Mirko Hu Giulia Lerda Alexey\u00a0N Medvedev Francesco Mottes Adrian Onicas Andrea Santoro and Giovanni Petri. 2019. Simplex2Vec embeddings for community detection in simplicial complexes. arXiv preprint arXiv:1906.09068(2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2010.91"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rn Bringmann and Siegfried Nijssen. 2008. What is frequent in a single graph?. In PAKDD. 858\u2013863.","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"e_1_3_2_1_15_1","volume-title":"A topological paradigm for hippocampal spatial map formation using persistent homology. PLoS Computational Biology 8, 8","author":"Dabaghian Yuri","year":"2012","unstructured":"Yuri Dabaghian, Facundo M\u00e9moli, Loren Frank, and Gunnar Carlsson. 2012. A topological paradigm for hippocampal spatial map formation using persistent homology. PLoS Computational Biology 8, 8 (2012)."},{"key":"e_1_3_2_1_16_1","volume-title":"Advances in Web Mining and Web Usage Analysis","author":"Desikan Prasanna","unstructured":"Prasanna Desikan and Jaideep Srivastava. 2006. Mining Temporally Changing Web Usage Graphs. In Advances in Web Mining and Web Usage Analysis, Bamshad Mobasher, Olfa Nasraoui, Bing Liu, and Brij Masand (Eds.). Springer Berlin Heidelberg, 1\u201317."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01224952"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_1_19_1","volume-title":"Higher-Order Label Homogeneity and Spreading in Graphs. In The Web Conference","author":"Eswaran Dhivya","year":"2020","unstructured":"Dhivya Eswaran, Srijan Kumar, and Christos Faloutsos. 2020. Higher-Order Label Homogeneity and Spreading in Graphs. In The Web Conference 2020. 2493\u20132499."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Fiedler and C. Borgelt. 2007. Subgraph support in a single large graph. In ICDMW. 399\u2013404.","DOI":"10.1109\/ICDMW.2007.74"},{"key":"e_1_3_2_1_21_1","volume-title":"Mitigation of infectious disease at school: targeted class closure vs school closure. BMC infectious diseases 14, 1","author":"Gemmetto Valerio","year":"2014","unstructured":"Valerio Gemmetto, Alain Barrat, and Ciro Cattuto. 2014. Mitigation of infectious disease at school: targeted class closure vs school closure. BMC infectious diseases 14, 1 (2014), 1\u201310."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge.","author":"Herrera-Semenets Vitali","year":"2015","unstructured":"Vitali Herrera-Semenets, Niusvel Acosta-Mendoza, and Andr\u00e9s Gago-Alonso. 2015. A Framework for intrusion detection based on frequent subgraph mining. In Proceedings of the 2nd SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEEI.2009.5254802"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2009\/03\/P03034"},{"key":"e_1_3_2_1_25_1","volume-title":"International Conference on Inductive Logic Programming. 244\u2013259","author":"Horv\u00e1th Tam\u00e1s","year":"2006","unstructured":"Tam\u00e1s Horv\u00e1th, Bj\u00f6rn Bringmann, and Luc De\u00a0Raedt. 2006. Frequent hypergraph mining. In International Conference on Inductive Logic Programming. 244\u2013259."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10431-6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Kasra Jamshidi Rakesh Mahadasa and Keval Vora. 2020. Peregrine: a pattern-aware graph mining system. In EuroSys. 1\u201316.","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_1_28_1","unstructured":"Ruoming Jin and G. Agrawal. 2005. An algorithm for in-core frequent itemset mining on streaming data. In ICDM. 8\u2013pp."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"T. Junttila and P. Kaski. 2007. Engineering an efficient canonical labeling tool for large and sparse graphs. In ALENEX. 135\u2013149.","DOI":"10.1137\/1.9781611972870.13"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2018.01.041"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3389\/fnsys.2016.00085"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301427"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11747"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"S. Moens E. Aksehirli and B. Goethals. 2013. Frequent Itemset Mining for Big Data. In BigData. 111\u2013118.","DOI":"10.1109\/BigData.2013.6691742"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442590"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"C.\u00a0C. Noble and D.\u00a0J. Cook. 2003. Graph-based Anomaly Detection. In SIGKDD. 631\u2013636.","DOI":"10.1145\/956750.956831"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gky1155"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-017-0114-8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2014.0873"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450073"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Giulia Preti Gianmarco De\u00a0Francisci\u00a0Morales and Matteo Riondato. 2021. MaNIACS: Approximate mining of frequent subgraph patterns through sampling. In KDD. 1348\u20131358.","DOI":"10.1145\/3447548.3467344"},{"key":"e_1_3_2_1_43_1","volume-title":"Beyond Frequencies: Graph Pattern Mining in Multi-weighted Graphs.. In EDBT, Vol.\u00a018. 169\u2013180.","author":"Preti Giulia","year":"2018","unstructured":"Giulia Preti, Matteo Lissandrini, Davide Mottin, and Yannis Velegrakis. 2018. Beyond Frequencies: Graph Pattern Mining in Multi-weighted Graphs.. In EDBT, Vol.\u00a018. 169\u2013180."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00682-3"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6404\/aae790"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Daniel\u00a0Hern\u00e1ndez Serrano and Dar\u00edo\u00a0S\u00e1nchez G\u00f3mez. 2019. Centrality measures in simplicial complexes: applications of TDA to Network Science. arXiv preprint arXiv:1908.02967(2019).","DOI":"10.1016\/j.amc.2020.125331"},{"key":"e_1_3_2_1_47_1","unstructured":"David\u00a0I Spivak. 2009. Higher-dimensional models of networks. arXiv preprint arXiv:0909.4314(2009)."},{"key":"e_1_3_2_1_48_1","unstructured":"Leo Torres Ann\u00a0S Blevins Danielle\u00a0S Bassett and Tina Eliassi-Rad. 2020. The why how and when of representations for complex systems. arXiv preprint arXiv:2006.02870(2020)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0655-y"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Kelin Xia and Guo-Wei Wei. 2014. Persistent homology analysis of protein structure flexibility and folding. International journal for numerical methods in biomedical engineering 30 8(2014) 814\u2013844.","DOI":"10.1002\/cnm.2655"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.032312"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:14Z","timestamp":1750188674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":51,"alternative-id":["10.1145\/3485447.3512191","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512191","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}