Mining negative generalized knowledge from relational databases

被引:6
|
作者
Wu, Yu-Ying [1 ]
Chen, Yen-Liang [2 ]
Chang, Ray-I [3 ]
机构
[1] Nanya Inst Technol, Dept Informat Management, Jhongli, Taiwan
[2] Natl Cent Univ, Dept Informat Management, Jhongli, Taiwan
[3] Natl Taiwan Univ, Dept Engn Sci & Ocean Engn, Taipei 10764, Taiwan
关键词
Data mining; Attribute-oriented induction; Negative pattern; Multiple-level mining; Generalized knowledge; ATTRIBUTE-ORIENTED INDUCTION; DISCOVERY; RULES; REDUCTION;
D O I
10.1016/j.knosys.2010.07.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attribute-oriented induction (AOI) is a useful data mining method for extracting generalized knowledge from relational data and users' background knowledge. Concept hierarchies can be integrated with the AOI method to induce multi-level generalized knowledge. However, the existing AOI approaches are only capable of mining positive knowledge from databases; thus, rare but important negative generalized knowledge that is unknown, unexpected, or contradictory to what the user believes, can be missed. In this study, we propose a global negative attribute-oriented induction (GNAOI) approach that can generate comprehensive and multiple-level negative generalized knowledge at the same time. Two pruning properties, the downward level closure property and the upward superset closure property, are employed to improve the efficiency of the algorithm, and a new interest measure, nim(cl), is exploited to measure the degree of the negative relation. Experiment results from a real-life dataset show that the proposed method is effective in finding global negative generalized knowledge. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:134 / 145
页数:12
相关论文
共 50 条
  • [31] Data mining and knowledge discovery in databases
    Fayyad, U
    Uthurusamy, R
    COMMUNICATIONS OF THE ACM, 1996, 39 (11) : 24 - 26
  • [32] GEFRED - A GENERALIZED-MODEL OF FUZZY RELATIONAL DATABASES
    MEDINA, JM
    VILA, MA
    PONS, O
    INFORMATION SCIENCES, 1994, 76 (1-2) : 87 - 109
  • [33] Data mining and knowledge discovery in databases: Implications for scientific databases
    Fayyad, U
    NINTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 1997, : 2 - 11
  • [34] From ontology to relational databases
    Gali, A
    Chen, CX
    Claypool, KT
    Uceda-Sosa, R
    CONCEPTUAL MODELING FOR ADVANCED APPLICATION DOMAINS, PROCEEDINGS, 2004, 3289 : 278 - 289
  • [35] Data mining from multiple heterogeneous relational databases using decision tree classification
    Mehenni, Tahar
    Moussaoui, Abdelouahab
    PATTERN RECOGNITION LETTERS, 2012, 33 (13) : 1768 - 1775
  • [36] A practical approach to knowledge representation and reasoning in relational databases
    Cheng, J
    Bell, DA
    Liu, WR
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1996, : 470 - 471
  • [37] Formalisms and tools for knowledge integration using relational databases
    Kluska-Nawarecka, Stanislawa
    Wilk-Kolodziejczyk, Dorota
    Regulski, Krzysztof
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8240 : 1 - 20
  • [38] KEYWORD SEARCH BASED ON KNOWLEDGE BASE IN RELATIONAL DATABASES
    Zhu, Liang
    Ji, Shen-Da
    Yang, Wen-Zhu
    Liu, Chun-Nian
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1528 - +
  • [39] Bottom-Up Association Rule Mining in Relational Databases
    Hasan M. Jamil
    Journal of Intelligent Information Systems, 2002, 19 : 191 - 206
  • [40] Implementation of a least fixpoint operator for fast mining of relational databases
    Jamil, HM
    2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2002, : 633 - 636