Sciweavers

164 search results - page 20 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
90
Voted
IJISTA
2008
95views more  IJISTA 2008»
14 years 9 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
MP
2008
103views more  MP 2008»
14 years 9 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
85
Voted
TEC
2008
109views more  TEC 2008»
14 years 9 months ago
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality...
Y. del Valle, Ganesh K. Venayagamoorthy, Salman Mo...
95
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 4 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
NIPS
2000
14 years 10 months ago
A Neural Probabilistic Language Model
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
Yoshua Bengio, Réjean Ducharme, Pascal Vinc...