Tight optimistic estimates for fast subgroup discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5211 LNAI, Issue PART 1, 2008, Pages 440-456

  Grosskreutz, Henrik ^a   Rüping, Stefan ^a   Wrobel, Stefan ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; PROBABILITY DENSITY FUNCTION; ROBOT LEARNING;

BINARY TARGETS; CLASS QUALITIES; EVALUATION FUNCTIONS; MONOTONICITY; OPTIMAL FUNCTIONS; OPTIMALITY; OPTIMISTIC ESTIMATE PRUNING; OPTIMISTIC ESTIMATES; PRUNING TECHNIQUES; SPEED-UP; SUBGROUP DISCOVERIES;

LEARNING SYSTEMS;

EID: 56049106887     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87479-9_47     Document Type: Conference Paper

References (21)

1. Atzmüller, M., Baumeister, J., Puppe, F.: Introspective subgroup analysis for interactive knowledge refinement. In: Sutcliffe, G., Goebel, R. (eds.) FLAIRS Conference, pp. 402-407. AAAI Press, Menlo Park (2006)
2. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)
3. Atzmüller, M., Puppe, F.: SD-map - a fast algorithm for exhaustive subgroup discovery. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 6-17. Springer, Heidelberg (2006)
4. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J. (eds.): Classification and Regression Trees. Wadsworth (1984)
5. Breiman. L.: Technical note: Some properties of splitting criteria. Machine Learning 24(1), 41-47 (1996)
6. Boyd. S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
7. Geerts, F., Goethals, B., Mielikäinen, T.: Tiling databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 278-289. Springer, Heidelberg (2004)
8. Grosskreutz, H., Rüping, S., Shaabani, N., Wrobel, S.: Optimistic estimate pruning strategies for fast exhaustive subgroup discovery. Technical report, Fraunhofer Institute IAIS (2008), http://publica.fraunhofer.de/eprints/ urn:nbn:de:0011-n-723406.pdf
9. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) SIGMOD Conference, pp. 1-12. ACM, New York (2000)
10. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53-87 (2004)
11. Kralj, P., Lavrac, N., Gamberger, D., Krstacic, A.: Contrast set mining through subgroup discovery applied to brain ischaemina data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 579-586. Springer, Heidelberg (2007)
12. Kavsek, B., Lavrac, N., Jovanoski, V.: Apriori-sd: Adapting association rule learning to subgroup discovery. In: R. Berthold, M., Lenz, H.-J., Bradley, E., Kruse, R., Borgelt, C. (eds.) IDA 2003. LNCS, vol. 2810, pp. 230-241. Springer, Heidelberg (2003)
13. Klösgen, W.: Explora: A multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining, pp. 249-271 (1996)
14. Klösgen, W.: Subgroup Discovery. In: Handbook of Data Mining and Knowledge. Oxford University Press, Oxford (2002)
15. Klösgen, W., May, M.: Spatial subgroup mining integrated in an object-relational spatial database. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 275-286. Springer, Heidelberg (2002)
16. Lavrac, N., Cestnik, B., Gamberger, D., Flach, P.A.: Decision support through subgroup discovery: Three case studies and the lessons learned. Machine Learning 57(1-2), 115-143 (2004)
17. Lavrac, N., Kavsek, B., Flach, P., Todorovski, L.: Subgroup discovery with cn2-sd. Journal of Machine Learning Research 5, 153-188 (2004)
18. Paterson, J., Edlich, S., Hörning, H., Hörning, R.: The Definitive Guide to db4o. Apress, Berkely (2006)
19. Scheffer, T., Wrobel, S.: A sequential sampling algorithm for a general class of utility criteria, pp. 330-334. ACM Press, New York (2000)
20. Webb, G.I.: Opus: An efficient admissible algorithm for unordered search. J. Artif. Intell. Res (JAIR) 3, 431-465 (1995)
21. Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., Zytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 78-87. Springer, Heidelberg (1997)