Database Reference
In-Depth Information
20. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen,
J. F. Naughton, and P. A. Bernstein, editors,
SIGMOD Conference
, pages 1-12. ACM, 2000.
ISBN 1-58113-218-2.
21. B. Kavsek and N. Lavrac. Apriori-SD: Adapting association rule learning to subgroup discovery.
Applied Artificial Intelligence
, 20 (7): 543-583, 2006.
22. S. Kramer and L. De Raedt. Feature construction with version spaces for biochemical applica-
tions. In C. E. Brodley and A. P. Danyluk, editors,
ICML
, pages 258-265. Morgan Kaufmann,
2001. ISBN 1-55860-778-1.
23. N. Lavrac, B. Kavsek, P. A. Flach, and L. Todorovski. Subgroup discovery with CN2-SD.
Journal of Machine Learning Research
, 5: 153-188, 2004.
24. D. Leman, A. Feelders, and A. J. Knobbe. Exceptional model mining. In
ECML/PKDD (2)
,
pages 1-16, 2008.
25. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-
association rules. In N. Cercone, T. Y. Lin, and X. Wu, editors,
Proceedings of the 2001 IEEE
International Conference on Data Mining
, pages 369-376, San José, California, USA, Nov.
2001. IEEE Computer Society.
26. J. Li, G. Dong, K. Ramamohanarao, and L. Wong. A new instance-based lazy discovery and
classification system.
Machine Learning
, 54 (2): 99-124, 2004.
27. B. Liu, W. Hsu, andY. Ma. Integrating classification and association rule mining. In R. Agrawal,
P. E. Stolorz, and G. Piatetsky-Shapiro, editors,
Proceedings of the Fourth International Con-
ference on Knowledge Discovery and Data Mining
, pages 80-86, New York City, New York,
USA, Aug. 1998. AAAI Press.
28. D. Meretakis and B. Wüthrich. Extending naïve bayes classifiers using long itemsets. In U.
M. Fayyad, S. Chaudhuri, and D. Madigan, editors,
KDD
, pages 165-174. ACM, 1999. ISBN
1-58113-143-7.
29. S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In
Proceed-
ings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems
, pages 226-236, Dallas, Texas, USA, May 2000. ACM.
30. S. Nijssen and É. Fromont. Optimal constraint-based decision tree induction from itemset
lattices.
Data Min. Knowl. Discov.
, 21 (1): 9-51, 2010.
31. S. Nijssen and J. N. Kok. Multi-class correlated pattern mining. In F. Bonchi and J.-F. Boulicaut,
editors,
KDID
, volume 3933 of
Lecture Notes in Computer Science
, pages 165-187. Springer,
2005. ISBN 3-540-33292-8.
32. P. K. Novak, N. Lavrac, and G. I. Webb. Supervised descriptive rule discovery: A unifying
survey of contrast set, emerging pattern and subgroup mining.
Journal of Machine Learning
Research
, 10: 377-403, 2009.
33. H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In Y.
Li, B. Liu, and S. Sarawagi, editors,
Proceedings of the 14th ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining
, pages 230-238. ACM, 2008., pages
578-586. ISBN 978-1-60558-193-4.
34. H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda. gboost:a mathematical pro-
gramming approach to graph classification and regression.
Machine Learning
, 75 (1): 69-89,
2009.
35. M. Thoma, H. Cheng, A. Gretton, J. Han, H.-P. Kriegel, A. J. Smola, L. Song, P. S. Yu, X. Yan,
and K. M. Borgwardt. Discriminative frequent subgraph mining with optimality guarantees.
Statistical Analysis and Data Mining
, 3 (5): 302-318, 2010.
36. M. van Leeuwen, J. Vreeken, and A. Siebes. Compression picks item sets that matter. In [16],
pages 585-592. ISBN 3-540-45374-1.
37. A. Veloso, W. M. Jr., and M. J. Zaki. Lazy associative classification. In
ICDM
, pages 645-654.
IEEE Computer Society, 2006.
38. J. Wang and G. Karypis. Harmony: Efficiently mining the best rules for classification. In
SDM
,
2005.
39. G. I. Webb. Opus: An efficient admissible algorithm for unordered search.
J. Artif. Intell. Res.
(JAIR)
, 3: 431-465, 1995.
