Abstract
Current ILP algorithms typically use variants and extensions of the greedy search. This prevents them to detect significant relationships between the training objects. Instead of myopic impurity functions, we propose the use of the heuristic based on RELIEF for guidance of ILP algorithms. At each step, in our ILP-R. system, tins heuristic is used to determine a beam of candidate literals. The beam is then used in an exhaustive search for a potentially good conjunction of literals. From the efficiency point of view we introduce interesting declarative bias which enables us to keep the growth of the training set, when introducing new variables, within linear bounds (linear with respect to the clause length). This bias prohibits cross-referencing of variables in variable dependency tree. The resulting system has been tested on various artificial problems. The advantages and deficiencies of our approach are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breiman L., Friedman.I.11. (Ashen R.A. St Stone C.J. (1984) Classification and Regression Trccs Wadsworth International Group.
Cestnik B. k Bratko I. (1991) On estimating probabilities in tree pruning, Proc. European Working Session on Learning, (Porto. March 1991 ), Y.Kodratoff (ed.), Springer Verlag. pp. 138–150.
Cestnik, B., Kononenko, I. k Bratko, I. (1987) ASSISTANT 86: A knowledge elicitation tool for sophisticated users. In: I. Bratko k N. Lavrac (eds.), Progress in Machine Learning. Wilmslow, England: Sigma Press.
Dzeroski S. (1991) Handling noise in inductive logic programming, M.SC. Thesis, University of Ljubljana, Faculty of electrical engineering k computer science, Ljubljana., Slovenia.
Kira K. k Rendell L. (1992a) A practical approach to feature selection, Proc. Intern. C’onf. on Machine Learning (Aberdeen, July 1992) D.Sleeman k P.Edwards (eds.). Morgan Kaufmann, pp.249–2.56.
Kira K. S.: Rendell L. (1992b) The feature selection problem: traditional methods and new algorithm. Proc. AAAI’92, San Jose, CA. July 1992.
Kononenko 1. (1994) Estimating attributes: Analysis and extensions of RELIEF. Proc. European C’onf. on Machine Learning (Catania, April 1991). L. De Raedt F.Bergadano (eds.). Springer Verlag. (in press)
Kononenko, I. k Bratko, I. (1991) Information based evaluation criterion for classifier’s performance. Machine Learning, 6: 67–80.
Kovacic M. (1994) Stochastic inductive logic programming. Ph.D. Thesis. University of Ljubljana, Faculty of electr. eng. k computer se., Ljubljana. Slovenia.
Kovacic, M.. Lavrac, N., Grobelnik, M., Zupanie. I)., Mladenic, D. (1992) Stochastic Search in Inductive Logic Programming. Proceedings of the tenth European Conference on Artificial Intelligence, Vienna, 1992.
Mladenie D. (1993) Combinatorial optimization in inductive concept learning. Proc. 10th Intern, C’onf. on,Machine Learning. (Amherst,.tune 1993). Morgan Kaufmann, pp. 205–211
Muggleton S. (ed.) (1992) Inductive Logic Programming. Academic Press.
U.Pompe, M.Kovacic R- I.Konouenko (1993) SFO1L: Stochastic approach to inductive logic programming. Proc. Sloivniorn (_’onf. on Electrical Login« ring and (`nnrputc r Science. Portorot, Slovenia. Sept. 1993, pp 189–192.
Quinlan R. (1986) Induction of decision trees,.1lachinc Lcorninq.
Quinlan R. (1990) Learning logical definitions from relations..)/arms n Liurnrnq. 5:239266.
Smyth P., Goodman R.M. k Higgins C. (1990) A hybrid Rule-based 13ayesian Classifier. Proc.European C’onf. on Artificial Intelligence, Stockholm. August. 1990, pp. 610-(i1:Ã.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Wien
About this paper
Cite this paper
Pompe, U., Kononenko, I. (1995). Linear Space Induction in First Order Logic with Relieff. In: Della Riccia, G., Kruse, R., Viertl, R. (eds) Proceedings of the ISSEK94 Workshop on Mathematical and Statistical Methods in Artificial Intelligence. International Centre for Mechanical Sciences, vol 363. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2690-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2690-5_13
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82713-0
Online ISBN: 978-3-7091-2690-5
eBook Packages: Springer Book Archive