{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:32:59Z","timestamp":1770355979918,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T00:00:00Z","timestamp":1507248000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10115-017-1109-2","type":"journal-article","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T01:05:54Z","timestamp":1507251954000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Mining exceptional closed patterns in attributed graphs"],"prefix":"10.1007","volume":"56","author":[{"given":"Anes","family":"Bendimerad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4636-5753","authenticated-orcid":false,"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"1109_CR1","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.ins.2015.05.008","volume":"329","author":"M Atzm\u00fceller","year":"2016","unstructured":"Atzm\u00fceller M, Doerfel S, Mitzlaff F (2016) Description-oriented community detection using exhaustive subgroup discovery. Inf Sci 329:965\u2013984","journal-title":"Inf Sci"},{"key":"1109_CR2","doi-asserted-by":"crossref","unstructured":"Bendimerad AA, Plantevit M, Robardet C (2016) Unsupervised exceptional attributed sub-graph mining in urban data. In: IEEE 16th international conference on data mining, ICDM 2016, Barcelona, Spain, 12\u201315 Dec 2016, pp 21\u201330","DOI":"10.1109\/ICDM.2016.0013"},{"key":"1109_CR3","doi-asserted-by":"crossref","unstructured":"Boley M, Lucchese C, Paurat D, G\u00e4rtner T (2011) Direct local pattern sampling by efficient two-step random procedures. In: ACM SIGKDD 2011, pp 582\u2013590","DOI":"10.1145\/2020408.2020500"},{"key":"1109_CR4","doi-asserted-by":"crossref","unstructured":"Boulicaut J, Plantevit M, Robardet C (2016) Local pattern detection in attributed graphs. In: Solving large scale learning tasks. Challenges and algorithms\u2014essays dedicated to Katharina Morik on the occasion of her 60th birthday, pp 168\u2013183","DOI":"10.1007\/978-3-319-41706-6_8"},{"issue":"1","key":"1109_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10618-015-0403-4","volume":"30","author":"W Duivesteijn","year":"2016","unstructured":"Duivesteijn W, Feelders A, Knobbe AJ (2016) Exceptional model mining\u2014supervised descriptive local pattern mining with complex target concepts. Data Min Knowl Discov 30(1):47\u201398","journal-title":"Data Min Knowl Discov"},{"key":"1109_CR6","doi-asserted-by":"crossref","unstructured":"Duivesteijn W, Knobbe AJ, Feelders A, van Leeuwen M (2010) Subgroup discovery meets bayesian networks\u2014an exceptional model mining approach. In: ICDM 2010, pp 158\u2013167","DOI":"10.1109\/ICDM.2010.53"},{"issue":"5","key":"1109_CR7","doi-asserted-by":"crossref","first-page":"1266","DOI":"10.1007\/s10618-017-0501-6","volume":"31","author":"V Dzyuba","year":"2017","unstructured":"Dzyuba V, van Leeuwen M, Raedt LD (2017) Flexible constrained sampling with guarantees for pattern mining. Data Min Knowl Discov 31(5):1266\u20131293","journal-title":"Data Min Knowl Discov"},{"key":"1109_CR8","unstructured":"Falher GL, Gionis A, Mathioudakis M (2015) Where is the soho of rome? Measures and algorithms for finding similar neighborhoods in cities. In: ICWSM 2015, pp 228\u2013237"},{"key":"1109_CR9","doi-asserted-by":"crossref","unstructured":"Giacometti A, Soulet A (2016) Frequent pattern outlier detection without exhaustive mining. In: PAKDD 2016, pp 196\u2013207","DOI":"10.1007\/978-3-319-31750-2_16"},{"key":"1109_CR10","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining. In: ICDM 2010, pp 845\u2013850"},{"issue":"1","key":"1109_CR11","first-page":"730","volume":"2","author":"MA Hasan","year":"2009","unstructured":"Hasan MA, Zaki MJ (2009) Output space sampling for graph patterns. PVLDB 2(1):730\u2013741","journal-title":"PVLDB"},{"issue":"8","key":"1109_CR12","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1007\/s10994-016-5598-0","volume":"106","author":"M Kaytoue","year":"2017","unstructured":"Kaytoue M, Plantevit M, Zimmermann A, Bendimerad A, Robardet C (2017) Exceptional contextual subgraph mining. Mach Learn 106(8):1171\u20131211","journal-title":"Mach Learn"},{"key":"1109_CR13","doi-asserted-by":"crossref","unstructured":"Kuznetsov SO (1999) Learning of simple conceptual graphs from positive and negative examples. In: Principles of data mining and knowledge discovery, third european conference, PKDD \u201999, Prague, Czech Republic, Proceedings, 15\u201318 Sep 1999, pp 384\u2013391","DOI":"10.1007\/978-3-540-48247-5_47"},{"key":"1109_CR14","first-page":"153","volume":"5","author":"N Lavrac","year":"2004","unstructured":"Lavrac N, Kavsek B, Flach PA, Todorovski L (2004) Subgroup discovery with CN2-SD. J Mach Learn Res 5:153\u2013188","journal-title":"J Mach Learn Res"},{"key":"1109_CR15","doi-asserted-by":"crossref","unstructured":"Leman D, Feelders A, Knobbe AJ (2008) Exceptional model mining. In: ECMLPKDD 2008, pp 1\u201316","DOI":"10.1007\/978-3-540-87481-2_1"},{"key":"1109_CR16","doi-asserted-by":"crossref","unstructured":"Lemmerich F, Becker M, Singer P, Helic D, Hotho A, Strohmaier M (2016) Mining subgroups with exceptional transition behavior. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, USA, 13\u201317 Aug 2016, pp 965\u2013974","DOI":"10.1145\/2939672.2939752"},{"issue":"1","key":"1109_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10618-015-0409-y","volume":"30","author":"G Li","year":"2016","unstructured":"Li G, Zaki MJ (2016) Sampling frequent and minimal boolean patterns. Data Min Knowl Discov 30(1):181\u2013225","journal-title":"Data Min Knowl Discov"},{"key":"1109_CR18","doi-asserted-by":"crossref","unstructured":"Moens S, Boley M (2014) Instant exceptional model mining using weighted controlled pattern sampling. In: IDA, pp 203\u2013214","DOI":"10.1007\/978-3-319-12571-8_18"},{"key":"1109_CR19","doi-asserted-by":"crossref","unstructured":"Moens S, Goethals B (2013) Randomly sampling maximal itemsets. In: ACM SIGKDD workshop on interactive data exploration and analytics, pp 79\u201386","DOI":"10.1145\/2501511.2501523"},{"key":"1109_CR20","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SDM 2009, pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"issue":"3","key":"1109_CR21","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10115-013-0625-y","volume":"39","author":"P Mougel","year":"2014","unstructured":"Mougel P, Rigotti C, Plantevit M, Gandrillon O (2014) Finding maximal homogeneous clique sets. Knowl Inf Syst 39(3):579\u2013608","journal-title":"Knowl Inf Syst"},{"key":"1109_CR22","first-page":"377","volume":"10","author":"PK Novak","year":"2009","unstructured":"Novak PK, Lavrac N, Webb GI (2009) Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J Mach Learn Res 10:377\u2013403","journal-title":"J Mach Learn Res"},{"key":"1109_CR23","doi-asserted-by":"crossref","unstructured":"Park S, Bourqui M, Fr\u00edas-Mart\u00ednez E (2016) Mobinsight: understanding urban mobility with crowd-powered neighborhood characterizations. In: IEEE international conference on data mining workshops, ICDM (demo) 2016, Barcelona, Spain, 12\u201315 Dec 2016, pp 1312\u20131315","DOI":"10.1109\/ICDMW.2016.0192"},{"issue":"9","key":"1109_CR24","first-page":"2090","volume":"25","author":"A Prado","year":"2013","unstructured":"Prado A, Plantevit M, Robardet C, Boulicaut J (2013) Mining graph topological patterns: finding covariations among vertex descriptors. IEEE TKDE 25(9):2090\u20132104","journal-title":"IEEE TKDE"},{"key":"1109_CR25","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Anagnostopoulos A, Gionis A, Tatti N (2014) Event detection in activity networks. In: KDD, pp 1176\u20131185","DOI":"10.1145\/2623330.2623674"},{"issue":"4","key":"1109_CR26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/sam.11277","volume":"8","author":"TK Saha","year":"2015","unstructured":"Saha TK, Hasan MA (2015) A sampling based method for top-k frequent subgraph mining. Stat Anal DM 8(4):245\u2013261","journal-title":"Stat Anal DM"},{"issue":"5","key":"1109_CR27","first-page":"466","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva A, Meira W Jr, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5):466\u2013477","journal-title":"PVLDB"},{"issue":"2","key":"1109_CR28","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.compenvurbsys.2007.11.004","volume":"32","author":"SE Spielman","year":"2008","unstructured":"Spielman SE, Thill J (2008) Social area analysis, data mining, and GIS. Comput Environ Urban Syst 32(2):110\u2013122","journal-title":"Comput Environ Urban Syst"},{"issue":"2","key":"1109_CR29","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10618-010-0187-5","volume":"21","author":"M Leeuwen van","year":"2010","unstructured":"van Leeuwen M (2010) Maximal exceptions with minimal descriptions. Data Min Knowl Discov 21(2):259\u2013276","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"1109_CR30","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/s10618-012-0273-y","volume":"25","author":"M Leeuwen van","year":"2012","unstructured":"van Leeuwen M, Knobbe AJ (2012) Diverse subgroup set discovery. Data Min Knowl Discov 25(2):208\u2013242","journal-title":"Data Min Knowl Discov"},{"key":"1109_CR31","doi-asserted-by":"crossref","unstructured":"Yang G (2004) The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, seattle, Washington, USA, 22\u201325 Aug 2004, pp 344\u2013353","DOI":"10.1145\/1014052.1014091"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1109-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1109-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1109-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,13]],"date-time":"2018-06-13T10:04:31Z","timestamp":1528884271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1109-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,6]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1109"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1109-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,6]]}}}