Spatial cluster analysis by the bin-packing problem and DNA computing technique (Q1956125): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/891428 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089595179 / rank | |||
Normal rank |
Revision as of 21:42, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spatial cluster analysis by the bin-packing problem and DNA computing technique |
scientific article |
Statements
Spatial cluster analysis by the bin-packing problem and DNA computing technique (English)
0 references
13 June 2013
0 references
Summary: 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.
0 references