627 search results - page 35 / 126 » Privacy-Preserving k-NN for Small and Large Data Sets |
IJCAI
2003
15 years 20 days ago
2003
This paper investigates a new approach for training discriminant classifiers when only a small set of labeled data is available together with a large set of unlabeled data. This a...
116
click to vote
KDD
2012
ACM
13 years 1 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
KDD
1999
ACM
15 years 3 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
106
click to vote
ICANN
2001
Springer
15 years 3 months ago
2001
Springer
Support vector machines have gotten wide acceptance for their high generalization ability for real world applications. But the major drawback is slow training for classification p...
103
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...