Ontology in association rules

被引:3
作者
Ferraz, Inhauma Neves [1 ]
Bicharra Garcia, Ana Cristina [2 ]
机构
[1] Univ Fed Fluminensem, Inst Comp, ADDLabs Act Documentat & Design, BR-24210340 Niteroi, RJ, Brazil
[2] Univ Fed Fluminensem, Inst Comp, BR-24210340 Niteroi, RJ, Brazil
来源
SPRINGERPLUS | 2013年 / 2卷
关键词
Data mining; Association rules; Ontology; Preprocessing; Post-processing; Pruning; KNOWLEDGE DISCOVERY;
D O I
10.1186/2193-1801-2-452
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Data mining has emerged to address the problem of transforming data into useful knowledge. Although most data mining techniques, such as the use of association rules, may substantially reduce the search effort over large data sets, often, the consequential outcomes surpass the amount of information humanly manageable. On the other hand, important association rules may be overlooked owing to the setting of the support threshold, which is a very subjective metric, but rooted in most data mining techniques. This paper presents a study on the effects, in terms of precision and recall, of using a data preparation technique, called SemPrune, which is built on domain ontology. SemPrune is intended for pre-and post-processing phases of data mining. Identifying generalization/specialization relations, as well as composition/decomposition relations, is the key to successfully applying SemPrune.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 27 条
  • [1] Agrawal R, 2000, P 20 INT C VER LARG
  • [2] [Anonymous], 2007, Ontology matching, DOI 10.1007/978-3-540-49612-0
  • [3] Berry MichaelJ., 1997, DATA MINING TECHNIQU
  • [4] Burkle P, 2006, THESIS U FEDERAL FLU
  • [5] Chen P, 2008, P FLAIRS C COC GROOV
  • [6] Collective Bargaining Review monthly publication, 1998, COLLECTIVE BARGAININ, P997
  • [7] D'Aquin M, 2012, WORKSH KNOWL DISC DA
  • [8] Fayyad U, 1996, AI MAG, V17, P37
  • [9] Ferraz I, 2008, THESIS U FEDERAL FLU
  • [10] Goethals B, 2005, 2005 SIAM INT C DAT