1420 search results - page 127 / 284 » Cluster Ensemble Selection |
83
Voted
CEC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—In the commonly used DE/rand/1 variant of differential evolution the primary mechanism of generating new solutions is the perturbation of a randomly selected point by a ...
115
click to vote
UAI
2008
15 years 2 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
ITNG
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, the bottleneck problem in PRMC-based wireless sensor networks is studied. This problem can be solved by overlapping neighboring layers. By this way, more cluster he...
114
Voted
AICCSA
2001
IEEE
15 years 4 months ago
2001
IEEE
In this paper, we propose a new version of the topological maps algorithm, which has been used to cluster web site visitors. These are characterized by partially redundant variabl...
111
click to vote
SIMPRA
2008
15 years 21 days ago
2008
In this work we try to draw an interdisciplinary framework aimed to integrate a socio-cognitive approach with organizational research about industrial clusters, in order to invest...