Sciweavers

873 search results - page 6 / 175
» Reducing the Frequent Pattern Set
Sort
View
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 9 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
FIMI
2003
84views Data Mining» more  FIMI 2003»
13 years 9 months ago
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
Takeaki Uno, Ken Satoh
CVPR
2012
IEEE
11 years 10 months ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
CIKM
2005
Springer
14 years 1 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
14 years 8 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...