Sciweavers

5595 search results - page 94 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
HAIS
2009
Springer
15 years 9 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...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
15 years 11 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
15 years 11 months ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
AAAI
2007
15 years 7 months ago
COD: Online Temporal Clustering for Outbreak Detection
We present Cluster Onset Detection (COD), a novel algorithm to aid in detection of epidemic outbreaks. COD employs unsupervised learning techniques in an online setting to partiti...
Tomás Singliar, Denver Dash
ANNPR
2008
Springer
15 years 6 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi