Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves

Machine Learning

Volumn 64, Issue 1-3, 2006, Pages 231-261

  Goadrich, Mark ^a   Oliphant, Louis ^a   Shavlik, Jude ^a  

^a University of Wisconsin   (United States)

Author keywords

Biomedical information extraction; Ensembles; Inductive logic programming; Recall precision curves

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; DATA REDUCTION; INFORMATION RETRIEVAL; MEDICAL APPLICATIONS; RANDOM PROCESSES;

BIOMEDICAL INFORMATION EXTRACTION; ENSEMBLES; INDUCTIVE LOGIC PROGRAMMING; RECALL-PRECISION CURVES;

LOGIC PROGRAMMING;

EID: 33748260363     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-8958-3     Document Type: Conference Paper

References (67)

1. Aitken, S. (2002). Learning Information Extraction Rules: An Inductive Logic Programming Approach. Proceedings of the 15th European Conference on Artificial Intelligence. Amsterdam, Netherlands.
2. Becker, W., Reece, J., & Poenie, M. (1996). The World of the Cell. Benjamin Cummings.
3. Blaschke, C., Hirschman, L., & Valencia, A. (2002). Information Extraction in Molecular Biology. Briefings in Bioinformatics, 3, 154-165.
4. Blockeel, H., & Dehaspe, L. (2000). Cumulativity as Inductive Bias. PKDD 2000 Workshop on Data Mining, Decision Support, Meta-learning and ILP. Lyon, France.
5. Bradley, A. (1997). The Use of the Area Under the ROC Curve in the Evaluation of Machine Learning Algorithms. Pattern Recognition, 30, 1145-1159.
6. Breiman, L. (1996). Bagging Predictors. Machine Learning, 24, 123-140.
7. Bunescu, R., Ge, R., Kate, R., Marcotte, E., Mooney, R., Ramani, A., & Wong, Y. (2005). Comparative Experiments on Learning Information Extractors for Proteins and their Interactions. Journal of Artificial Intelligence in Medicine, 3(2), 139-155.
8. Califf, M. E., & Mooney, R. (1998). Relational Learning of Pattern-Match Rules for Information Extraction. Working Notes of AAAI Spring Symposium on Applying Machine Learning to Discourse Processing (pp. 6-11). Menlo Park, CA: AAAI Press.
9. Clark, P., & Boswell, R. (1991). Rule Induction with CN2: Some Recent Improvements. Proceedings of the European Working Session on Machine Learning (pp. 151-163). Porto, Portugal: Springer-Verlag New York, Inc.
10. Clark, P., & Niblett, T. (1989). The CN2 Induction Algorithm. Machine Learning, 3, 261-283.
11. Cortes, C., & Mohri, M. (2003). AUC Optimization vs. Error Rate Minimization. Neural Information Processing Systems (NIPS). MIT Press.
12. Craven, M., & Slattery, S. (2001). Relational Learning with Statistical Predicate Invention: Better Models for Hypertext. Machine Learning, 43, 97-119.
13. Davis, J., Burnside, E., Dutra, I. C., Page, D., & Costa, V. S. (2005a). An Integrated Approach to Learning Bayesian Networks of Rules. 16th European Conference on Machine Learning (pp. 84-95). Porto, Portugal: Springer.
14. Davis, J., Dutra, I. C., Page, D., & Costa, V. S. (2005b). Establish Entity Equivalence in Multi-Relation Domains. Proceedings of the International Conference on Intelligence Analysis. Vienna, Va.
15. Davis, J. & Goadrich, M. (2006). The Relationship Between Precision-Recall and ROC Curves. Proceedings of the 23rd International Conference on Machine Learning. Pittsburgh, Pennsylvania.
16. de Castro Dutra, I., Page, D., Costa, V. S., & Shavlik, J. (2002). An Empirical Evaluation of Bagging in Inductive Logic Programming. Twelfth International Conference on Inductive Logic Programming (pp. 48-65). Sydney, Australia.
17. Dietterich, T. (1998). Machine-Learning Research: Four Current Directions. The AI Magazine, 18, 97-136.
18. Džeroski, S., & Lavrač, N. (2001). An Introduction to Inductive Logic Programming. Relational Data Mining (pp. 48-66). Springer-Verlag.
19. Eliassi-Rad, T., & Shavlik, J. (2001). A Theory-Refinement Approach to Information Extraction. Proceedings of the 18th International Conference on Machine Learning. Williamstown, Massachusetts.
20. Fawcett, T. (2001). Using Rule Sets to Maximize ROC Performance. IEEE International Conference on Data Mining (ICDM) (pp. 131-138).
21. Fawcett, T. (2003). ROC Graphs: Notes and Practical Considerations for Researchers (Technical Report). HP Labs HPL-2003-4.
22. Freitag, D., & Kushmerick, N. (2000). Boosted Wrapper Induction. Proceedings of the 15th National Conference on Artificial Intelligence. (AAAI) (pp. 577-583). Austin, Texas.
23. Freund, Y., & Schapire, R. (1996). Experiments with a New Boosting Algorithm. International Conference on Machine Learning (pp. 148-156). Bari, Italy.
24. Friedman, N., Geiger, D., & Goldszmidt, M. (1997). Bayesian Network lassifiers. Machine Learning, 29, 131-163.
25. Friedman, N., Getoor, L., Koller, D., & Pfeffer, A. (1999). Learning Probabilistic Relational Models. Proceedings of the 16th International Conference on Artificial Intelligence (IJCAI) (pp. 1300-1309). Stockholm, Sweden.
26. Fürnkranz, J., & Flach, P. (2005). ROC 'n' rule learning - Towards a better understanding of covering algorithms. Machine Learning, 58, 39-77.
27. Fürnkranz, J. (1999). Separate-and-Conquer Rule Learning. Artificial Intelligence Review, 13, 3-54.
28. Goadrich, M., Oliphant, L., & Shavlik, J. (2004). Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction. Proceedings of the 14th International Conference on Inductive Logic Programming (ILP). Porto, Portugal.
29. Goadrich, M., Oliphant, L., & Shavlik, J. (2005). Learning to Extract Genic Interactions using Gleaner. Proceedings of the Learning Language in Logic 2005 Workshop at the International Confeience on Machine Learning. Bonn, Germany.
30. Hoche, S., & Wrobel, S. (2001). Relational Learning Using Constrained Confidence-Rated Boosting, 11th International Confeience on Inductive Logic Programming. Strasbourg, France.
31. Hodges, P. E., Payne, W. E., & Garrels, J. I. (1997). The Yeast Protein Database (YPD): A Curated Proteome Database for saccharomyces cerevisiae. Nucleic Acids Research, 26, 68-72.
32. Hoos, H., & Stutzle, T. (2004). Stochastic local search: foundations and applications. Morgan Kaufmann.
33. Hu, Z. (2003). Guidelines for Protein Name Tagging (Technical Report). Georgetown University.
34. Kauchak, D., Smarr, J., & Elkan, C. (2004). Sources of Success for Boosted Wrapper Induction. Journal of Machine Learning Research, 5, 499-527.
35. Kersting, K., & Raedt, L. D. (2000). Bayesian Logic Programs. Proceedings of the Work-in-Progress Track at the 10th International Conference on Inductive Logic Programming (pp. 138-155). London, England.
36. Koller, D., & Pfeffer, A. (1997). Learning Probabilities for Noisy First-Order Rules. Fifteenth International Joint Conference on Artificial Intelligence (IJCAI). Nagoya, Japan.
37. Landwehr, N., Kersting, K., & Raedt, L. D. (2005). nFOIL: Integrating Naive Bayes and FOIL. National Conference on Artificial Intelligene (AAAI). Pittsburg, Pennsylvania.
38. Lewis, D. (1991). Evaluating Text Categorization. Proceedings of Speech and Natural Language Workshop (pp. 312-318). Pacific Grove, California: Morgan Kaufmann.
39. Manning, C., & Schütze, H. (1999). Foundations of statistical natural language processing. MIT Press.
40. Michalski, R., & Larson, J. (1977). Inductive Inference of VL Decision Rules. Proceedings of the Workshop in Pattern-Directed Inference Systems. Hawaii.
41. Mitchell, T. (1997). Machine learning. New York: McGraw-Hill.
42. Muggleton, S. (1995). Inverse Entailment and Progol. New Generation Computing Journal, 13, 245-286.
43. Muggleton, S. (1996). Stochastic Logic Programs. Proceedings of the 5th International Workshop on Inductive Logic Programming (p. 29). Stockholm, Sweden.
44. Muggleton, S. (2000). Learning Stochastic Logic Programs. Proceedings of the AAAI2000 Workshop on Learning Statistical Models from Relational Data. Austin, Texas.
45. Nilsson, U., & Maluszyński, J. (2000). Logic Programming and PROLOG (2ed). John Wiley & Sons.
46. Opitz, D., & Shavlik, J. (1996). Actively Searching for an Effective Neural-Network Ensemble. Connection Science, 8, 337-353.
47. Pompe, U., & Kononenko, I. (1995). Naive Bayesian Classifier within ILP-R. Fifth International Workshop on Inductive Logic Programming (pp. 417-436). Tokyo, Japan.
48. Popescul, A., Ungar, L., Lawrence, S., & Pennock, D. (2003). Statistical Relational Learning for Document Mining. IEEE International Conference on Data Mining, ICDM-2003. Melbourne, Florida.
49. Porter, M. (1980). An Algorithm for Suffix Stripping. Program, 14, 130-137.
50. Quinlan, J. R. (1990). Learning Logical Definitions from Relations. Machine Learning, 5, 239-266.
51. Quinlan, J. R. (2001). Relational Learning and Boosting. Relational Data Mining (pp. 292-306). Springer-Verlag.
52. Ray, S., & Craven, M. (2001). Representing Sentence Structure in Hidden Markov Models for Information Extraction. Proceedings of the 17th International Joint Conference on Artificial. Intelligence (IJCAI). Seattle, Washington.
53. Richardson, M., & Domingos, P. (2006). Markov Logic Networks. Machine Learning, 62, 107-136.
54. Riloff, E. (1998). The Sundance Sentence Analyzer. http://www.cs.utah. edu/projects/nlp/.
55. Rissanen, J. (1978). Modeling by Shortest Data Description. Automatica, 14, 465-471.
56. Rückert, U., Kramer, S., & Raedt, L. D. (2002). Phase Transitions and Stochastic Local Search in k-Term DNF Learning. Proceedings of the 13th European Conference on Machine Learning (ECML-02). Helsinki, Finland.
57. Rückert, U., & Kramer, S. (2003). Stochastic Local Search in k-Term DNF Learning. Proceedings of 20th International Conference on Machine. Learning (ICML-2003). Washington, D.C., USA.
58. Rückert, U., & Kramer, S. (2004). Toward Tight Bounds for Rule Learning. Proceedings of 21st International Conference on Machine Learning (ICML-04). Banff, Canada.
59. Selman, B., Kautz, H., & Cohen, B. (1993). Local Search Strategies for Satisfiability Testing. Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability. Providence, RI.
60. Shatkay, H., & Feldman, R. (2003). Mining the Biomedical Literature in the Genomic Era: An Overview. Journal of Computational Biology, 10, 821-55.
61. Srinivasan, A., & King, R. (1996). Feature Construction with Inductive Logic Programming: A Study of Quantitative Predictions of Biological Activity Aided by Structural Attributes. Proceedings of the 6th International Workshop on Inductive Logic Programming (pp. 352-367). Stockholm, Sweden.
62. Srinivasan, A., Muggleton, S., Sternberg, M., & King, R. (1996). Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction. Artificial Intelligence, 85, 277-299.
63. Srinivasan, A. (2003). The Aleph Manual Version 4. http://web.comlab.ox. ac.uk/oucl/research/areas/machlearn/Aleph/.
64. Tang, L., Mooney, R., & Melville, P. (2003). Scaling up ILP to Large Examples: Results on Link Discovery for Counter-Terrorism. KDD Workshop on Multi-Relational Data Mining. Washington, DC.
65. Taskar, B., Abbeel, P., Wong, M.-F., & Koller, D. (2003). Label and Link Prediction in Relational Data. IJCAI Workshop on Learning Statistical Models from Relational Data. Acapulco, Mexico.
66. Železný, F., Srinivasan, A., & Page, D. (2003). Lattice-Search Runtime Distributions may be Heavy-Tailed. Proceedings of the 12th International Conference on Inductive Logic Programming 2002 (pp. 333-345). Syndey, Australia.
67. Železný, F., Srinivasan, A., & Page, D. (2004). A Monte Carlo Study of Randomized Restarted Search in ILP. Proceedings of 14th International Conference on Inductive Logic Programming (ILP-04). Porto, Portugal.