2020 search results - page 112 / 404 » KDD Process Planning |
126
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
116
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
148
click to vote
KDD
2006
ACM
16 years 4 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...
124
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Many applications in text processing require significant human effort for either labeling large document collections (when learning statistical models) or extrapolating rules from...
114
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...