Unsupervised Feature Selection Technique Based on Genetic Algorithm for Improving the Text Clustering

被引:0
作者
Abualigah, Laith Mohammad [1 ]
Khader, Ahamad Tajudin [1 ]
Al-Betar, Mohammed Azmi [2 ]
机构
[1] Univ Sains Malaysia, Sch Comp Sci, George Town 11800, Malaysia
[2] Al Huson Univ Coll, Dept Informat Technol, Irbid, Jordan
来源
2016 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT) | 2016年
关键词
Unsupervised Feature Selection; Genetic Algorithm; K-mean Text Clustering; Informative features; Sparse features; DIMENSION REDUCTION;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The increasing amount of text documents in digital forms affect the text analysis techniques. Text clustering (TC) is one of the important techniques used for showing a massive amount of text documents by clusters. Hence, the main problem that affects the text clustering technique is the presence sparse and uninformative features on the text documents. The feature selection (FS) is an essential unsupervised learning technique. This technique is used to select informative features to improve the performance of text clustering algorithm. Recently, the meta-heuristic algorithms are successfully applied to solve several hard optimization problems. In this paper, we proposed the genetic algorithm (GA) to solve the unsupervised feature selection problem, namely, (FSGATC). This method is used to create a new subset of informative features in order to obtain more accurate clusters. Experiments were conducted using four benchmark text datasets with variant characteristics. The resuIts showed that the proposed FSGATC is improved the performance of the text clustering algorithm and got better results compared with k-mean clustering standalone. Finally, the proposed method "FSGATC" evaluated by F-measure and Accuracy, which are common measures used in the domain of text clustering.
引用
收藏
页数:6
相关论文
共 14 条
  • [1] [Anonymous], 2015, Int. J. Comp. Sci. Eng. Appl. (IJCSEA), DOI DOI 10.5121/IJCSEA.2015.5102
  • [2] Opposition chaotic fitness mutation based adaptive inertia weight BPSO for feature selection in text clustering
    Bharti, Kusum Kumari
    Singh, Pramod Kumar
    [J]. APPLIED SOFT COMPUTING, 2016, 43 : 20 - 34
  • [3] Hybrid dimension reduction by integrating feature selection with feature extraction method for text clustering
    Bharti, Kusum Kumari
    Singh, Pramod Kumar
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (06) : 3105 - 3114
  • [4] A three-stage unsupervised dimension reduction method for text clustering
    Bharti, Kusum Kumari
    Singh, P. K.
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2014, 5 (02) : 156 - 169
  • [5] Efficient stochastic algorithms for document clustering
    Forsati, Rana
    Mahdavi, Mehrdad
    Shamsfard, Mehrnoush
    Meybodi, Mohammad Reza
    [J]. INFORMATION SCIENCES, 2013, 220 : 269 - 291
  • [6] Holland JH., 1992, ADAPTATION NATURAL A, DOI [10.7551/mitpress/1090.001.0001, DOI 10.7551/MITPRESS/1090.001.0001]
  • [7] MacQueen, 1967, BERK S MATH STAT PRO, DOI DOI 10.1007/S11665-016-2173-6
  • [8] Mohamad M. S., 2004, P 1 INT S INF COMM T, P1
  • [9] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Shamsinejadbabki, Pirooz
    Saraee, Mohammad
    [J]. JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 38 (03) : 669 - 684
  • [10] Genetic algorithms in feature and instance selection
    Tsai, Chih-Fong
    Eberle, William
    Chu, Chi-Yuan
    [J]. KNOWLEDGE-BASED SYSTEMS, 2013, 39 : 240 - 247