Sciweavers

9886 search results - page 56 / 1978
» Learning Compressible Models
Sort
View
AUSAI
2007
Springer
15 years 4 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
IJCNN
2007
IEEE
15 years 4 months ago
A Novel Weighted LBG Algorithm for Neural Spike Compression
Abstract— In this paper, we present a weighted Linde-BuzoGray algorithm (WLBG) as a powerful and efficient technique for compressing neural spike data. We compare this technique...
Sudhir Rao, António R. C. Paiva, Jose C. Pr...
ECML
2006
Springer
15 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
FLAIRS
2008
15 years 4 days ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 4 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport