IDEAS home Printed from https://ideas.repec.org/a/vrs/ijsiel/v9y2019i1p58-66n7.html
   My bibliography  Save this article

DBSCAN Algorithm for Document Clustering

Author

Listed:
  • Creţulescu Radu G.

    („Lucian Blaga” University of Sibiu, Engineering Faculty, Computer Science and Electrical and Electronics Engineering Department)

  • Morariu Daniel I.

    („Lucian Blaga” University of Sibiu, Engineering Faculty, Computer Science and Electrical and Electronics Engineering Department)

  • Breazu Macarie

    („Lucian Blaga” University of Sibiu, Engineering Faculty, Computer Science and Electrical and Electronics Engineering Department)

  • Volovici Daniel

    („Lucian Blaga” University of Sibiu, Engineering Faculty, Computer Science and Electrical and Electronics Engineering Department)

Abstract

Document clustering is a problem of automatically grouping similar document into categories based on some similarity metrics. Almost all available data, usually on the web, are unclassified so we need powerful clustering algorithms that work with these types of data. All common search engines return a list of pages relevant to the user query. This list needs to be generated fast and as correct as possible. For this type of problems, because the web pages are unclassified, we need powerful clustering algorithms. In this paper we present a clustering algorithm called DBSCAN – Density-Based Spatial Clustering of Applications with Noise – and its limitations on documents (or web pages) clustering. Documents are represented using the “bag-of-words” representation (word occurrence frequency). For this type o representation usually a lot of algorithms fail. In this paper we use Information Gain as feature selection method and evaluate the DBSCAN algorithm by its capacity to integrate in the clusters all the samples from the dataset.

Suggested Citation

  • Creţulescu Radu G. & Morariu Daniel I. & Breazu Macarie & Volovici Daniel, 2019. "DBSCAN Algorithm for Document Clustering," International Journal of Advanced Statistics and IT&C for Economics and Life Sciences, Sciendo, vol. 9(1), pages 58-66, June.
    • Handle: RePEc:vrs:ijsiel:v:9:y:2019:i:1:p:58-66:n:7
    DOI: 10.2478/ijasitels-2019-0007
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/ijasitels-2019-0007
    Download Restriction: no
    File URL: https://libkey.io/10.2478/ijasitels-2019-0007?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
    ---><---

    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:vrs:ijsiel:v:9:y:2019:i:1:p:58-66:n:7. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    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.