DocumentCode
1965967
Title
Multi-relational concept discovery with aggregation
Author
Kavurucu, Yusuf ; Senkul, Pinar ; Toroslu, I. Hakki
Author_Institution
Comput. Eng., Middle East Tech. Univ., Ankara, Turkey
fYear
2009
fDate
14-16 Sept. 2009
Firstpage
248
Lastpage
253
Abstract
Concept discovery aims at finding the rules that best describe the given target predicate (i.e., the concept). Aggregation information such as average, count, max, etc. are descriptive for the domains that an aggregated value takes part in the definition of the concept. Therefore, a concept discovery system needs aggregation capability in order to construct high quality rules (with high accuracy and coverage) for such domains. In this work, we describe a method for concept discovery with aggregation on an ILP-based concept discovery system, namely C2D-A. C2D-A extends C2D by considering all instances together and thus improves the generated rule´s quality. Together with this extension, aggregation handling mechanism is modified accordingly, leading to more accurate aggregate values, as well.
Keywords
data mining; relational databases; aggregation handling mechanism; aggregation information; multi-relational concept discovery; Aggregates; Algorithm design and analysis; Association rules; Data mining; Lattices; Learning systems; Logic programming; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Sciences, 2009. ISCIS 2009. 24th International Symposium on
Conference_Location
Guzelyurt
Print_ISBN
978-1-4244-5021-3
Electronic_ISBN
978-1-4244-5023-7
Type
conf
DOI
10.1109/ISCIS.2009.5291821
Filename
5291821
Link To Document