125 search results - page 9 / 25 » A new clustering algorithm applying a hierarchical method ne... |
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
In this article we present an incremental method for building a mixture model. Given the desired number of clusters K ≥ 2, we start with a two-component mixture and we optimize t...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
ICIAP
1997
ACM
13 years 11 months ago
1997
ACM
A novel method for automatic segmentation of computed tomography CT head images of patients having spontaneous intracerebral brain hemorrhage has been presented in this work. The...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...