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

Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture. The purpose of this paper is to propose a technique for spatial cluster analysis...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiyu Liu, Jie Xue
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2013/891428
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832560930187116544
author Xiyu Liu
Jie Xue
author_facet Xiyu Liu
Jie Xue
author_sort Xiyu Liu
collection DOAJ
description Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture. The purpose of this paper is to propose a technique for spatial cluster analysis based on sticker systems of DNA computing. We will adopt the Bin-Packing Problem idea and then design algorithms of sticker programming. The proposed technique has a better time complexity. In the case when only the intracluster dissimilarity is taken into account, this time complexity is polynomial in the amount of data points, which reduces the NP-completeness nature of spatial cluster analysis. The new technique provides an alternative method for traditional cluster analysis.
format Article
id doaj-art-280068f64304446db0beefed41a28c85
institution Kabale University
issn 1026-0226
1607-887X
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-280068f64304446db0beefed41a28c852025-02-03T01:26:22ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2013-01-01201310.1155/2013/891428891428Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing TechniqueXiyu Liu0Jie Xue1School of Management Science and Engineering, Shandong Normal University, Jinan 250014, ChinaSchool of Management Science and Engineering, Shandong Normal University, Jinan 250014, ChinaSpatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture. The purpose of this paper is to propose a technique for spatial cluster analysis based on sticker systems of DNA computing. We will adopt the Bin-Packing Problem idea and then design algorithms of sticker programming. The proposed technique has a better time complexity. In the case when only the intracluster dissimilarity is taken into account, this time complexity is polynomial in the amount of data points, which reduces the NP-completeness nature of spatial cluster analysis. The new technique provides an alternative method for traditional cluster analysis.http://dx.doi.org/10.1155/2013/891428
spellingShingle Xiyu Liu
Jie Xue
Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
Discrete Dynamics in Nature and Society
title Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
title_full Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
title_fullStr Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
title_full_unstemmed Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
title_short Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
title_sort spatial cluster analysis by the bin packing problem and dna computing technique
url http://dx.doi.org/10.1155/2013/891428
work_keys_str_mv AT xiyuliu spatialclusteranalysisbythebinpackingproblemanddnacomputingtechnique
AT jiexue spatialclusteranalysisbythebinpackingproblemanddnacomputingtechnique