IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6393652.html
   My bibliography  Save this article

Fast Density Clustering Algorithm for Numerical Data and Categorical Data

Author

Listed:
  • Chen Jinyin
  • He Huihao
  • Chen Jungan
  • Yu Shanqing
  • Shi Zhaoxia

Abstract

Data objects with mixed numerical and categorical attributes are often dealt with in the real world. Most existing algorithms have limitations such as low clustering quality, cluster center determination difficulty, and initial parameter sensibility. A fast density clustering algorithm (FDCA) is put forward based on one-time scan with cluster centers automatically determined by center set algorithm (CSA). A novel data similarity metric is designed for clustering data including numerical attributes and categorical attributes. CSA is designed to choose cluster centers from data object automatically which overcome the cluster centers setting difficulty in most clustering algorithms. The performance of the proposed method is verified through a series of experiments on ten mixed data sets in comparison with several other clustering algorithms in terms of the clustering purity, the efficiency, and the time complexity.

Suggested Citation

  • Chen Jinyin & He Huihao & Chen Jungan & Yu Shanqing & Shi Zhaoxia, 2017. "Fast Density Clustering Algorithm for Numerical Data and Categorical Data," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-15, March.
  • Handle: RePEc:hin:jnlmpe:6393652
    DOI: 10.1155/2017/6393652
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/6393652.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/6393652.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/6393652?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6393652. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.