The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to solve a wide variety of discrete optimization problems. It is shown how objective function based clustering models such as hard and fuzzy c-means can be optimized using part
β¦ LIBER β¦
Clustering social networks using ant colony optimization
β Scribed by Mandala, Supreet Reddy; Kumara, Soundar R. T.; Rao, Calyampudi Radhakrishna; Albert, Reka
- Book ID
- 120426494
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 666 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1109-2858
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Ant colony optimization of clustering mo
β
Thomas A. Runkler
π
Article
π
2005
π
John Wiley and Sons
π
English
β 319 KB
Ant colony optimization for learning Bay
β
Luis M. de Campos; Juan M. FernΓ‘ndez-Luna; JosΓ© A. GΓ‘mez; JosΓ© M. Puerta
π
Article
π
2002
π
Elsevier Science
π
English
β 348 KB
One important approach to learning Bayesian networks (BNs) from data uses a scoring metric to evaluate the fitness of any given candidate network for the data base, and applies a search procedure to explore the set of candidate networks. The most usual search methods are greedy hill climbing, either
Learning Bayesian network classifiers us
β
Khalid M. Salama, Alex A. Freitas
π
Article
π
2013
π
Springer US
π
English
β 941 KB
Scalable platforms using ant colony opti
β
Rupesh Kumar; Venkat Allada
π
Article
π
2007
π
Springer US
π
English
β 300 KB
A new arrhythmia clustering technique ba
β
Mehmet KorΓΌrek; Ali Nizam
π
Article
π
2008
π
Elsevier Science
π
English
β 624 KB
A Multipath Routing Protocol Based on Cl
β
Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo
π
Article
π
2010
π
Molecular Diversity Preservation International
π
English
β 321 KB