Sciweavers

1265 search results - page 211 / 253
» Finding the Key to a Synapse
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months 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...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
14 years 8 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
CHI
2005
ACM
14 years 8 months ago
Digital Family Portrait Field Trial: Support for Aging in Place
A growing social problem in the U.S., and elsewhere, is enabling older adults to continue living independently, as opposed to moving to an institutional care setting. One key part...
Jim Rowan, Elizabeth D. Mynatt
HPCA
2008
IEEE
14 years 8 months ago
Amdahl's Law in the multicore era
We apply Amdahl's Law to multicore chips using symmetric cores, asymmetric cores, and dynamic techniques that allows cores to work together on sequential execution. To Amdahl...
Mark D. Hill