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
Improving the efficiency of graph-based concept discovery systems
Download
index.pdf
Date
2014
Author
Abay, Nazmiye Ceren
Metadata
Show full item record
Item Usage Stats
300
views
104
downloads
Cite This
Concept discovery is a process for finding hidden relations from the given set of experiences named as background knowledge [27]. Concept discovery problems are investigated under Inductive Logic Programming (ILP)-based approaches and graph-based approaches [28]. Although ILP-based systems dominate the area, these systems have some problems such as local maxima and local plateaus [15]. Recently, graph based system becomes more popular due to its flexible structure, clear representation of data and ability of overcoming problems of ILP-based systems. Graph based approaches can be classified into two parts defined as structure-based approaches and path-finding approaches according to their methods they use for discovering concepts. The proposed approach can be classified as a combination of both path-finding approaches and methods of association rule mining. It finds paths between the arguments of target instances for concept discovery from the given graph. In addition to path-finding from given graph, association rule mining techniques are used for pruning based on support and confidence. The proposed method is different from the other path-finding approaches because association rule mining techniques are used for reducing search space and finding frequent and strong concept definitions.
Subject Keywords
Logic programming.
,
Computer programming.
,
Relational databases.
,
Machine learning.
,
Data mining.
URI
http://etd.lib.metu.edu.tr/upload/12618287/index.pdf
https://hdl.handle.net/11511/24281
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Improving scalability and efficiency of ILP-based and graph-based concept discovery systems
Mutlu, Alev; Karagöz, Pınar; Department of Computer Engineering (2013)
Concept discovery is the problem of finding definitions of target relation in terms or other relation given as a background knowledge. Inductive Logic Programming (ILP)-based and graph-based approaches are two competitors in concept discovery problem. Although ILP-based systems have long dominated the area, graph-based systems have recently gained popularity as they overcome certain shortcomings of ILP-based systems. While having applications in numerous domains, ILP-based concept discovery systems still su...
Policy-based memoization for ILP-based concept discovery systems
Mutlu, Alev; Karagöz, Pınar (2016-02-01)
Inductive Programming Logic (ILP)-based concept discovery systems aim to find patterns that describe a target relation in terms of other relations provided as background knowledge. Such systems usually work within first order logic framework, build large search spaces, and have long running times. Memoization has widely been incorporated in concept discovery systems to improve their running times. One of the problems that memoization brings to such systems is the memory overhead which may be a bottleneck. I...
Improving the scalability of ILP-based multi-relational concept discovery system through parallelization
Mutlu, Ayşe Ceyda; Karagöz, Pınar; Kavurucu, Yusuf (2012-03-01)
Due to the increase in the amount of relational data that is being collected and the limitations of propositional problem definition in relational domains, multi-relational data mining has arisen to be able to extract patterns from relational data. In order to cope with intractably large search space and still to be able to generate high-quality patterns. ILP-based multi-relational data mining and concept discovery systems employ several search strategies and pattern limitations. Another direction to cope w...
Bergson’s method of intuition: towards a philosophy of life /
Koçkan, Zöhre; Çırakman, Elif; Department of Philosophy (2014)
The purpose of this study is to show how a possible philosophy of life can arise by following Bergson’s method of intuition and to make emphasis on how Bergson’s two fundamental notions (intuition and duration) are capable of grasping the flux of life. The scientific methods, static concepts and classical philosophy are not able to understand the flow of life. Throughout this study it is pointed out a possible philosophy that is able to grasp the flow and the evolution of life. For this aim, Bergson’s metho...
A Counting-Based Heuristic for ILP-Based Concept Discovery Systems
Mutlu, Alev; Karagöz, Pınar; Kavurucu, Yusuf (2013-09-13)
Concept discovery systems are concerned with learning definitions of a specific relation in terms of other relations provided as background knowledge. Although such systems have a history of more than 20 years and successful applications in various domains, they are still vulnerable to scalability and efficiency issues - mainly due to large search spaces they build. In this study we propose a heuristic to select a target instance that will lead to smaller search space without sacrificing the accuracy. The p...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
N. C. Abay, “Improving the efficiency of graph-based concept discovery systems,” M.S. - Master of Science, Middle East Technical University, 2014.