科研之友
微信
新浪微博
Facebook
分享链接
摘要
An iterative sIB algorithm based on simulated annealing is proposed in this paper, which improves the efficiency and accuracy of the sIB algorithm. First, this algorithm chooses some positions randomly from the initial solution vector of a basic sIB algorithm, then randomly changes their corresponding clustering labels and optimizes them during an annealing processing. Experimental results on the benchmark data sets demonstrate that the proposed SA-sIB algorithm outperforms the sIB algorithm on both accuracy and efficiency.
- 出版日期2010
- 单位东莞理工学院
