Abstract
Using DNA computation to solve clustering problem is a new approach in this field. In the process of problem solving, we use DNA strands to assign vertices and edges, constructing the shortest Hamilton path and cutting branches whose length is longer than the threshold we gave getting the initial clustering result. For improving the quality, we do the iterative calculation, getting clusters for every produced cluster, we deal all of the process with DNA computation in test tubes, reducing the time complexity obviously by DNAs high parallelism. In this paper, we give the process and analysis of our algorithm, illustrating the feasibility of the method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xue, J., Liu, X.: Applying dna computation to clustering in graph. In: 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 986–989 (2011)
Rooß, D.: Recent developments in dna-computing. In: Proceedings of the 27th International Symposium on Multiple-Valued Logic, pp. 3–9. IEEE (1997)
Yin, Z.: Using DNA computation to solve graph and combinatorial optimization problem. Science Publication (2004)
Hao, F., Wang, S., Qiang, X.: Models of DNA computation. Tsinghua University Press, Beijing (2010)
Bakar, R.B.A., Watada, J., Pedrycz, W.: Dna approach to solve clustering problem based on a mutual order. Biosystems 91(1), 1–12 (2008)
Yin, Z.: DNA computation in graph and combinational problems. Science Press, Beijing (2004)
Zhang, H., Liu, X.: A clique algorithm using dna computing techniques based on closed-circle dna sequences. Biosystems 105(1), 73–82 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kang, Z., Liu, X., Xue, J. (2014). DNA Computation Based Clustering Algorithm. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_53
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)