Sciweavers

388 search results - page 20 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 8 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
DMIN
2006
137views Data Mining» more  DMIN 2006»
13 years 9 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
DAWAK
2006
Springer
13 years 9 months ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 10 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 8 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee