The week's pick
Reseach Article
Greedy Search-Binary PSO Hybrid for Biclustering Gene Expression Data
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 2 - Number 3 |
| Year of Publication: 2010 |
| Authors: Shyama Das, Sumam Mary Idicula |
10.5120/651-908
|
Shyama Das, Sumam Mary Idicula . Greedy Search-Binary PSO Hybrid for Biclustering Gene Expression Data. International Journal of Computer Applications. 2, 3 ( May 2010), 1-5. DOI=10.5120/651-908
Abstract
As a useful data mining technique biclustering identifies local patterns from gene expression data. A bicluster of a gene expression dataset is a subset of genes which exhibit similar expression patterns along a subset of conditions. In this paper a new method is introduced based on greedy search algorithm combined with the evolutionary technique particle swarm optimization for the identification of biclusters. Greedy methods have the possibility of getting trapped in local minima. Metaheuristic methods like particle swarm optimization have features for escaping from local minima and can find global optimal solutions. In this algorithm biclusters are identified in three steps. In the first step small disjoint tightly coregulated submatrices are generated using K-Means clustering algorithm. Then greedy search algorithm is used to enlarge the seeds. Output of greedy search algorithm is used as initial population of binary PSO. The result obtained on Yeast dataset shows that this method can generate high quality biclusters.
References
- Madeira S. C.and Oliveira A. L., “Biclustering algorithms for Biological Data analysis: a survey” IEEE Transactions on computational biology and bioinformatics, pp. 24-45, 2004.
- J.A. Hartigan, “Direct clustering of Data Matrix”, Journal of the American Statistical Association, 67 (337) pp. 123-129, 1972.
- Yizong Cheng and George M. Church, “Biclustering of Gene expression data”, Proc Int Conf Intell Syst MolBiol, vol. 8, pp. 93-103, 2000.
- Anupam Chakraborty and Hitashyam Maka “Biclustering of Gene Expression Data Using Genetic Algorithm” Proceedings of Computation Intelligence in Bioinformatics and Computational Biology CIBCB, pp 1-8, 2005.
- Chakraborty Aand Maka H, “Biclustering of gene expression data by simulated annealing”, HPCASIA ’05, pp 627-632, 2005.
- Shyama Das and Sumam Mary Idicula “Modified Greedy Search algorithm for Biclustering Gene Expression Data” Proceedings of the Int. Conf. ADCOM 2009.
- Shyama Das and Sumam Mary Idicula “K-Means Greedy Search Hybrid algorithm for Biclustering Gene Expression Data” Advances in Computational Biology, Research Book, Springer 2010.
- Kennedy J., R. Eberhart, “Particle Swarm Optimization,” Proc. Of IEEE international Conference on Neural Networks (ICW), Australia, 4, pp. 1942-1948, 1995.
- Kennedy J. and Eberhart R.C., “A Discrete Binary Version of the Particle Swarm Optimization”, Proc. of the conference on Systems, Man, and Cybernetics SMC97, pp.4104-4109, 1997.
- Baiyi Xie, Shihong Chen, Feng Liu, “Biclustering of Gene Expression data using PSO-GA hybrid”, Proc. of the First International Conference on Bioinformatics and Biomedical Engineering, pp.302-305, 2007.
- Tavazoie S, Hughes JD, Campbell MJ, Cho RJ and Church GM., “Systematic determination of genetic network architecture”, Nat Genet., vol.22, no.3 pp. 281-285, 1999.
- Federico Divina and Jesus S. Aguilar-Ruize, “Biclustering of Expression Data with Evolutionary computation”, IEEE Transactions on Knowledge and Data Engineering, Vol. 18, pp. 590-602, 2006.
- J Yang, H Wang, W Wang and P Yu, “Enhanced Biclustering on Expression Data”, Proc. Third IEEE Symp. BioInformatics and BioEng. (BIBE’03), pp. 321-327, 2003.
- Z. Zhang, A. Teo, B.C. Ooi, K.L. Tan, Mining deterministic biclusters in gene expression data, in: Proceedings of the fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE’04), pp. 283-292, 2004.
Index Terms
Keywords