Mining Frequent Items in OLAP

被引：0
|
作者：
Jin, Ling [1 ]
Lim, Ji Yeon [1 ]
Kim, Iee Joon [1 ]
Cho, Kyung Soo [1 ]
Kim, Seung Kwan [1 ]
Kim, Ung Mo [1 ]
机构：
[1] Sungkyunkwan Univ, Database Lab, Suwon 440746, South Korea
来源：
SECURE AND TRUST COMPUTING, DATA MANAGEMENT, AND APPLICATIONS | 2011年 / 187卷
关键词：
OLAP; FP-tree; multidimensional data structure; data warehouse; data mining;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
On-line analytical (OLAP) is a data summarization and aggregation tool that helps simplify data analyzing where containing in the data warehouse. However, OLAP is some different with data mining tools, which discover the implicit patterns and interesting knowledge in large amount of databases. In this study, we propose to translate the frequent pattern tree structure into the 3-D multidimensional data structure. The frequent pattern tree is used for generating compact set of frequent patterns. so the 3-D multidimensional data structure, which is converted by FP-tree is only storage the frequent patterns. And then impart the multidimensional data structure into the OLAP tool to discover the interesting knowledge. The efficiency is in three aspects: (I) because the frequent pattern tree is mining the complete set of frequent patterns that helps only analyzing the meaningful patterns in data warehouse. (2) It integrates OLAP with data mining and mining knowledge in multidimensional databases.
引用
收藏
页码：25 / 30
页数：6
相关论文
共 50 条
  • [31] False-negative frequent items mining from data streams with bursting
    Chong, ZH
    Yu, JX
    Lu, HJ
    Zhang, ZJ
    Zhou, AY
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2005, 3453 : 422 - 434
  • [32] LCTree-Based Approach for Mining Frequent Items in Real-Time
    Chen, Jiashun
    Chen, Jianjing
    Zhong, Zhaoman
    Zhang, Hao
    Kantardzic, Mehmed
    [J]. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [33] Mining Frequent Fuzzy Grids in Dynamic Databases with Weighted Transactions and Weighted Items
    Subramanyam, R.
    Goswami, A.
    [J]. JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT, 2006, 5 (03) : 243 - 257
  • [34] An Algorithm of Constraint Frequent Neighboring Class Sets Mining Based on Separating Support Items
    Fang, Gang
    Xiong, Jiang
    Ying, Hong
    Zhao, Yong-jian
    [J]. ADVANCES IN SWARM INTELLIGENCE, PT II, 2011, 6729 : 157 - +
  • [35] An Algorithm for Mining Frequent Stream Data Items Using Hash Function and Fading Factor
    Mei, Qingling
    Chen, Ling
    [J]. MECHANICAL AND ELECTRONICS ENGINEERING III, PTS 1-5, 2012, 130-134 : 2661 - 2665
  • [36] Efficient Algorithms with Time Fading Model for Mining Frequent Items over Data Stream
    Tu, Li
    Chen, Ling
    Zhang, Shan
    [J]. 2009 INTERNATIONAL CONFERENCE ON INDUSTRIAL AND INFORMATION SYSTEMS, PROCEEDINGS, 2009, : 403 - +
  • [37] Mining frequent items and itemsets from distributed data streams for emergency detection and management
    Altomare, Albino
    Cesario, Eugenio
    Talia, Domenico
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2017, 8 (01) : 47 - 55
  • [38] Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases
    Ham Nguyen
    Nguyen Le
    Huong Bui
    Tuong Le
    [J]. Applied Intelligence, 2023, 53 : 19629 - 19646
  • [39] Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases
    Nguyen, Ham
    Le, Nguyen
    Bui, Huong
    Le, Tuong
    [J]. APPLIED INTELLIGENCE, 2023, 53 (16) : 19629 - 19646
  • [40] Mining frequent items and itemsets from distributed data streams for emergency detection and management
    Albino Altomare
    Eugenio Cesario
    Domenico Talia
    [J]. Journal of Ambient Intelligence and Humanized Computing, 2017, 8 : 47 - 55
12345