Skip to main content
  • Book
  • © 2019

Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering

  • Presents a new method for solving the text document clustering problem and demonstrates that it can outperform other comparable methods
  • Covers the main text clustering preprocessing steps and the metaheuristics needed in order to deal with the text document clustering problems
  • Proposes methods that can be applied to a broad range of text documents (e.g. newsgroup documents appearing on newswires, Internet web pages, and hospital information), modern applications (technical reports and university data), and the biomedical sciences (large biomedical datasets)

Part of the book series: Studies in Computational Intelligence (SCI, volume 816)

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xxvii
  2. Introduction

    • Laith Mohammad Qasim Abualigah
    Pages 1-9
  3. Krill Herd Algorithm

    • Laith Mohammad Qasim Abualigah
    Pages 11-19
  4. Literature Review

    • Laith Mohammad Qasim Abualigah
    Pages 21-60
  5. Proposed Methodology

    • Laith Mohammad Qasim Abualigah
    Pages 61-103
  6. Experimental Results

    • Laith Mohammad Qasim Abualigah
    Pages 105-162
  7. Conclusion and Future Work

    • Laith Mohammad Qasim Abualigah
    Pages 163-165

About this book

This book puts forward a new method for solving the text document (TD) clustering problem, which is established in two main stages: (i) A new feature selection method based on a particle swarm optimization algorithm with a novel weighting scheme is proposed, as well as a detailed dimension reduction technique, in order to obtain a new subset of more informative features with low-dimensional space. This new subset is subsequently used to improve the performance of the text clustering (TC) algorithm and reduce its computation time. The k-mean clustering algorithm is used to evaluate the effectiveness of the obtained subsets. (ii) Four krill herd algorithms (KHAs), namely, the (a) basic KHA, (b) modified KHA, (c) hybrid KHA, and (d) multi-objective hybrid KHA, are proposed to solve the TC problem; each algorithm represents an incremental improvement on its predecessor. For the evaluation process, seven benchmark text datasets are used with different characterizations and complexities.

Text document (TD) clustering is a new trend in text mining in which the TDs are separated into several coherent clusters, where all documents in the same cluster are similar. The findings presented here confirm that the proposed methods and algorithms delivered the best results in comparison with other, similar methods to be found in the literature.

Reviews

“The book is well written, with high-quality tables and graphs. Each chapter ends with a collection of references, including the most recent work in the area. The book should be very useful for scholars who want to study the general field of text document clustering. It is also a good reference for those who work in text document clustering and use genetic algorithms.” (Xiannong Meng, ComputingReviews, May 10, 2019)


Authors and Affiliations

  • Universiti Sains Malaysia, Penang, Malaysia

    Laith Mohammad Qasim Abualigah

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access