{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:41:51Z","timestamp":1791484911632,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"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":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403124","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:03:57Z","timestamp":1597964637000},"page":"813-823","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Discovering Succinct Pattern Sets Expressing Co-Occurrence and Mutual Exclusivity"],"prefix":"10.1145","author":[{"given":"Jonas","family":"Fischer","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics and Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"R. Agrawal T. Imielinksi and A. Swami. 1993. Mining association rules between sets of items in large databases. In SIGMOD. ACM 207--216.  R. Agrawal T. Imielinksi and A. Swami. 1993. Mining association rules between sets of items in large databases. In SIGMOD. ACM 207--216.","DOI":"10.1145\/170036.170072"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M.-L. Antonie and O. R. Za\u00efane. 2004. Mining Positive and Negative Association Rules: An Approach for Confined Rules. In PKDD. Springer 27--38.  M.-L. Antonie and O. R. Za\u00efane. 2004. Mining Positive and Negative Association Rules: An Approach for Confined Rules. In PKDD. Springer 27--38.","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"e_1_3_2_1_3_1","volume-title":"Integrative analysis of single-cell expression data reveals distinct regulatory states in bidirectional promoters. Epigen. & chrom. 11, 1","author":"Ardakani F. B.","year":"2018","unstructured":"F. B. Ardakani , K. Kattler , K. Nordstr\u00f6m , N. Gasparoni , G. Gasparoni , S. Fuchs , A. Sinha , M. Barann , P. Ebert , J. Fischer , B. Hutter , G. Zipprich , C. D. Imbusch , B. Felder , J. Eils , B. Brors , T. Lengauer , T. Manke , P. Rosenstiel , J. Walter , and M. H. Schulz . 2018. Integrative analysis of single-cell expression data reveals distinct regulatory states in bidirectional promoters. Epigen. & chrom. 11, 1 ( 2018 ), 66. F. B. Ardakani, K. Kattler, K. Nordstr\u00f6m, N. Gasparoni, G. Gasparoni, S. Fuchs, A.Sinha, M. Barann, P. Ebert, J. Fischer, B. Hutter, G. Zipprich, C. D. Imbusch, B.Felder, J. Eils, B. Brors, T. Lengauer, T. Manke, P. Rosenstiel, J. Walter, and M. H.Schulz. 2018. Integrative analysis of single-cell expression data reveals distinct regulatory states in bidirectional promoters. Epigen. & chrom. 11, 1 (2018), 66."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"T. Calders and B. Goethals. 2002. Mining all Non-Derivable Frequent Itemsets. In PKDD. 74--85.  T. Calders and B. Goethals. 2002. Mining all Non-Derivable Frequent Itemsets. In PKDD. 74--85.","DOI":"10.1007\/3-540-45681-3_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9258(19)74247-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"S. Dalleiger and J. Vreeken. 2020. Explainable Data Decompositions. AAAI.  S. Dalleiger and J. Vreeken. 2020. Explainable Data Decompositions. AAAI.","DOI":"10.1609\/aaai.v34i04.5780"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0209-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"J. Fischer and J. Vreeken. 2019. Sets of Robust Rules and How to Find Them. Springer.  J. Fischer and J. Vreeken. 2019. Sets of Robust Rules and How to Find Them. Springer.","DOI":"10.1007\/978-3-030-46150-8_3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. Fowkes and C. Sutton. 2016. A Subsequence Interleaving Model for Sequential Pattern Mining. InKDD.  J. Fowkes and C. Sutton. 2016. A Subsequence Interleaving Model for Sequential Pattern Mining. InKDD.","DOI":"10.1145\/2939672.2939787"},{"key":"e_1_3_2_1_10_1","volume-title":"The Minimum Description Length Principle","author":"Gr\u00fcnwald P.","unstructured":"P. Gr\u00fcnwald . 2007. The Minimum Description Length Principle . MIT Press . P. Gr\u00fcnwald. 2007. The Minimum Description Length Principle. MIT Press."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0432-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J. Han J. Pei and Y. Yin. 2000. Mining frequent patterns without candidate generation. In SIGMOD. ACM 1--12.  J. Han J. Pei and Y. Yin. 2000. Mining frequent patterns without candidate generation. In SIGMOD. ACM 1--12.","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"H. Heikinheimo J. K. Sepp\u00e4nen E. Hinkkanen H. Mannila and T. Mielik\u00e4inen. 2007. Finding low-entropy sets and trees from binary data. In KDD. 350--359.  H. Heikinheimo J. K. Sepp\u00e4nen E. Hinkkanen H. Mannila and T. Mielik\u00e4inen. 2007. Finding low-entropy sets and trees from binary data. In KDD. 350--359.","DOI":"10.1145\/1281192.1281232"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1128\/MCB.19.11.7697"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bbrc.2006.10.124"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.04.003"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/abio.2001.5431"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. 1993.An Introduction to Kolmogorov Complexity and its Applications. Springer.  M. Li and P. Vit\u00e1nyi. 1993.An Introduction to Kolmogorov Complexity and its Applications. Springer.","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382580"},{"key":"e_1_3_2_1_20_1","unstructured":"T. Mitchell-Jones. 1999. Societas Europaea Mammalogica. http:\/\/www.european-mammals.org. (1999). http:\/\/www.european-mammals.org  T. Mitchell-Jones. 1999. Societas Europaea Mammalogica. http:\/\/www.european-mammals.org. (1999). http:\/\/www.european-mammals.org"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0329-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/sj.onc.1209717"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"R. Naffouje P. Grover H. Yu A. Sendilnathan K. Wolfe N. Majd E. P. Smith K. Takeuchi T. Senda S. Kofuji and A. T. Sasaki. 2019. Anti-Tumor Potential of IMP Dehydrogenase Inhibitors: A Century-Long Story.Cancers (Basel)11 9(2019).  R. Naffouje P. Grover H. Yu A. Sendilnathan K. Wolfe N. Majd E. P. Smith K. Takeuchi T. Senda S. Kofuji and A. T. Sasaki. 2019. Anti-Tumor Potential of IMP Dehydrogenase Inhibitors: A Century-Long Story.Cancers (Basel)11 9(2019).","DOI":"10.3390\/cancers11091346"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"A. A. Nanavati K. P. Chitrapura S. Joshi and R. Krishnapuram. 2001. Mining Generalised Disjunctive Association Rules. In CIKM. ACM 482--489.  A. A. Nanavati K. P. Chitrapura S. Joshi and R. Krishnapuram. 2001. Mining Generalised Disjunctive Association Rules. In CIKM. ACM 482--489.","DOI":"10.1145\/502585.502666"},{"key":"e_1_3_2_1_25_1","unstructured":"L. Papaxanthos F. Llinares-L\u00f3pez D. A. Bodenham and K. M. Borgwardt. 2016. Finding significant combinations of features in the presence of categorical co-variates. In NIPS. 2271--2279.  L. Papaxanthos F. Llinares-L\u00f3pez D. A. Bodenham and K. M. Borgwardt. 2016. Finding significant combinations of features in the presence of categorical co-variates. In NIPS. 2271--2279."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"N. Pasquier Y. Bastide R. Taouil and L. Lakhal. 1999. Discovering Frequent Closed Item sets for Association Rules. In ICDT. ACM 398--416.  N. Pasquier Y. Bastide R. Taouil and L. Lakhal. 1999. Discovering Frequent Closed Item sets for Association Rules. In ICDT. ACM 398--416.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"L. Pellegrina M. Riondato and F. Vandin. 2019. SPuManTE: Significant Pattern Mining with Unconditional Testing. In KDD. ACM 1528--1538.  L. Pellegrina M. Riondato and F. Vandin. 2019. SPuManTE: Significant Pattern Mining with Unconditional Testing. In KDD. ACM 1528--1538.","DOI":"10.1145\/3292500.3330978"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"L. Pellegrina and F. Vandin. 2018. Efficient Mining of the Most Significant Patterns with Permutation Testing. In KDD. 2070--2079.  L. Pellegrina and F. Vandin. 2018. Efficient Mining of the Most Significant Patterns with Permutation Testing. In KDD. 2070--2079.","DOI":"10.1145\/3219819.3219997"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346150"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"D. C. Schultz K. Ayyanathan D. Negorev G. G. Maul and F. J. Rauscher. 2002.SETDB1: a novel KAP-1-associated histone H3 lysine 9-specific methyl transferase that contributes to HP1-mediated silencing of euchromatic genes by KRAB zinc-finger proteins.Genes Dev.16 8 (2002) 919--932.  D. C. Schultz K. Ayyanathan D. Negorev G. G. Maul and F. J. Rauscher. 2002.SETDB1: a novel KAP-1-associated histone H3 lysine 9-specific methyl transferase that contributes to HP1-mediated silencing of euchromatic genes by KRAB zinc-finger proteins.Genes Dev.16 8 (2002) 919--932.","DOI":"10.1101\/gad.973302"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ajpath.2016.12.011"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Y. Shima S. Mitsuishi K. Hirata and M. Harao. 2004. Extracting Minimal and Closed Monotone DNF Formulas. In DS. Springer 298--305.  Y. Shima S. Mitsuishi K. Hirata and M. Harao. 2004. Extracting Minimal and Closed Monotone DNF Formulas. In DS. Springer 298--305.","DOI":"10.1007\/978-3-540-30214-8_24"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0202-x"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644873.1644876"},{"issue":"092010","key":"e_1_3_2_1_36_1","first-page":"68","article-title":"Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling","volume":"1","author":"Zaki M.","year":"2010","unstructured":"M. Zaki , N. Ramakrishnan , and L. Zhao . 2010 . Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling . IJKDB 1 ( 092010 ), 68 -- 96 . M. Zaki, N. Ramakrishnan, and L. Zhao. 2010. Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling. IJKDB 1 (092010), 68--96.","journal-title":"IJKDB"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"M. J. Zaki S. Parthasarathy M. Ogihara and W. Li. 1997. New algorithms for fast discovery of association rules. In KDD.  M. J. Zaki S. Parthasarathy M. Ogihara and W. Li. 1997. New algorithms for fast discovery of association rules. In KDD.","DOI":"10.1007\/978-1-4615-5669-5_1"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:34Z","timestamp":1750195894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":37,"alternative-id":["10.1145\/3394486.3403124","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403124","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}