A tree-based approach for frequent pattern mining from uncertain data

CKS Leung, MAF Mateo, DA Brajczuk - … and Data Mining: 12th Pacific-Asia …, 2008 - Springer
Many frequent pattern mining algorithms find patterns from traditional transaction databases,
in which the content of each transaction—namely, items—is definitely known and precise …

Mining uncertain data

CKS Leung - Wiley Interdisciplinary Reviews: Data Mining and …, 2011 - Wiley Online Library
As an important data mining and knowledge discovery task, association rule mining
searches for implicit, previously unknown, and potentially useful pieces of information—in …

DSTree: a tree structure for the mining of frequent sets from data streams

CKS Leung, QI Khan - … Conference on Data Mining (ICDM'06), 2006 - ieeexplore.ieee.org
With advances in technology, a flood of data can be produced in many applications such as
sensor networks and Web click streams. This calls for efficient techniques for extracting …

CanTree: a canonical-order tree for incremental frequent-pattern mining

CKS Leung, QI Khan, Z Li, T Hoque - Knowledge and Information Systems, 2007 - Springer
Since its introduction, frequent-pattern mining has been the subject of numerous studies,
including incremental updating. Many existing incremental mining algorithms are Apriori …

Efficient single-pass frequent pattern mining using a prefix-tree

SK Tanbeer, CF Ahmed, BS Jeong, YK Lee - Information Sciences, 2009 - Elsevier
The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern
mining because it can dramatically improve performance compared to the candidate …

Mining frequent itemsets without support threshold: with and without item constraints

YL Cheung, AWC Fu - IEEE Transactions on Knowledge and …, 2004 - ieeexplore.ieee.org
In classical association rules mining, a minimum support threshold is assumed to be
available for mining frequent itemsets. However, setting such a threshold is typically hard …

Dualminer: A dual-pruning algorithm for itemsets with constraints

C Bucila, J Gehrke, D Kifer, W White - Proceedings of the eighth ACM …, 2002 - dl.acm.org
Constraint-based mining of itemsets for questions such as" find all frequent itemsets where
the total price is at least $50" has received much attention recently. Two classes of …

CanTree: a tree structure for efficient incremental mining of frequent patterns

CKS Leung, QI Khan, T Hoque - Fifth IEEE International …, 2005 - ieeexplore.ieee.org
Since its introduction, frequent-pattern mining has been the subject of numerous studies,
including incremental updating. Many existing incremental mining algorithms are Apriori …

Efficient mining of frequent patterns from uncertain data

CKS Leung, CL Carmichael… - Seventh IEEE International …, 2007 - ieeexplore.ieee.org
Since its introduction, mining of frequent patterns has been the subject of numerous studies.
Generally, they focus on improving algorithmic efficiency for finding frequent patterns or on …

Exploiting anti-monotonic constraints in mining palindromic motifs from big genomic data

OA Sarumi, CK Leung - … conference on big data (Big Data), 2019 - ieeexplore.ieee.org
The advent of high-throughput technologies such as Illumina HiSeq X, mass spectrometry,
and microarray heralds a new era of big biological datasets in computational biology. This …