Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Association rules over interval data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent tree-like patterns in large datasets
Data & Knowledge Engineering
Efficient Mining of Frequent Patterns from Uncertain Data
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Finding frequent items in probabilistic data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An information-theoretic approach to quantitative association rule mining
Knowledge and Information Systems
Clustering Uncertain Data Via K-Medoids
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Mining of Frequent Itemsets from Streams of Uncertain Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic frequent itemset mining in uncertain databases
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
COWES: Web user clustering based on evolutionary web sessions
Data & Knowledge Engineering
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A decremental approach for mining frequent itemsets from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Editorial: Acquiring knowledge from inconsistent data sources through weighting
Data & Knowledge Engineering
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Direct mining of discriminative patterns for classifying uncertain data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Associative classifier for uncertain data
WAIM'10 Proceedings of the 11th international conference on Web-age information management
A regression-based approach for mining user movement patterns from random sample data
Data & Knowledge Engineering
Approximation of Frequentness Probability of Itemsets in Uncertain Data
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
On probabilistic models for uncertain sequential pattern mining
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Mining quantitative association rules on overlapped intervals
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Efficient pattern mining of uncertain data with sampling
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Constrained frequent pattern mining on univariate uncertain data
Journal of Systems and Software
Discovering frequent itemsets on uncertain data: a systematic review
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
Stream mining on univariate uncertain data
Applied Intelligence
Efficient frequent pattern mining based on Linear Prefix tree
Knowledge-Based Systems
| Hi-index | 0.00 |
In this paper, we propose a new algorithm called U2P-Miner for mining frequent U2 patterns from univariate uncertain data, where each attribute in a transaction is associated with a quantitative interval and a probability density function. The algorithm is implemented in two phases. First, we construct a U2P-tree that compresses the information in the target database. Then, we use the U2P-tree to discover frequent U2 patterns. Potential frequent U2 patterns are derived by combining base intervals and verified by traversing the U2P-tree. We also develop two techniques to speed up the mining process. Since the proposed method is based on a tree-traversing strategy, it is both efficient and scalable. Our experimental results demonstrate that the U2P-Miner algorithm outperforms three widely used algorithms, namely, the modified Apriori, modified H-mine, and modified depth-first backtracking algorithms.