Sciweavers

162 search results - page 12 / 33
» Parallel frequent set counting
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
AVI
2004
13 years 9 months ago
Usability studies on a visualisation for parallel display and control of alternative scenarios
Many applications require comparison between alternative scenarios; most support it poorly. A subjunctive interface supports comparison through its facilities for parallel setup, ...
Aran Lunzer, Kasper Hornbæk
SPAA
1997
ACM
13 years 11 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
LCPC
2009
Springer
14 years 5 days ago
Speculative Optimizations for Parallel Programs on Multicores
The advent of multicores presents a promising opportunity for exploiting fine grained parallelism present in programs. Programs parallelized in the above fashion, typically involv...
Vijay Nagarajan, Rajiv Gupta
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
13 years 11 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar