3791 search results - page 47 / 759 » Packing sets of patterns |
114
click to vote
KDD
2005
ACM
15 years 11 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
PAKDD
2009
ACM
15 years 8 months ago
2009
ACM
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
ICCD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a pinpoint test set relaxation method for test compression that maximally derives the capability of a run-length encoding technique such as Golomb coding or fr...
KDD
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
69
Voted
ICLP
1999
Springer
15 years 3 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...