Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A comparative study on ILP-based concept discovery systems
Date
2011-09-01
Author
Kavurucu, Yusuf
Karagöz, Pınar
Toroslu, İsmail Hakkı
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
160
views
0
downloads
Cite This
Inductive Logic Programming (ILP) studies learning from examples, within the framework provided by clausal logic. ILP has become a popular subject in the field of data mining due to its ability to discover patterns in relational domains. Several ILP-based concept discovery systems are developed which employs various search strategies, heuristics and language pattern limitations. LINUS, GOLEM, CIGOL, MIS, FOIL, PROGOL, ALEPH and WARMR are well-known ILP-based systems. In this work, firstly introductory information about ILP is given, and then the above-mentioned systems and an ILP-based concept discovery system called (CD)-D-2 are briefly described and the fundamentals of their mechanisms are demonstrated on a running example. Finally, a set of experimental results on real-world problems are presented in order to evaluate and compare the performance of the above-mentioned systems.
Subject Keywords
Progol
URI
https://hdl.handle.net/11511/32734
Journal
EXPERT SYSTEMS WITH APPLICATIONS
DOI
https://doi.org/10.1016/j.eswa.2011.03.038
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
A Theoretical Analysis of Feature Fusion in Stacked Generalization
Ozay, Mete; Yarman Vural, Fatoş Tunay (2009-04-11)
In the present work, a theoretical framework in order to define the general performance of stacked generalization learning algorithm is developed. Analytical relationships between the performance of the Stacked Generalization classifier relative to the individual classifiers are constructed by the proposed theorems and the practical techniques are developed in order to optimize the performance of stacked generalization algorithm based on these relationships.
Using Criticalities as a Heuristic for Answer Set Programming
SABUNCU, ORKUNT; Alpaslan, Ferda Nur; AKMAN, VAROL (2004-01-08)
Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of the system. A new heuristic for answer s...
A Comparative Study on Feature Selection based Improvement of Medium-Term Demand Forecast Accuracy
Ilseven, Engin; Göl, Murat (2019-01-01)
Use of the proper demand forecasting method and data set is very important for reliable system operation and planning. In this study, we compare performances of various feature selection method forecasting algorithm pairs in terms of forecast accuracy for medium-term demand forecasting case. We utilize correlation, recursive feature elimination, random forest, multivariate adaptive regression splines (MARS), stepwise regression and genetic algorithms as feature selection methods. As for forecasting algorith...
An evaluation of aspect oriented programming for embedded real-time systems
Kartal, Yusuf Bora; Schmidt, Şenan Ece (2007-12-01)
Crosscutting concerns are the issues in object- oriented programming (OOP) that cannot be modularized within a software module. In this paper, an experimental evaluation of the use of aspect-oriented programming (AOP) for the implementation of crosscutting concerns in embedded real-time systems is presented. The crosscutting functionality of the project under study is realized both by employing OOP and AOP techniques to make a comparison between the two programming paradigms. These two implementations are e...
A visual interactive approach for scenario-based stochastic multi-objective problems and an application
Balibek, E.; Köksalan, Mustafa Murat (2012-12-01)
In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decis...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Y. Kavurucu, P. Karagöz, and İ. H. Toroslu, “A comparative study on ILP-based concept discovery systems,”
EXPERT SYSTEMS WITH APPLICATIONS
, pp. 11598–11607, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32734.