Abstract
The search for similarities in large data sets has a very important role in many scientific fields. It permits to classify several types of data without an explicit information about it. In many cases researchers use analysis methodologies such as clustering to classify data with respect to the patterns and conditions together. But in the last few years new analysis tool such as a biclustering were proposed and applied to the many specific problems. Biclustering algorithms permit not only to classify data with respect to selected conditions, but also to find the conditions that permit to classify data with a better precision. Recently we proposed a biclustering technique based on the Possibilistic Clustering paradigm (PBC algorithm) [1] that is able to find one bicluster at a time. In this paper we propose an improvement to the Possibilistic Biclustering algorithm (PBC Bagging) that permits to find find several biclusters by using the statistical method of Bootstrap aggregation. We applied the algorithm to a synthetic data and to the Yeast dataset, obtaining fast convergence and good quality solutions. A comparison with original PBC method is also presented.
This is a preview of subscription content, log in via an institution to check access.
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
Filippone, M., Masulli, F., Rovetta, S., Mitra, S., Banka, H.: Possibilistic approach to biclustering: An application to oligonucleotide microarray data analysis. In: Priami, C. (ed.) CMSB 2006. LNCS (LNBI), vol. 4210, pp. 312–322. Springer, Heidelberg (2006)
Hartigan, J.A.: Direct clustering of a data matrix. Journal of the American Statistical Association 67, 123–129 (1972)
Cheng, Y., Church, G.: Biclustering of expression data. In: Proc. Eighth Intl Conf. Intelligent Systems for Molecular Biology (ISMB 2000), pp. 93–103 (2000)
Mitra, S., Banka, H.: Multi-objective evolutionary biclustering of gene expression data. Pattern Recognition 39, 2464–2477 (2006)
Krishnapuram, R., Keller, J.M.: A possibilistic approach to clustering. IEEE Transactions on Fuzzy Systems 1(2), 98–110 (1993)
Peeters, R.: The maximum edge biclique problem is NP-Complete. Discrete Applied Mathematics 131, 651–654 (2003)
Krishnapuram, R., Keller, J.: The possibilistic c-means algorithm: insights and recommendations. IEEE Transactions on Fuzzy Systems 4(3), 385–393 (1996)
Masulli, F., Schenone, A.: A fuzzy clustering based segmentation system as support to diagnosis in medical imaging. Artificial Intelligence in Medicine 16(2), 129–147 (1999)
Breiman, L.: Bagging Predictors. Technical Report No. 421 (1994)
Ciaramella, A., Cocozza, S., Iorio, F., Miele, G., Napolitano, F., Pinelli, M., Raiconi, G., Tagliaferri, R.: Clustering, Assessment and Validation: an application to gene expression data. In: Proceedings of International Joint Conference on Neural Networks, pp. 12–17 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nosova, E., Tagliaferri, R., Masulli, F., Rovetta, S. (2011). Biclustering by Resampling. In: Rizzo, R., Lisboa, P.J.G. (eds) Computational Intelligence Methods for Bioinformatics and Biostatistics. CIBB 2010. Lecture Notes in Computer Science(), vol 6685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21946-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21946-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21945-0
Online ISBN: 978-3-642-21946-7
eBook Packages: Computer ScienceComputer Science (R0)