earticle

논문검색

A Text Clustering Algorithm based on Weeds and Differential Optimization

초록

영어

Invasive weed optimization (IWO) is a swarm optimization algorithm with both explorative and exploitive power where the diverisity of the population is obtained by allowing the reproduction and mutation of individuals with poor fitness .Differential optimization algorithm is a random parallel algorithm according to a vector change that can make individuals change toward outstanding individuals with global convergence. For k-means algorithm , the traditional algorirhm is prone to get stuck at local optimum and is sensitive to random initialization. Based on the aforementiond background a novel optimization algorithm based hybriding DE and IWO which denoted IWODE-KM is employed to optimize the parameters of k-means and is further applied to chinese text clustering. Experiment results shows that the proposed method outperforms both of its ancestors.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. IWO Algorithm
  2.2. DE Algorithm
  2.3. Text Technology
 3. IWODE-KM Text Clustering Algorithm
  3.1. Algorithm Description
  3.2. Fitness Function
  3.3. Coding Scheme
  3.4. IWODE-KM Algorithmic Process
 4. Experimental
  4.1. Text Processing
  4.2. Results Evaluation Methods
  4.3. Experimental Setup and the Results Analysis
 5. Conclusion
 References

저자정보

  • Lipeng YANG China Academy of Railway Science, Bejing, China
  • Fuzhang WANG China Academy of Railway Science, Bejing, China
  • Chunmei FAN China Rails Travel Technology, Co. Ltd.,Beijing, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.