论文信息 - Graph-Based Concept Learning

Graph-Based Concept Learning

We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, and the Subdue system. We then prcsent our new system SubdueCL and finally we show some preliminary results of a comparison of SubducCL with the two Inductive Logic Programming (ILP) systems Foil and Progol.

Lawrence B. Holder | Diane J. Cook | Jesus A. Gonzalez

[1] Lawrence B. Holder,et al. Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[2] Jorma Rissanen,et al. Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[3] Richard Nock,et al. PAC Learning Conceptual Graphs , 1998, ICCS.

[4] John F. Sowa,et al. Conceptual graphs summary , 1992 .

[5] R. Mike Cameron-Jones,et al. FOIL: A Midterm Report , 1993, ECML.

[6] Lawrence B. Holder,et al. Scalable Discovery of Informative Structural Concepts Using Domain Knowledge , 1996, IEEE Expert.

[7] Leslie G. Valiant,et al. Learning Disjunction of Conjunctions , 1985, IJCAI.

[8] Jean Sallantin,et al. Structural Machine Learning with Galois Lattice and Graphs , 1998, ICML.

[9] R. Mike Cameron-Jones,et al. Efficient top-down induction of logic programs , 1994, SGAR.

[10] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .