Sciweavers

8825 search results - page 1410 / 1765
» All for one or one for all
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 1 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 1 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 1 months ago
Predicting customer shopping lists from point-of-sale purchase data
This paper describes a prototype that predicts the shopping lists for customers in a retail store. The shopping list prediction is one aspect of a larger system we have developed ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 1 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 1 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
« Prev « First page 1410 / 1765 Last » Next »