Sciweavers

2825 search results - page 261 / 565
» Robust Feature Selection Algorithms
Sort
View
MP
2002
176views more  MP 2002»
15 years 6 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
PAMI
2008
135views more  PAMI 2008»
15 years 6 months ago
MultiK-MHKS: A Novel Multiple Kernel Learning Algorithm
In this paper, we develop a new effective multiple kernel learning algorithm. First, we map the input data into m different feature spaces by m empirical kernels, where each genera...
Zhe Wang, Songcan Chen, Tingkai Sun
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
KDD
2002
ACM
106views Data Mining» more  KDD 2002»
16 years 7 months ago
Selecting the right interestingness measure for association patterns
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as...
Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava
JSW
2008
136views more  JSW 2008»
15 years 6 months ago
Collaborative Product Configuration: Formalization and Efficient Algorithms for Dependency Analysis
- In the Software Product Line approach, product configuration is a key activity in which stakeholders choose features for a product. This activity is critical in the sense that ca...
Marcílio Mendonça, Donald D. Cowan, ...