{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:53:36Z","timestamp":1777614816367,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":55,"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.3512196","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"page":"1495-1505","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling"],"prefix":"10.1145","author":[{"given":"Muyi","family":"Liu","sequence":"first","affiliation":[{"name":"Purdue University, USA and Health Science Center, University of North Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"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":"publisher","DOI":"10.1137\/1.9781611972795.56"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-340"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/27.1.314"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn186"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41190-8_44"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_17"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00129"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-S6-S6"},{"key":"e_1_3_2_1_10_1","volume-title":"Handbook of model checking. Vol.\u00a010","author":"Clarke M","unstructured":"Edmund\u00a0M Clarke, Thomas\u00a0A Henzinger, Helmut Veith, and Roderick Bloem. 2018. Handbook of model checking. Vol.\u00a010. Springer, Cham, Switzerland."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_12_1","volume-title":"ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Vol.\u00a098","author":"Dehaspe Luc","year":"1998","unstructured":"Luc Dehaspe, Hannu Toivonen, and Ross\u00a0D King. 1998. Finding frequent substructures in chemical compounds.. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Vol.\u00a098. ACM."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_14_1","volume-title":"Frequent Subgraph Mining of Functional Interaction Patterns Across Multiple Cancers. In Pacific Symposium on Biocomputing","author":"Durmaz Arda","year":"2020","unstructured":"Arda Durmaz, Tim\u00a0AD Henderson, and Gurkan Bebek. 2020. Frequent Subgraph Mining of Functional Interaction Patterns Across Multiple Cancers. In Pacific Symposium on Biocomputing. World Scientific, Hawaii, USA, 261\u2013272."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_16_1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey R","year":"1979","unstructured":"Michael\u00a0R Garey and David\u00a0S Johnson. 1979. Computers and intractability: a guide to the theory of NP-completeness. 1979. Freeman, San Francisco, CA, USA."},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"PMSat: a parallel version of MiniSAT","volume":"6","author":"Gil Luis","year":"2010","unstructured":"Luis Gil, Paulo Flores, and Luis\u00a0Miguel Silveira. 2010. PMSat: a parallel version of MiniSAT. Satisfiability Boolean Modeling and Computation 6, 1-3(2010), 71\u201398.","journal-title":"Satisfiability Boolean Modeling and Computation"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4161\/rna.18386"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM","unstructured":"Jiawei. Han and Xifeng Yan. 2003. CloseGraph: Mining closed frequent graph patterns. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, Washington, DC, USA, 286\u2013295."},{"key":"e_1_3_2_1_20_1","volume-title":"KDD Workshop. AAAI","author":"Holder B.","year":"1994","unstructured":"Lawrence\u00a0B. Holder, Diane\u00a0J. Cook, and Surnjani Djoko. 1994. Substucture discovery in the SUBDUE system. In KDD Workshop. AAAI, Seattle, Washington, USA, 169\u2013180."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45372-5_2"},{"key":"e_1_3_2_1_24_1","unstructured":"Sergei Ivanov Sergei Sviridov and Evgeny Burnaev. 2019. Understanding isomorphism bias in graph datasets. arxiv:1910.12091\u00a0[cs.LG]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2018.00072"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840683"},{"key":"e_1_3_2_1_27_1","volume-title":"Frequent subgraph mining for biologically meaningful structural motifs. bioRxiv","author":"Keller Sebastian","year":"2020","unstructured":"Sebastian Keller, Pauli Miettinen, and Olga\u00a0V. Kalinina. 2020. Frequent subgraph mining for biologically meaningful structural motifs. bioRxiv (2020). https:\/\/www.biorxiv.org\/content\/early\/2020\/05\/14\/2020.05.14.095695.full.pdf"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629550"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502533"},{"key":"e_1_3_2_1_30_1","first-page":"1038","article-title":"An efficient algorithm for discovering frequent subgraphs. Knowledge and Data Engineering","volume":"16","author":"Kuramochi Michihiro","year":"2004","unstructured":"Michihiro Kuramochi and George Karypis. 2004. An efficient algorithm for discovering frequent subgraphs. Knowledge and Data Engineering, IEEE Transactions on 16, 9(2004), 1038\u20131051.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_3_2_1_32_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363832"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/99"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_13"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13040-018-0181-9"},{"key":"e_1_3_2_1_38_1","volume-title":"International Joint Conference on Artificial Intelligence, Vol.\u00a017","author":"Nijssen Siegfried","year":"2001","unstructured":"Siegfried Nijssen and Joost Kok. 2001. Faster association rules for multiple relations. In International Joint Conference on Artificial Intelligence, Vol.\u00a017. IJCAI, 891\u2013896."},{"key":"e_1_3_2_1_39_1","volume-title":"International conference on theory and applications of satisfiability testing. Springer, Santa Margherita Ligure, Italy, 502\u2013518","author":"Niklas E\u00e9n","year":"2003","unstructured":"E\u00e9n Niklas and SNiklas, \u00f6rensson. 2003. An extensible SAT-solver. In International conference on theory and applications of satisfiability testing. Springer, Santa Margherita Ligure, Italy, 502\u2013518."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1128\/jb.177.8.1919-1928.1995"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258022"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.198"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00682-3"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004359"},{"key":"e_1_3_2_1_45_1","unstructured":"Mate Soos and Armin Biere. 2019. CryptoMiniSat 5.6 with YalSAT. In SAT Race. Helsinki 14\u201315."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"e_1_3_2_1_47_1","first-page":"1","article-title":"Minisat v1. 13-a sat solver with conflict-clause minimization","volume":"2005","author":"Sorensson Niklas","year":"2005","unstructured":"Niklas Sorensson and Niklas Een. 2005. Minisat v1. 13-a sat solver with conflict-clause minimization. SAT Race 2005, 53 (2005), 1\u20132.","journal-title":"SAT Race"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.102"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839491"},{"key":"e_1_3_2_1_50_1","volume-title":"\u201csmall-world","author":"Watts J","year":"1998","unstructured":"Duncan\u00a0J Watts and Steven\u00a0H Strogatz. 1998. Collective dynamics of \u201csmall-world\u201d networks. Nature 393, 6684 (1998), 440\u2013442."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_52_1","volume-title":"IEEE International Conference on Data Mining. IEEE","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han. 2002. gSpan: Graph-based substructure pattern mining. In IEEE International Conference on Data Mining. IEEE, Maebashi City, Japan, 721\u2013724."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081908"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2071-z"},{"key":"e_1_3_2_1_55_1","volume-title":"International Conference on Computer Aided Design. IEEE, 279\u2013285","author":"Zhang Lintao","year":"2001","unstructured":"Lintao Zhang, Conor\u00a0F Madigan, Matthew\u00a0H Moskewicz, and Sharad Malik. 2001. Efficient conflict driven learning in a boolean satisfiability solver. In International Conference on Computer Aided Design. IEEE, 279\u2013285."}],"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.3512196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":55,"alternative-id":["10.1145\/3485447.3512196","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512196","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"}}]}}