Volume 7 Number 5 (May. 2012)
Home > Archive > 2012 > Volume 7 Number 5 (May. 2012) >
JSW 2012 Vol.7(5): 1094-1098 ISSN: 1796-217X
doi: 10.4304/jsw.7.5.1094-1098

A New Text Clustering Method Based on KGA

ZhanGang Hao

Shandong Institute of Business and Technology, Yantai ,China

Abstract—Text clustering is one of the key research areas in data mining. K-medoids is a classical partitioning algorithm, which can better solve the isolated point problem, but it often converges to local optimization. In this paper, we put forward a new genetic algorithm called KGA algorithm by putting k-medoids into the genetic algorithm, then we form a local Optimal Solution with multiple initial species group, strategy for crossover within a species group and crossover among species groups, using the mutation threshold to control mutation. This algorithm will increase the diversity of species group and enhance the optimization capability of genetic algorithm, thus improve the accuracy of clustering and the capacity of acquiring isolated points.

Index Terms—Text clustering, K-medoids algorithm, genetic algorithm

[PDF]

Cite: ZhanGang Hao, "A New Text Clustering Method Based on KGA," Journal of Software vol. 7, no. 5, pp. 1094-1098, 2012.

General Information

  • ISSN: 1796-217X (Online)

  • Abbreviated Title: J. Softw.

  • Frequency:  Quarterly

  • APC: 500USD

  • DOI: 10.17706/JSW

  • Editor-in-Chief: Prof. Antanas Verikas

  • Executive Editor: Ms. Cecilia Xie

  • Abstracting/ Indexing: DBLP, EBSCO,
           CNKIGoogle Scholar, ProQuest,
           INSPEC(IET), ULRICH's Periodicals
           Directory, WorldCat, etc

  • E-mail: jsweditorialoffice@gmail.com

  • Oct 22, 2024 News!

    Vol 19, No 3 has been published with online version   [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Apr 01, 2024 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Apr 01, 2024 News!

    Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP   [Click]

  • Jun 12, 2024 News!

    Vol 19, No 2 has been published with online version   [Click]