Abstract
In contrast to hard biclustering, possibilistic biclustering not only has the ability to cluster a group of genes together with a group of conditions as hard biclustering but also it has outlier rejection capabilities and can give insights towards the degree under which the participation of a row or a column is most effective. Several previous possibilistic approaches are based on computing the zeros of an objective function. However, they are sensitive to their input parameters and initial conditions beside that they don’t allow constraints on biclusters. This paper proposes an iterative algorithm that is able to produce k-possibly overlapping semi-possibilistic (soft) biclusters satisfying input constraints. The proposed algorithms basically alternate between a depth-first search and a breadth-first search to effectively minimize the underlying objective function. It allows constraints, applicable to any acceptable (dis)similarity measure for the type of the input dataset and it is not sensitive to initial conditions. Experimental results show the ability of our algorithm to offer substantial improvements over several previously proposed biclustering algorithms.
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
Zhiguan, W., Chi, W.: Hypergraph based geometric biclustering algorithm. Pattern Recognition Letters 33(12), 1656–1665 (2012)
Sharara, H., Ismail, M.A.: BISOFT: A novel algorithm for clustering gene expression data. In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIOCOMP 2008, pp. 974–981 (2007)
Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proc. Eighth Int’l Conf. Intelligent Systems for Molecular Biology (ISMB 2000), pp. 93–103 (2000)
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)
Getz, G., et al.: Coupled Two-Way Clustering Analysis of Gene Microarray Data. Proc. Natural Academy of Sciences, US, 12079–12084 (2000)
Ismail, M.A., Kamel, M.S.: Multidimensional data clustering utilizing hybrid search strategies. Pattern Recognition 22(1), 75–89 (1989)
Liu, G., et al.: Distance Based Subspace Biclustering with Flexible Dimension Partitioning, pp. 1250–1254. IEEE (2007)
Mahfouz, M.A., Ismail, M.A.: BIDENS: Iterative Density Based Biclustering Algorithm with Application to Gene Expression Analysis. Proceedings of World Academy of Science, Engineering and Technology 37, 342–348 (2009)
Mahfouz, M.A., Ismail, M.A.: Enhanced Possibilistic Biclustering Algorithm. In: Proceedings of the 3rd IEEE International Conference on Bioinformatics and Biomedical Engineering, Beijing, China, 6 pages (2009)
Mahfouz, M.A., Ismail, M.A.: Distance Based Possibilistic Biclustering Algorithm. In: Proceedings of the 3rd IEEE International Conference on Bioinformatics and Biomedical Engineering, Beijing, China, 4 pages (2009)
Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: Proceedings of the 20th VLDB Conference, Santiago, Chile, pp. 144–155 (1994)
Okada, Y., et al.: Module Discovery in Gene Expression Data Using Closed Itemset Mining Algorithm. IPSG Transactions in Bioinformatics 48, 39–48 (2007)
Pei, J., et al.: Fault-tolerant frequent pattern mining: Problems and challenges. In: Workshop on Research Issues in Data Mining and Knowledge Discovery (2001)
Sara, C.M., Arlindo, L.O.: Biclustering Algorithms for Biological Data Analysis: A Survey. IEEE Trans. Computational Biology and Bioinformatics 1 (2004)
Anindya, B., Rajat, K.: Bi-correlation clustering algorithm for determining a set of co-regulated genes. Bioinformatics 25(21), 2795–2801 (2009)
Selim, S.Z., Ismail, M.A.: Soft clustering of multidimensional data A semi-fuzzy approach. Pattern Recogn. 17(5), 559–568 (1984)
Christinat, Y., et al.: Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data. IEEE/ACM Transactions on Computational Biology And Bioinformatics 5(4) (2008)
Yang, J., et al.: Enhanced Biclustering on Expression Data. In: Proc. Third IEEE Conf. Bioinformatics and Bioeng., pp. 321–327 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahfouz, M.A., Ismail, M.A. (2012). Semi-possibilistic Biclustering Applied to Discrete and Continuous Data. In: Hassanien, A.E., Salem, AB.M., Ramadan, R., Kim, Th. (eds) Advanced Machine Learning Technologies and Applications. AMLTA 2012. Communications in Computer and Information Science, vol 322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35326-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-35326-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35325-3
Online ISBN: 978-3-642-35326-0
eBook Packages: Computer ScienceComputer Science (R0)