Optimization methods and the k-Committees algorithm for clustering of sequence data

Applied and Computational Mathematics

Volumn 8, Issue 1, 2009, Pages 92-101

  Yearwood, J L ^a   Bagirov, A M ^b   Kelarev, A V ^b  

^a UNIVERSITY OF BALLARAT   (Australia)

^b NONE   (Australia)

Author keywords

Classification algorithms; DNA sequences; Optimization methods

Indexed keywords

EID: 70249135658     PISSN: 16833511     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Aggarwal, C.C. and Yu, P., A framework for clustering massive text and cat-egorical data streams, Proc. ACM SIAM Conference on Data Mining, 2006. http://www.siam.org/meetings/sdm06/proceedings/045aggarwalc2.pdf
2. Bagirov, A.M. and Yearwood, J.L., A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, European J. Operational Research 170 (2006), pp. 578-596.
3. Bagirov, A.M., Rubinov, A.M. and Yearwood, J., A global optimization approach to classification, Optim. Eng. 3 (2002), pp. 129-155.
4. Bagirov, A.M., Rubinov, A.M., Soukhoroukova, N.V. and Yearwood, J., Unsupervised and supervised data classification via nonsmooth and global optimization, Top 11 (2003), pp. 1-93.
5. Baldi, P. and Brunak, S., Bioinformatics: The Machine Learning Approach, Cambridge, Mass, MIT Press, 2001.
6. Durbin, R., Eddy, S.R., Krogh, A. and Mitchison, G., Biological Sequence Analysis, Cambridge University Press, 1999.
7. Gusfield, D., Algorithms on Strings, Trees, and Sequences, Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
8. Jones, N.C. and Pevzner, P.A., An Introduction to Bioinformatics Algorithms, Cambridge, Mass, MIT Press, 2004. http://www.bioalgorithms.info/
9. Kang, B.H., Kelarev, A.V., Sale, A.H.J. and Williams, R.N., A new model for classifying DNA code inspired by neural networks and FSA, Pacific Knowledge Acquisition Workshop, PKAW2006, Lect. Notes Computer Science 4303 (2006), pp. 187-198.
10. Kelarev, A.V., Ring Constructions and Applications, World Scientific, River Edge, 2002.
11. Kelarev, A.V., Graph Algebras and Automata, Marcel Dekker, New York, 2003.
12. Kelarev, A.V., Kang, B.H., Sale, A.H.J. and Williams, R.N., Labeled directed graphs and FSA as classifiers of strings, 17th Australasian Workshop on Combinatorial Algorithms, AWOCA 2006, 12-16 July 2006, Uluru (Ayres Rock), Northern Territory, Australia, pp. 93-109.
13. Kelarev, A., Kang, B. and Steane, D., Clustering algorithms for ITS sequence data with alignment metrics, Advances in Artificial Intelligence, 19th Australian Joint Conference on Artificial Intelligence, AI06, Lect. Notes Artificial Intelligence 4304 (2006), pp. 1027-1031.
14. Lau, H.T.: A Java Library of Graph Algorithms and Optimization, CRC Press, 2008.
15. Luger, G.F., Artificial Intelligence. Structures and Strategies for Complex Problem Solving, Addison-Wesley, 2005.
16. Mount, D., Bioinformatics: Sequence and Genome Analysis, Cold Spring Harbor Laboratory, 2001. http://www.bioinformaticsonline.org/
17. Rubinov, A.M., Methods for global optimization of nonsmooth functions with applications (survey), Appl. Comput. Math., 5 (2006), no.1., pp. 3-15.
18. Sattar, A. and Kang, B.H., Advances in Artificial Intelligence, Proceedings of AI2006, Hobart, Tasmania, 2006.
19. Steane, D.A., Nicolle, D., Mckinnon, G.E., Vaillancourt, R.E. and Potts, B.M., High-level relationships among the eucalypts are resolved by ITS-sequence data, Australian Systematic Botany 15 (2002), pp. 49-62.
20. WEKA, Waikato Environment for Knowledge Analysis, http://www.cs.waikato.ac.nz/ml/weka, viewed 31.08.2008.
21. Witten, I.H. and Frank, E., Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann, 2005.
22. Yearwood, J.L. and Mammadov, M., Classification Technologies: Optimization Approaches to Short Text Categorization, Idea Group Inc., 2007.