Sciweavers

5595 search results - page 452 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
GFKL
2005
Springer
101views Data Mining» more  GFKL 2005»
16 years 12 days ago
Discovering Communities in Linked Data by Multi-view Clustering
Abstract. We consider the problem of finding communities in large linked networks such as web structures or citation networks. We review similarity measures for linked objects and...
Isabel Drost, Steffen Bickel, Tobias Scheffer
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
PDP
2003
IEEE
16 years 5 days ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
IJKDB
2010
170views more  IJKDB 2010»
15 years 4 months ago
Clustering Genes Using Heterogeneous Data Sources
Clustering of gene expression data is a standard exploratory technique used to identify closely related genes. Many other sources of data are also likely to be of great assistance...
Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasim...
IRREGULAR
1995
Springer
15 years 10 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...