6484 search results - page 949 / 1297 » Physical Database Design |
178
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
213
Voted
KDD
2004
ACM
16 years 7 months ago
2004
ACM
"Inside information" comes in many forms: knowledge of a corporate takeover, a terrorist attack, unexpectedly poor earnings, the FDA's acceptance of a new drug, etc...
158
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
201
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
179
Voted
KDD
2003
ACM
16 years 7 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...