DNA approach to solve clustering problem based on a mutual order

Rohani Binti Abu Bakar, Junzo Watada, Witold Pedrycz

    研究成果: Article

    46 引用 (Scopus)

    抄録

    Clustering is regarded as a consortium of concepts and algorithms that are aimed at revealing a structure in highly dimensional data and arriving at a collection of meaningful relationships in data and information granules. The objective of this paper is to propose a DNA computing to support the development of clustering techniques. This approach is of particular interest when dealing with huge data sets, unknown number of clusters and encountering a heterogeneous character of available data. We present a detailed algorithm and show how the essential components of the clustering technique are realized through the corresponding mechanisms of DNA computing. Numerical examples offer a detailed insight into the performance of the DNA-based clustering.

    元の言語English
    ページ(範囲)1-12
    ページ数12
    ジャーナルBioSystems
    91
    発行部数1
    DOI
    出版物ステータスPublished - 2008 1

    Fingerprint

    Cluster Analysis
    DNA
    Clustering
    DNA Computing
    Information granules
    Essential Component
    granules
    Number of Clusters
    methodology
    Unknown
    Numerical Examples

    ASJC Scopus subject areas

    • Ecology, Evolution, Behavior and Systematics
    • Biotechnology
    • Drug Discovery

    これを引用

    DNA approach to solve clustering problem based on a mutual order. / Bakar, Rohani Binti Abu; Watada, Junzo; Pedrycz, Witold.

    :: BioSystems, 巻 91, 番号 1, 01.2008, p. 1-12.

    研究成果: Article

    Bakar, Rohani Binti Abu ; Watada, Junzo ; Pedrycz, Witold. / DNA approach to solve clustering problem based on a mutual order. :: BioSystems. 2008 ; 巻 91, 番号 1. pp. 1-12.
    @article{7bd28ad231b6408dae0c14d3b9bb8ba3,
    title = "DNA approach to solve clustering problem based on a mutual order",
    abstract = "Clustering is regarded as a consortium of concepts and algorithms that are aimed at revealing a structure in highly dimensional data and arriving at a collection of meaningful relationships in data and information granules. The objective of this paper is to propose a DNA computing to support the development of clustering techniques. This approach is of particular interest when dealing with huge data sets, unknown number of clusters and encountering a heterogeneous character of available data. We present a detailed algorithm and show how the essential components of the clustering technique are realized through the corresponding mechanisms of DNA computing. Numerical examples offer a detailed insight into the performance of the DNA-based clustering.",
    keywords = "Cluster validity, Clustering, DNA computing and optimization",
    author = "Bakar, {Rohani Binti Abu} and Junzo Watada and Witold Pedrycz",
    year = "2008",
    month = "1",
    doi = "10.1016/j.biosystems.2007.06.002",
    language = "English",
    volume = "91",
    pages = "1--12",
    journal = "BioSystems",
    issn = "0303-2647",
    publisher = "Elsevier Ireland Ltd",
    number = "1",

    }

    TY - JOUR

    T1 - DNA approach to solve clustering problem based on a mutual order

    AU - Bakar, Rohani Binti Abu

    AU - Watada, Junzo

    AU - Pedrycz, Witold

    PY - 2008/1

    Y1 - 2008/1

    N2 - Clustering is regarded as a consortium of concepts and algorithms that are aimed at revealing a structure in highly dimensional data and arriving at a collection of meaningful relationships in data and information granules. The objective of this paper is to propose a DNA computing to support the development of clustering techniques. This approach is of particular interest when dealing with huge data sets, unknown number of clusters and encountering a heterogeneous character of available data. We present a detailed algorithm and show how the essential components of the clustering technique are realized through the corresponding mechanisms of DNA computing. Numerical examples offer a detailed insight into the performance of the DNA-based clustering.

    AB - Clustering is regarded as a consortium of concepts and algorithms that are aimed at revealing a structure in highly dimensional data and arriving at a collection of meaningful relationships in data and information granules. The objective of this paper is to propose a DNA computing to support the development of clustering techniques. This approach is of particular interest when dealing with huge data sets, unknown number of clusters and encountering a heterogeneous character of available data. We present a detailed algorithm and show how the essential components of the clustering technique are realized through the corresponding mechanisms of DNA computing. Numerical examples offer a detailed insight into the performance of the DNA-based clustering.

    KW - Cluster validity

    KW - Clustering

    KW - DNA computing and optimization

    UR - http://www.scopus.com/inward/record.url?scp=37349037847&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=37349037847&partnerID=8YFLogxK

    U2 - 10.1016/j.biosystems.2007.06.002

    DO - 10.1016/j.biosystems.2007.06.002

    M3 - Article

    C2 - 17669585

    AN - SCOPUS:37349037847

    VL - 91

    SP - 1

    EP - 12

    JO - BioSystems

    JF - BioSystems

    SN - 0303-2647

    IS - 1

    ER -