Sciweavers

13414 search results - page 2451 / 2683
» The distributed boosting algorithm
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 7 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
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
16 years 7 months ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 7 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
KDD
2001
ACM
142views Data Mining» more  KDD 2001»
16 years 7 months ago
TreeDT: gene mapping by tree disequilibrium test
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
Petteri Sevon, Hannu Toivonen, Vesa Ollikainen
« Prev « First page 2451 / 2683 Last » Next »