DocumentCode
1932659
Title
Solving DCMST Problem with Ant Algorithm
Author
Hou, Xiang-Dan ; Dong, Yong-Feng ; Liu, Hong-Pu ; Gu, Jun-hua
Author_Institution
Hebei Univ. of Technol., Tianjin
Volume
5
fYear
2007
fDate
19-22 Aug. 2007
Firstpage
2553
Lastpage
2556
Abstract
In this paper we propose to use a new ant algorithm to solve the degree-constrained minimum spanning tree (DCMST) problem, which is a NP problem. The new ant algorithm is different from the general ant algorithm and it is very suitable to solve the DCMST problem. The ability of the algorithm is tested and given encouraging results. Finally, because the problem of clustering analysis and DCMST is very similar, so we put this new method into solving clustering analysis, and gain the interesting result.
Keywords
optimisation; pattern clustering; trees (mathematics); NP problem; ant algorithm; clustering analysis; degree-constrained minimum spanning tree problem; Circuit synthesis; Clustering algorithms; Communication systems; Cybernetics; Heuristic algorithms; Machine learning; Machine learning algorithms; Pipelines; Testing; Tree graphs; Ant algorithm; Clustering; DCMST;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-0973-0
Electronic_ISBN
978-1-4244-0973-0
Type
conf
DOI
10.1109/ICMLC.2007.4370577
Filename
4370577
Link To Document