Sciweavers

627 search results - page 42 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
ICML
2009
IEEE
16 years 3 days ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ER
2007
Springer
99views Database» more  ER 2007»
15 years 5 months ago
Capturing Users' Everyday, Implicit Information Integration Decisions
Integration of large databases by expert teams is only a small part of the data integration activities that take place. Users without data integration expertise very often gather,...
David W. Archer, Lois M. L. Delcambre
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 20 days ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
15 years 3 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer
97
Voted
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
15 years 11 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic