Sciweavers

628 search results - page 122 / 126
» Selective association rule generation
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 4 days ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 1 days ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
15 years 12 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
DOCENG
2009
ACM
15 years 6 months ago
Deriving image-text document surrogates to optimize cognition
The representation of information collections needs to be optimized for human cognition. While documents often include rich visual components, collections, including personal coll...
Eunyee Koh, Andruid Kerne
CGO
2008
IEEE
15 years 6 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...