116 search results - page 3 / 24 » On Computing Condensed Frequent Pattern Bases |
AUSAI
2003
Springer
13 years 11 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
ICCV
1998
IEEE
13 years 10 months ago
1998
IEEE
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
HPCC
2007
Springer
14 years 13 days ago
2007
Springer
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
IPPS
2006
IEEE
14 years 9 days ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...