This Article 
 Bibliographic References 
 Add to: 
2009 WRI World Congress on Computer Science and Information Engineering
Confidence-Based Concept Discovery in Relational Databases
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu, "Confidence-Based Concept Discovery in Relational Databases," csie, vol. 4, pp.282-286, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.