Sciweavers

1146 search results - page 163 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 6 months 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
2006
ACM
163views Data Mining» more  KDD 2006»
14 years 8 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
14 years 8 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...