IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v270y2015icp13-24.html
   My bibliography  Save this article

Web page classification based on a simplified swarm optimization

Author

Listed:
  • Lee, Ji-Hyun
  • Yeh, Wei-Chang
  • Chuang, Mei-Chi

Abstract

Owing to the incredible increase in the amount of information on the World Wide Web, there is a strong need for an efficient web page classification to retrieve useful information quickly. In this paper, we propose a novel simplified swarm optimization (SSO) to learn the best weights for every feature in the training dataset and adopt the best weights to classify the new web pages in the testing dataset. Moreover, the parameter settings play an important role in the update mechanism of the SSO so that we utilize a Taguchi method to determine the parameter settings. In order to demonstrate the effectiveness of the algorithm, we compare its performance with that of the well-known genetic algorithm (GA), Bayesian classifier, and K-nearest neighbor (KNN) classifiers according to four datasets. The experimental results indicate that the SSO yields better performance than the other three approaches.

Suggested Citation

  • Lee, Ji-Hyun & Yeh, Wei-Chang & Chuang, Mei-Chi, 2015. "Web page classification based on a simplified swarm optimization," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 13-24.
    • Handle: RePEc:eee:apmaco:v:270:y:2015:i:c:p:13-24
    DOI: 10.1016/j.amc.2015.07.120
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315010425
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.07.120?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wei-Chang Yeh & Yunzhi Jiang & Yee-Fen Chen & Zhe Chen, 2016. "A New Soft Computing Method for K-Harmonic Means Clustering," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-14, November.
    2. Ziyun Deng & Tingqin He, 2018. "A Method for Filtering Pages by Similarity Degree based on Dynamic Programming," Future Internet, MDPI, vol. 10(12), pages 1-12, December.
    3. Goran Matošević & Jasminka Dobša & Dunja Mladenić, 2021. "Using Machine Learning for Web Page Classification in Search Engine Optimization," Future Internet, MDPI, vol. 13(1), pages 1-20, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:270:y:2015:i:c:p:13-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.