Improving the scalability of ILP-based multi-relational concept discovery system through parallelization

Date

2012-03-01

Author

Mutlu, Ayşe Ceyda
Karagöz, Pınar
Kavurucu, Yusuf

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

299
views

0
downloads

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 with the large search space is using parallelization. By parallel data mining, improvement in time efficiency and scalability can be provided without further limiting the language patterns. In this work, we describe a method for concept discovery with parallelization on an ILP-based concept discovery system. The non-parallel algorithm, namely Concept Rule Induction System (CRIS), is modified in such a way that the parts that involve high amount of query processing, which causes bottleneck, are reorganized in a data parallel way. The resulting algorithm is called, Parallel CRIS (pCRIS). A set of experiments is conducted in order to evaluate the performance of the proposed method.

Subject Keywords

Parallelization, Concept discovery, ILP, Time efficiency, Scalability, Confidence, Support, Multi-relational data mining

URI

https://hdl.handle.net/11511/57398

Journal

KNOWLEDGE-BASED SYSTEMS

DOI

https://doi.org/10.1016/j.knosys.2011.11.001

Collections

Department of Basic English, Article

Suggestions

OpenMETU
Core

Confidence-based concept discovery in multi-relational data mining Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (2008-03-21) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, a new ILP-based concept dis...
Confidence-based concept discovery in relational databases Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (2009-11-16) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, we improve an ILP-based con...
Aggregation in confidence-based concept discovery for multi-relational data mining Kavurucu, Yusuf; Senkul, Pinar; Toroslu, İsmail Hakkı (null; 2008-12-01) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, we describe a method for ge...
An ilp-based concept discovery system for multi-relational data mining Kavurucu, Yusuf; Karagöz, Pınar; Department of Computer Engineering (2009) Multi Relational Data Mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. However, as patterns involve multiple relations, the search space of possible hypothesis becomes intractably complex. In order to cope with this problem, several relational knowledge discovery systems have been developed employing various search strategies, heuristics and language pattern limitations. In this thesis, Induct...
A new hybrid multi-relational data mining technique Toprak, Seda Dağlar; Toroslu, İ. Hakkı; Department of Computer Engineering (2005) Multi-relational learning has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. As patterns involve multiple relations, the search space of possible hypotheses becomes intractably complex. Many relational knowledge discovery systems have been developed employing various search strategies, search heuristics and pattern language limitations in order to cope with the complexity of hypothesis space. In this w...

Citation Formats

A. C. Mutlu, P. Karagöz, and Y. Kavurucu, “Improving the scalability of ILP-based multi-relational concept discovery system through parallelization,” KNOWLEDGE-BASED SYSTEMS, pp. 352–368, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57398.