Abstract
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we show how we can exploit the links between objects in multi-relational data to help a first-order rule learning system direct the search by explicitly traversing these links to find paths between variables of interest. Our contributions are twofold: (i) we extend the pathfinding algorithm by Richards and Mooney [12] to make use of mode declarations, which specify the mode of call (input or output) for predicate variables, and (ii) we apply our extended path finding algorithm to saturated bottom clauses, which anchor one end of the search space, allowing us to make use of background knowledge used to build the saturated clause to further direct search. Experimental results on a medium-sized dataset show that path finding allows one to consider interesting clauses that would not easily be found by Aleph.
Chapter PDF
Similar content being viewed by others
References
Ausiello, G., Giaccio, R., Italiano, G., Nanni, U.: Optimal traversal of directed hypergraphs. Technical report, Dipartimento di Informatica e Sistemistica, Universit di Roma La Sapienza (1997)
Chakrabarti, S.: Mining the Web. Morgan Kaufmann, San Francisco (2002)
Cook, D., Holder, L.: Graph-based data mining. IEEE Intelligent Systems 15, 32–41 (2000)
Davis, J., Dutra, I., Page, D., Costa, V.S.: Establishing identity equivalence in multi-relational domains. In: Proc. of Intelligence Analysis (2005)
Davis, J., Santos Costa, V., Ong, I., Page, D., Dutra, I.: Using bayesian classifiers to combine rules. In: 3rd Workshop on MRDM at KDD (2004)
Getoor, L.: Link mining: A new data mining challenge. SIGKDD Explorations 5, 84–89 (2003)
Jensen, D.: Prospective assessment of AI technologies for fraud detection: A case study. In: Working Papers of the AAAI 1997 Workshop on Artificial Intelligence Approaches to Fraud Detection and Risk Management (1997)
Muggleton, S.: Inverse entailment and Progol. New Generation Computing 13, 245–286 (1995)
Page, D., Craven, M.: Biological applications of multi-relational data mining. SIGKDD Explorations 5, 69–79 (2003)
Palmer, C., Gibbons, P., Faloutsos, C.: Anf: A fast and scalable tool for data mining in massive graphs. In: Proc. of ACM SIGKDD on Knowledge Discovery and Data Mining (2002)
Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21, 267–305 (1996)
Richards, B., Mooney, R.: Learning relations by pathfinding. In: National Conference on AI, pp. 50–55 (1992)
Richardson, M., Domingos, P.: Markov logic networks. Technical report, Dept. of Computer Science and Engineering, University of Washington, Seattle, WA (2004)
Rouveirol, C.: Flattening and saturation: Two representation changes for generalization. Machine Learning 14, 219–232 (1994)
Slattery, S., Craven, M.: Combining statistical and relational methods for learning in hypertext domains. In: Page, D.L. (ed.) ILP 1998. LNCS, vol. 1446, pp. 38–52. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ong, I.M., de Castro Dutra, I., Page, D., Costa, V.S. (2005). Mode Directed Path Finding. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds) Machine Learning: ECML 2005. ECML 2005. Lecture Notes in Computer Science(), vol 3720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564096_68
Download citation
DOI: https://doi.org/10.1007/11564096_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29243-2
Online ISBN: 978-3-540-31692-3
eBook Packages: Computer ScienceComputer Science (R0)