Sciweavers

1314 search results - page 154 / 263
» Approximate data mining in very large relational data
Sort
View
SDM
2010
SIAM
129views Data Mining» more  SDM 2010»
15 years 9 days ago
Cross-Selling Optimization for Customized Promotion
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
Nan Li, Yinghui Yang, Xifeng Yan
124
Voted
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
15 years 9 days ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 4 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
CIKM
2008
Springer
15 years 3 months ago
Viability of in-house datamarting approaches for population genetics analysis of snp genotypes
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
Jorge Amigo, Christopher Phillips, Antonio Salas
ICML
1996
IEEE
16 years 2 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami