CrossMine: Efficient classification across multiple database relations

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

Volumn 3848 LNAI, Issue , 2006, Pages 172-195

  Yin, Xiaoxin ^a   Han, Jiawei ^a   Yang, Jiong ^a   Yu, Philip S ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; DECISION MAKING; LOGIC PROGRAMMING; MEDICAL APPLICATIONS;

CROSSMINE; INDUCTIVE LOGIC PROGRAMMING; MEDICAL RESEARCH; SYNTHETIC DATABASES;

DATA ACQUISITION;

EID: 33745120787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11615576_9     Document Type: Conference Paper

References (19)

1. A. Appice, M. Ceci, and D. Malerba. Mining model trees: a multi-relational approach. In Proc. 2003 Int. Conf. on Inductive Logic Programming, Szeged, Hungary, Sept. 2003.
2. J. M. Aronis, F. J. Provost. Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation. In Proc. 2003 Int. Conf. Knowledge Discovery and Data Mining, Newport Beach, CA, 1997.
3. H. Blockeel, L. De Raedt, and J. Ramon. Top-down induction of logical decision trees. In Proc. 1998 Int. Conf. Machine Learning, Madison, WI, Aug. 1998.
4. H. Blockeel, L. De Raedt, N. Jacobs, and B. Demoen. Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery, 3(1):59-93, 1999.
5. H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research, 16:135-166, 2002.
6. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2:121-168, 1998.
7. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Proc. 1991 European Working Session on Learning, pages 151-163, Porto, Portugal, Mar. 1991.
8. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002.
9. J. Gehrke, R. Ramakrishnan, and V. Ganti. Rainforest: A framework for fast decision tree construction of large datasets. In Proc. 1998 Int. Conf. Very Large Data Bases, New York, NY, Aug. 1998.
10. N. Lavrac and S. Dzeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.
11. T. M. Mitchell. Machine Learning. McGraw Hill, 1997.
12. S. Muggleton. Inductive Logic Programming. Academic Press, New York, NY, 1992.
13. S. Muggleton. Inverse entailment and progol. In New Generation Computing, Special issue on Inductive Logic Programming, 1995.
14. S. Muggleton and C. Feng. Efficient induction of logic programs. In Proc. 1990 Conf. Algorithmic Learning Theory, Tokyo, Japan, 1990.
15. J. Neville, D. Jensen, L. Friedland, and M. Hay. Learning Relational Probability Trees. Proc. 2003 Int. Conf. Knowledge Discovery and Data Mining, Washington, DC, 2003.
16. A. Popescul, L. Ungar, S. Lawrence, and M. Pennock. Towards structural logistic regression: Combining relational and statistical learning. In Proc. Multi-Relational Data Mining Workshop, Alberta, Canada, 2002.
17. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
18. J. R. Quinlan and R. M. Cameron-Jones. FOIL: A midterm report. In Proc. 1993 European Conf. Machine Learning, Vienna, Austria, 1993.
19. B. Taskar, E. Segal, and D. Koller. Probabilistic classification and clustering in relational data. In Proc. 2001 Int. Joint Conf. Artificial Intelligence, Seattle, WA, 2001.