Combining statistical and relational methods for learning in hypertext domains

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

Volumn 1446, Issue , 1998, Pages 38-52

  Slattery, Seán ^a   Craven, Mark ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; HYPERTEXT SYSTEMS; LEARNING SYSTEMS;

HYPERLINKS; INTERNAL STRUCTURE; LEARNING METHODS; NEW APPROACHES; RULE LEARNERS; WORD FREQUENCIES;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 53749100576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0027309     Document Type: Conference Paper

References (17)

1. W. W. Cohen. Fast effective rule induction. In Proc. of the 12th International Conference on Machine Learning. Morgan Kaufmann, 1995.
2. W. W. Cohen. Learning to classify English text with ILP methods. In L. De Raedt, editor, Advances in Inductive Logic Programming. IOS Press, 1995.
3. M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery. Learning to extract symbolic knowledge from the World Wide Web. In Proc. of the 15th National Conference on Artificial Intelligence, Madison, WI, 1998. AAAI Press.
4. M. Craven, S. Slattery, and K. Nigam. First-order learning for Web mining. In Proc. of the 10th European Conference on Machine Learning, pages 250-255, Chemnitz, Germany 1998. Springer-Verlag.
5. D. DiPasquo. Using HTML formatting to aid in natural language processing on the World Wide Web 1998. Senior thesis, Computer Science Department, Carnegie Mellon University.
6. P. Domingos and M. Pazzani. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29: 103-130, 1997.
7. S. Džeroski and I. Bratko. Handling noise in inductive logic programming. In Proc. of the 2nd International Workshop on Inductive Logic Programming, pages 109-125, Tokyo, Japan, 1992.
8. A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant. A general lower bound on the number of examples needed for learning. Information and Computation, 82(3): 247-251, 1989.
9. B. Kijsirikul, M. Numao, and M. Shimura. Discrimination-based constructive induction of logic programs. In Proe. of the 10th National Conference on Artificial Intelligence, pages 44-49, San Jose, CA, 1992. AAAI Press.
10. D. D. Lewis and M. Ringuette. A comparison of two learning algorithms for text categorization. In Proc. of the 3rd Annual Symposium on Document Analysis and Information Retrieval, pages 81-93, 1994.
11. D. D. Lewis R. E. Schapire, J. P. Callan, and R. Papka. Training algorithms for linear classifiers. In Proe. of the 19th Annual International A CM-SIGIR Conference on Research and Development in Information Retrieval pages 298-306. Hartung-Gorre Verlag, 1996.
12. T. Mitchell. Machine Learning. McGraw Hill, 1997.
13. I. Moulinier, G. Rakinis, and J.-G. Ganascia. Text categorization: a symbolic approach. In Proe. of the 6th Annual Symposium on Document Analysis and Information Retrieval, 1996.
14. J. R. Quinlan and R. M. Cameron-Jones. FOIL: A midterm report. In Proe. of the 5th European Conference on Machine Learning, pages 3-20, Vienna, Austria, 1993. Springer-Verlag.
15. B. Richards and R. Mooney. Learning relations by pathfinding. In Proc. of the 10th National Conference on Artificial Intelligence, pages 50-55, San Jose, CA, 1992. AAAI Press.
16. C. J. van Rijsbergen. Information Retrieval, chapter 7. Butterworths, 1979.
17. Y. Yang and J. Pedersen. A comparative study on feature set selection in text categorization. In Proc. of the 10th International Conference on Machine Learning, pages 412-420, Nashville, TN, 1997. Morgan Kaufmann.