Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    APSCAN: A parameter free algorithm for clustering

    Access Status
    Fulltext not available
    Authors
    Chen, Xiaoming
    Liu, Wan-quan
    Huining, Q.
    Lai, J.
    Date
    2011
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Chen, Xiaoming and Liu, Wanquan and Huining, Qiu and Lai, Jianhuang. 2011. APSCAN: A parameter free algorithm for clustering. Pattern Recognition Letters. 32 (7): pp. 973-986.
    Source Title
    Pattern Recognition Letters
    DOI
    10.1016/j.patrec.2011.02.001
    ISSN
    0010-4469
    School
    Department of Computing
    URI
    http://hdl.handle.net/20.500.11937/26657
    Collection
    • Curtin Research Publications
    Abstract

    DBSCAN is a density based clustering algorithm and its effectiveness for spatial datasets has been demonstrated in the existing literature. However, there are two distinct drawbacks for DBSCAN: (i) the performances of clustering depend on two specified parameters. One is the maximum radius of a neighborhood and the other is the minimum number of the data points contained in such neighborhood. In fact these two specified parameters define a single density. Nevertheless, without enough prior knowledge, these two parameters are difficult to be determined; (ii) with these two parameters for a single density, DBSCAN does not perform well to datasets with varying densities. The above two issues bring some difficulties in applications. To address these two problems in a systematic way, in this paper we propose a novel parameter free clustering algorithm named as APSCAN. Firstly, we utilize the Affinity Propagation (AP) algorithm to detect local densities for a dataset and generate a normalized density list. Secondly, we combine the first pair of density parameters with any other pair of density parameters in the normalized density list as input parameters for a proposed DDBSCAN (Double-Density-Based SCAN) to produce a set of clustering results. In this way, we can obtain different clustering results with varying density parameters derived from the normalized density list. Thirdly, we develop an updated rule for the results obtained by implementing the DDBSCAN with different input parameters and then synthesize these clustering results into a final result. The proposed APSCAN has two advantages: first it does not need to predefine the two parameters as required in DBSCAN and second, it not only can cluster datasets with varying densities but also preserve the nonlinear data structure for such datasets.

    Related items

    Showing items related by title, author, creator and subject.

    • DBCAMM: A novel density based clustering algorithm via using the Mahalanobis metric
      Ren, Yan; Xiaodong, Liu; Liu, Wan-Quan (2012)
      In this paper we propose a new density based clustering algorithm via using the Mahalanobis metric. This is motivated by the current state-of-the-art density clustering algorithm DBSCAN and some fuzzy clustering algorithms. ...
    • Techniques for improving clustering and association rules mining from very large transactional databases
      Li, Yanrong (2009)
      Clustering and association rules mining are two core data mining tasks that have been actively studied by data mining community for nearly two decades. Though many clustering and association rules mining algorithms have ...
    • Efficiently mining frequent patterns from dense datasets using a cluster of computers
      Rudra, Amit; Gopalan, Raj; Sucahyo, Yudho (2003)
      Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we present an algorithm for finding complete ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.