Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique | Zendy

Xiyu Liu | Zendy; Jie Xue | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique

Author(s) -

Xiyu Liu,

Jie Xue

Publication year - 2013

Publication title -

discrete dynamics in nature and society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.264

H-Index - 39

eISSN - 1607-887X

pISSN - 1026-0226

DOI - 10.1155/2013/891428

Subject(s) - computer science , cluster (spacecraft) , cluster analysis , bin , time complexity , data mining , bin packing problem , theoretical computer science , von neumann architecture , algorithm , artificial intelligence , programming language , operating system

Spatial cluster analysis is an important data mining task. Typicaltechniques include CLARANS, density- and gravity-based clustering,and other algorithms based on traditional von Neumann's computingarchitecture. The purpose of this paper is to propose a techniquefor spatial cluster analysis based on sticker systems of DNAcomputing. We will adopt the Bin-Packing Problem idea and thendesign algorithms of sticker programming. The proposed techniquehas a better time complexity. In the case when only theintracluster dissimilarity is taken into account, this timecomplexity is polynomial in the amount of data points, whichreduces the NP-completeness nature of spatial cluster analysis. The new technique provides an alternative method for traditionalcluster analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research