Sciweavers

11910 search results - page 1981 / 2382
» Online Learning Algorithms
Sort
View
JMLR
2012
13 years 10 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
16 years 8 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
CEC
2009
IEEE
16 years 2 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
16 years 2 months ago
Neural network ensembles for time series forecasting
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
Victor M. Landassuri-Moreno, John A. Bullinaria
« Prev « First page 1981 / 2382 Last » Next »