{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T04:25:43Z","timestamp":1765772743786,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Post II"],"award-info":[{"award-number":["Post II"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Navigability of Decentralized Information Networks"],"award-info":[{"award-number":["Navigability of Decentralized Information Networks"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939752","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"965-974","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Mining Subgroups with Exceptional Transition Behavior"],"prefix":"10.1145","author":[{"given":"Florian","family":"Lemmerich","sequence":"first","affiliation":[{"name":"GESIS - Leibniz Institute for the Social Sciences & University of Koblenz-Landau, Cologne, Germany"}]},{"given":"Martin","family":"Becker","sequence":"additional","affiliation":[{"name":"University of W\u00fcrzburg, W\u00fcrzburg, Germany"}]},{"given":"Philipp","family":"Singer","sequence":"additional","affiliation":[{"name":"GESIS - Leibniz Institute for the Social Sciences & University of Koblenz-Landau, Cologne, Germany"}]},{"given":"Denis","family":"Helic","sequence":"additional","affiliation":[{"name":"TU Graz, Graz, Austria"}]},{"given":"Andreas","family":"Hotho","sequence":"additional","affiliation":[{"name":"University of W\u00fcrzburg, W\u00fcrzburg, Germany"}]},{"given":"Markus","family":"Strohmaier","sequence":"additional","affiliation":[{"name":"GESIS - Leibniz Institute for the Social Sciences & University of Koblenz-Landau, Cologne, Germany"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Evaluation Measures for Multi-class Subgroup Discovery. In European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Abudawood T.","year":"2009","unstructured":"T. Abudawood and P. Flach . Evaluation Measures for Multi-class Subgroup Discovery. In European Conference on Machine Learning and Knowledge Discovery in Databases , 2009 . T. Abudawood and P. Flach. Evaluation Measures for Multi-class Subgroup Discovery. In European Conference on Machine Learning and Knowledge Discovery in Databases, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1144"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33486-3_60"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJWS.2013.056577"},{"issue":"5439","key":"e_1_3_2_1_6_1","first-page":"509","volume":"286","author":"Barab\u00e1si A.-L.","year":"1999","unstructured":"A.-L. Barab\u00e1si and R. Albert . Emergence of Scaling in Random Networks. Science , 286 ( 5439 ): 509 -- 512 , 1999 . A.-L. Barab\u00e1si and R. Albert. Emergence of Scaling in Random Networks. Science, 286(5439):509--512, 1999.","journal-title":"Emergence of Scaling in Random Networks. Science"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276313"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27433-1_16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2700171.2791021"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810626"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.81"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339668"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0403-4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.65"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.53"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1961.10482090"},{"key":"e_1_3_2_1_17_1","first-page":"1","volume-title":"The Annals of Statistics","author":"Efron B.","year":"1979","unstructured":"B. Efron . Bootstrap Methods : Another Look at the Jackknife . The Annals of Statistics , pages 1 -- 26 , 1979 . B. Efron. Bootstrap Methods: Another Look at the Jackknife. The Annals of Statistics, pages 1--26, 1979."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1201\/9780429246593"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/qj.49708837511"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868470.1868479"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297332.1297338"},{"issue":"3","key":"e_1_3_2_1_22_1","article-title":"Discrete-time Markov Chain Approach to Contact-based Disease Spreading","volume":"89","author":"Gomez S.","year":"2010","unstructured":"S. Gomez , A. Arenas , J. Borge-Holthoefer , S. Meloni , and Y. Moreno . Discrete-time Markov Chain Approach to Contact-based Disease Spreading in Complex Networks. Europhysics Letters , 89 ( 3 ), 2010 . S. Gomez, A. Arenas, J. Borge-Holthoefer, S. Meloni, and Y. Moreno. Discrete-time Markov Chain Approach to Contact-based Disease Spreading in Complex Networks. Europhysics Letters, 89(3), 2010.","journal-title":"Complex Networks. Europhysics Letters"},{"issue":"2","key":"e_1_3_2_1_23_1","first-page":"65","article-title":"A Simple Sequentially Rejective Multiple Test Procedure","volume":"6","author":"Holm S.","year":"1979","unstructured":"S. Holm . A Simple Sequentially Rejective Multiple Test Procedure . Scandinavian Journal of Statistics , 6 ( 2 ): 65 -- 70 , 1979 . S. Holm. A Simple Sequentially Rejective Multiple Test Procedure. Scandinavian Journal of Statistics, 6(2):65--70, 1979.","journal-title":"Scandinavian Journal of Statistics"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8489.1962.tb00301.x"},{"key":"e_1_3_2_1_25_1","first-page":"249","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Kl\u00f6sgen W.","year":"1996","unstructured":"W. Kl\u00f6sgen . Explora : A Multipattern and Multistrategy Discovery Assistant . In Advances in Knowledge Discovery and Data Mining , pages 249 -- 271 . American Association for Artificial Intelligence , 1996 . W. Kl\u00f6sgen. Explora: A Multipattern and Multistrategy Discovery Assistant. In Advances in Knowledge Discovery and Data Mining, pages 249--271. American Association for Artificial Intelligence, 1996."},{"key":"e_1_3_2_1_26_1","volume-title":"Int'l Conference on Machine Learning","author":"Lafferty J. D.","year":"2001","unstructured":"J. D. Lafferty , A. McCallum , and F. C. N. Pereira . Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data . In Int'l Conference on Machine Learning , 2001 . J. D. Lafferty, A. McCallum, and F. C. N. Pereira. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Int'l Conference on Machine Learning, 2001."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005338"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0187-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0273-y"},{"key":"e_1_3_2_1_30_1","first-page":"167","volume-title":"Multilingual Knowledge Base Extracted From Wikipedia. Semantic Web","author":"Lehmann J.","year":"2014","unstructured":"J. Lehmann , R. Isele , M. Jakob , A. Jentzsch , D. Kontokostas , P. N. Mendes , S. Hellmann , M. Morsey , P. van Kleef , S. Auer , mboxDBpedia -- A Large-scale , Multilingual Knowledge Base Extracted From Wikipedia. Semantic Web , pages 167 -- 195 , 2014 . J. Lehmann, R. Isele, M. Jakob, A. Jentzsch, D. Kontokostas, P. N. Mendes, S. Hellmann, M. Morsey, P. van Kleef, S. Auer, et al.mboxDBpedia -- A Large-scale, Multilingual Knowledge Base Extracted From Wikipedia. Semantic Web, pages 167--195, 2014."},{"key":"e_1_3_2_1_31_1","volume-title":"Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Leman D.","year":"2008","unstructured":"D. Leman , A. Feelders , and A. J. Knobbe . Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases , 2008 . D. Leman, A. Feelders, and A. J. Knobbe. Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases, 2008."},{"key":"e_1_3_2_1_32_1","volume-title":"Generic Pattern Trees for Exhaustive Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Lemmerich F.","year":"2012","unstructured":"F. Lemmerich , M. Becker , and M. Atzmueller . Generic Pattern Trees for Exhaustive Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases , 2012 . F. Lemmerich, M. Becker, and M. Atzmueller. Generic Pattern Trees for Exhaustive Exceptional Model Mining. In European Conference on Machine Learning and Knowledge Discovery in Databases, 2012."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312275"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.04.030"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-013-0284-1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431218"},{"key":"e_1_3_2_1_37_1","volume-title":"The PageRank Citation Ranking: Bringing order to the web","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank Citation Ranking: Bringing order to the web . 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing order to the web. 1999."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019288403823"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8116(90)90028-L"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367617"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.2307\/2333709"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.553165"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741080"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0102070"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_32"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622620.1622635"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5046-x"},{"key":"e_1_3_2_1_48_1","volume-title":"An Algorithm for Multi-relational Discovery of Subgroups. In European Symposium on Principles of Data Mining and Knowledge Discovery","author":"Wrobel S.","year":"1997","unstructured":"S. Wrobel . An Algorithm for Multi-relational Discovery of Subgroups. In European Symposium on Principles of Data Mining and Knowledge Discovery , 1997 . S. Wrobel. An Algorithm for Multi-relational Discovery of Subgroups. In European Symposium on Principles of Data Mining and Knowledge Discovery, 1997."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882471.1882478"},{"key":"e_1_3_2_1_50_1","volume-title":"SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning, 42(1--2):31--60","author":"Zaki M. J.","year":"2001","unstructured":"M. J. Zaki . SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning, 42(1--2):31--60 , 2001 . M. J. Zaki. SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning, 42(1--2):31--60, 2001."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5121-y"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Francisco California USA","acronym":"KDD '16"},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:04Z","timestamp":1750223224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":51,"alternative-id":["10.1145\/2939672.2939752","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939752","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}