Sciweavers

124 search results - page 9 / 25
» Iterative Feature Selection in Gaussian Mixture Clustering w...
Sort
View
ICIP
2002
IEEE
13 years 12 months ago
An iterative algorithm for context selection in adaptive entropy coders
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
Tong Jin, Jacques Vaisey
ICPR
2010
IEEE
13 years 4 months ago
Performance Evaluation of Automatic Feature Discovery Focused within Error Clusters
We report performance evaluation of our automatic feature discovery method on the publicly available Gisette dataset: a set of 29 features discovered by our method ranks 129 among...
Sui-Yu Wang, Henry S. Baird
ICML
2005
IEEE
14 years 7 months ago
Supervised dimensionality reduction using mixture models
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
Sajama, Alon Orlitsky
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 15 days ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Entropy and Memory Constrained Vector Quantization with Separability Based Feature Selection
An iterative model selection algorithm is proposed. The algorithm seeks relevant features and an optimal number of codewords (or codebook size) as part of the optimization. We use...
Sangho Yoon, Robert M. Gray