{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:45:46Z","timestamp":1725745546516},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401305"},{"type":"electronic","value":"9783642401312"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40131-2_17","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T23:53:22Z","timestamp":1377042802000},"page":"196-208","source":"Crossref","is-referenced-by-count":2,"title":["Depth-First Traversal over a Mirrored Space for Non-redundant Discriminative Itemsets"],"prefix":"10.1007","author":[{"given":"Yoshitaka","family":"Kameya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Asaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S.D. Bay","year":"2001","unstructured":"Bay, S.D., Pazzani, M.J.: Detecting group differences: mining contrast sets. Data Mining and Knowledge Discovery\u00a05, 213\u2013246 (2001)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1009895914772","volume":"4","author":"R. Bayardo","year":"2000","unstructured":"Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery\u00a04, 217\u2013240 (2000)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proc. of KDD 1999, pp. 43\u201352 (1999)","DOI":"10.1145\/312129.312191"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz, J., Gamberger, D., Lavra\u010d, N.: Foundations of Rule Learning. Springer (2012)","DOI":"10.1007\/978-3-540-75197-7"},{"key":"17_CR5","first-page":"559","volume":"9","author":"G.C. Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. of Machine Learning Research\u00a09, 559\u2013580 (2008)","journal-title":"J. of Machine Learning Research"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-23780-5_44","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H. Grosskreutz","year":"2011","unstructured":"Grosskreutz, H., Paurat, D.: Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011, Part I. LNCS, vol.\u00a06911, pp. 533\u2013548. Springer, Heidelberg (2011)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Grosskreutz, H., R\u00fcping, S., Wrobel, S.: Tight optimistic estimates for fast subgroup discovery. In: Proc. of ECLM\/PKDD 2008, pp. 440\u2013456 (2008)","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"17_CR9","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-K frequent closed patterns without minimum support. In: Proc. of ICDM 2002, pp. 211\u2013218 (2002)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Kameya, Y., Sato, T.: RP-growth: top-k mining of relevant patterns with minimum support raising. In: Proc. of SDM 2012, pp. 816\u2013827 (2012)","DOI":"10.1137\/1.9781611972825.70"},{"key":"17_CR11","first-page":"377","volume":"10","author":"P. Kralj Novak","year":"2009","unstructured":"Kralj Novak, P., Lavra\u010d, N., Webb, G.I.: Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J. of Machine Learning Research\u00a010, 377\u2013403 (2009)","journal-title":"J. of Machine Learning Research"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0743-1066(99)00019-9","volume":"40","author":"N. Lavra\u010d","year":"1999","unstructured":"Lavra\u010d, N., Gamberger, D., Jovanoski, V.: A study of relevance for learning in deductive databases. J. of Logic Programming\u00a040, 215\u2013249 (1999)","journal-title":"J. of Logic Programming"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Morishita, S., Sese, J.: Traversing itemset lattices with statistical metric pruning. In: Proc. of PODS 2000, pp. 226\u2013236 (2000)","DOI":"10.1145\/335168.335226"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: Proc. of KDD 2009, pp. 647\u2013656 (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"17_CR16","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proc. of ICDE 2001, pp. 215\u2013224 (2001)"},{"key":"17_CR17","unstructured":"Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229\u2013248. AAAI Press (1991)"},{"key":"17_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-24775-3_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Soulet","year":"2004","unstructured":"Soulet, A., Cr\u00e9milleux, B., Rioult, F.: Condensed representation of emerging patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 127\u2013132. Springer, Heidelberg (2004)"},{"key":"17_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T. Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 16\u201331. Springer, Heidelberg (2004)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"G.I. Webb","year":"2007","unstructured":"Webb, G.I.: Discovering significant patterns. Machine Learning\u00a068, 1\u201333 (2007)","journal-title":"Machine Learning"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-63223-9_108","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Wrobel","year":"1997","unstructured":"Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 1997. LNCS, vol.\u00a01263, pp. 78\u201387. Springer, Heidelberg (1997)"},{"key":"17_CR22","first-page":"309","volume":"42","author":"C. Yuan","year":"2011","unstructured":"Yuan, C., Lim, H., Lu, T.C.: Most relevant explanation in Bayesian networks. J. of Artificial Intelligence Research\u00a042, 309\u2013352 (2011)","journal-title":"J. of Artificial Intelligence Research"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10994-009-5121-y","volume":"77","author":"A. Zimmermann","year":"2009","unstructured":"Zimmermann, A., De Raedt, L.: Cluster grouping: from subgroup discovery to clustering. Machine Learning\u00a077, 125\u2013159 (2009)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40131-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:48:39Z","timestamp":1558018119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40131-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401305","9783642401312"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40131-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}