Sciweavers

2280 search results - page 221 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 3 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
ICML
2010
IEEE
15 years 7 months ago
From Transformation-Based Dimensionality Reduction to Feature Selection
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
Mahdokht Masaeli, Glenn Fung, Jennifer G. Dy
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
SIGIR
2004
ACM
16 years 1 days ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
15 years 7 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski