Vertical Frequent Pattern Mining from Uncertain Data

被引:5
作者
Budhia, Bhavek P. [1 ]
Cuzzocrea, Alfredo [2 ]
Leung, Carson K. [1 ]
机构
[1] Univ Manitoba, Winnipeg, MB R3T 2N2, Canada
[2] Univ Calabria, ICAR CNR, Calabria, Italy
来源
ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS | 2012年 / 243卷
基金
加拿大自然科学与工程研究理事会;
关键词
Advanced knowledge-based systems; data mining; frequent itemsets; probabilistic databases; ITEMSETS;
D O I
10.3233/978-1-61499-105-2-1273
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many real-life advanced knowledge-based and intelligent information & engineering applications, data can be uncertain. This leads to the uncertain data mining. In recent years, Apriori-based, tree-based, and hyperlinked array structure based mining algorithms-namely, U-Apriori, UF-growth and CUF-growth, as well as UH-Mine, respectively-have been proposed to mine frequent patterns from probabilistic databases of uncertain data. All these algorithms treat the probabilistic databases "horizontally" as collections of transactions, and each transaction is considered as a set of items associated with existential probability values. In this paper, we consider an alternative representation (i.e., vertical format) of uncertain data such that the probabilistic databases can be viewed "vertically" as collections of items. Each item is associated with a vector that indicates the transactions containing such an item, and each vector entry is associated with an existential probability value. We also propose an advanced knowledge-based algorithm for discovering frequent patterns from this vertical representation of uncertain data.
引用
收藏
页码:1273 / 1282
页数:10
相关论文
共 18 条
[1]  
Aggarwal CC, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P29
[2]  
Agrawal R., VLDB 1994, P487
[3]  
Baralis E, 2011, LECT NOTES COMPUT SC, V6882, P515, DOI 10.1007/978-3-642-23863-5_53
[4]  
Bernecker T, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P119
[5]  
Calders T, 2010, LECT NOTES ARTIF INT, V6118, P480
[6]  
Chowdhury NK, 2011, LECT NOTES COMPUT SC, V6882, P355, DOI 10.1007/978-3-642-23863-5_36
[7]  
Chui CK, 2007, LECT NOTES COMPUT SC, V4426, P47
[8]  
Han JW, 2000, SIGMOD RECORD, V29, P1
[9]  
Leung C.K.-S., LNCS, V6862, P252
[10]  
Leung C.K.-S., ACM SAC 2011, P983