A Novel Dynamic Data Mining Approach Based on Large Itemsets

被引:0
|
作者
Chen, Shiqing [1 ]
Tang, Zhihang [1 ]
机构
[1] Hunan Inst Engn, Dept Comp Sci, Xiangtan 411104, Peoples R China
关键词
data mining; large itemsets; Apriori-like; dynamic approach;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
Business information received from advanced data analysis and data mining is a critical success factor for companies wishing to maximize competitive advantage. The use of traditional tools and techniques to discover knowledge is ruthless and does not give the right information at the right time. Data mining should provide tactical insights to support the strategic directions. In this paper, we introduce a dynamic approach that uses knowledge discovered in previous episodes. The proposed approach is shown to be effective for solving problems related to the efficiency of handling database updates, accuracy of data mining results, gaining more knowledge and interpretation of the results, and performance. Our results do not depend on the approach used to generate itemsets. In our analysis, we have used an Apriori-like approach as a local procedure to generate large itemsets. We prove that the Dynamic Data Mining algorithm is correct and complete.
引用
收藏
页码:81 / 86
页数:6
相关论文
共 50 条
  • [21] Towards a new approach for mining frequent itemsets on data stream
    Raissi, Chedy
    Poncelet, Pascal
    Teisseire, Maguelonne
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2007, 28 (01) : 23 - 36
  • [22] Association Rule Mining: A Graph Based Approach for Mining Frequent Itemsets
    Tiwari, Vivek
    Tiwari, Vipin
    Gupta, Shailendra
    Tiwari, Renu
    2010 INTERNATIONAL CONFERENCE ON NETWORKING AND INFORMATION TECHNOLOGY (ICNIT 2010), 2010, : 309 - 313
  • [23] Cluster Based Partition Approach for Mining Frequent Itemsets
    Tiwari, Akhilesh
    Gupta, Rajendra K.
    Agrawal, Dev Prakash
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (06): : 191 - 199
  • [24] Mining maximal frequent itemsets by a boolean based approach
    Salleb, A
    Maazouzi, Z
    Vrain, C
    ECAI 2002: 15TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 77 : 385 - 389
  • [25] A Novel Parallel Algorithm for Frequent Itemsets Mining in Large Transactional Databases
    Huan Phan
    Bac Le
    ADVANCES IN DATA MINING: APPLICATIONS AND THEORETICAL ASPECTS (ICDM 2018), 2018, 10933 : 272 - 287
  • [26] ODscan: On-demand database scan approach to mining large itemsets
    Alsabbagh, JR
    IKE'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2, 2003, : 154 - 159
  • [27] ACODF: a novel data clustering approach for data mining in large databases
    Tsai, CF
    Tsai, CW
    Wu, HC
    Yang, T
    JOURNAL OF SYSTEMS AND SOFTWARE, 2004, 73 (01) : 133 - 145
  • [28] Mining Productive Itemsets in Dynamic Databases
    Li, Xiang
    Li, Jiaxuan
    Fournier-Viger, Philippe
    Nawaz, M. Saqib
    Yao, Jie
    Lin, Jerry Chun-Wei
    IEEE ACCESS, 2020, 8 : 140122 - 140144
  • [29] Mining Perfectly Rare Itemsets on Big Data: An Approach Based on Apriori-Inverse and MapReduce
    Padillo, F.
    Luna, J. M.
    Ventura, S.
    INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016), 2017, 557 : 508 - 518
  • [30] A Novel Approach for Finding Frequent Itemsets in Data Stream
    Chandra, B.
    Bhaskar, Shalini
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2013, 28 (03) : 217 - 241