Sciweavers

95 search results - page 14 / 19
» Reduction Techniques for Instance-Based Learning Algorithms
Sort
View
NIPS
1997
14 years 11 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
ICASSP
2011
IEEE
14 years 1 months ago
Trading off communications bandwidth with accuracy in adaptive diffusion networks
In this paper, a novel algorithm for bandwidth reduction in adaptive distributed learning is introduced. We deal with diffusion networks, in which the nodes cooperate with each ot...
Symeon Chouvardas, Konstantinos Slavakis, Sergios ...
74
Voted
KBSE
2009
IEEE
15 years 4 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
ICML
2006
IEEE
15 years 10 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
COLT
2008
Springer
14 years 11 months ago
An Information Theoretic Framework for Multi-view Learning
In the multi-view learning paradigm, the input variable is partitioned into two different views X1 and X2 and there is a target variable Y of interest. The underlying assumption i...
Karthik Sridharan, Sham M. Kakade