455 search results - page 14 / 91 » On Trees and Noncrossing Partitions |
DAWAK
2004
Springer
14 years 1 months ago
2004
Springer
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
IPPS
2006
IEEE
14 years 1 months 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...