You are being redirected because this document is part of your ASTM Compass® subscription.
    This document is part of your ASTM Compass® subscription.

    Volume 47, Issue 6 (November 2019)

    Special Issue Paper

    Link-Based Clustering Algorithm for Clustering Web Documents

    (Received 14 July 2018; accepted 30 November 2018)

    Published Online: 2019

    CODEN: JTEVAB

      Format Pages Price  
    PDF (883.72 KB) 12 $25   ADD TO CART

    Cite this document

    X Add email address send
    X
      .RIS For RefWorks, EndNote, ProCite, Reference Manager, Zoteo, and many others.   .DOCX For Microsoft Word



    Abstract

    Clustering web documents involves the use of a large amount of words to be inputted to clustering algorithms such as K-Means, Cosine Similarity, Latent Discelet Allocation, and so on. This causes the clustering process to consume much time as the number of words in each document increases. In many web documents, web links are available along with the contents; these web link texts may contain a tremendous amount of information for clustering. In our work, we show that just using the web link text alone gives better clustering efficiency than considering the whole document text. We implemented our algorithm with two benchmark datasets, and the results show that the clustering efficiency is increased by our algorithm more than the existing methods.

    Author Information:

    Ashokkumar, P.
    School of Computer Science and Engineering, Vellore, Tamil Nadu

    Don, S.
    TIFAC CORE in Automotive Infotronics, School of Computer Science and Engineering, Vellore, Tamil Nadu


    Stock #: JTE20180497

    ISSN:0090-3973

    DOI: 10.1520/JTE20180497

    Author
    Title Link-Based Clustering Algorithm for Clustering Web Documents
    Symposium ,
    Committee G03