The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 2, 2009
ISBN: 978-0-7695-3507-4
pp: 282-286
ABSTRACT
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 concept discovery method, namely Confidence-based Concept Discovery (C2D) by removing the dependence on order of target instances in the relational database. In this method, the generalization step of the basic algorithm of C2D is modified so that all possible frequent rules in Apriori lattice can be searched in an efficient manner. Moreover, this improved version directly finds transitive rules in the search space. A set of experiments is conducted to compare the performance of proposed method with the basic version in terms of support and confidence.
CITATION
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu, "Confidence-Based Concept Discovery in Relational Databases", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 282-286, doi:10.1109/CSIE.2009.267
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool