Sciweavers

1161 search results - page 47 / 233
» Approximation schemes for clustering problems
Sort
View

Publication
334views
15 years 6 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis
ADCM
2007
104views more  ADCM 2007»
14 years 9 months ago
Shape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
Paolo Costantini, Francesca Pelosi
HAIS
2009
Springer
15 years 2 months ago
Automatic Clustering Using a Synergy of Genetic Algorithm and Multi-objective Differential Evolution
— This paper applies the Differential Evolution (DE) and Genetic Algorithm (GA) to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It com...
Debarati Kundu, Kaushik Suresh, Sayan Ghosh, Swaga...
NIPS
2008
14 years 11 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
SIAMDM
2000
159views more  SIAMDM 2000»
14 years 9 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer