Generating and Postprocessing of Biclusters from Discrete Value Matrices
This paper presents a new approach for the biclustering problem. For this purpose new notions like half-bicluster and biclustering matrix were developed. Results obtained with the algorithm BicDM (Biclustering of Discrete value Matrix) were compared with some other methods of biclustering. In this article the new algorithm is applied for binary data but there is no limitation to use it for other discrete type data sets. In this paper also two postprocessing steps are defined: generalization and filtering. In the first step biclusters are generalized and after that only those which are the best become the final set - weak biclusters are filtered from the set. The usage of the algorithm makes it possible to improve the description of data with the reduction of bicluster number without the loss of information. The postprocessing was performed on the new algorithm results and compared with other biclustering methods.
Keywordsmachine learning data mining biclustering postprocessing
Unable to display preview. Download preview PDF.
- 1.Ayadi, W., Elloumi, M., Hao, J.K.: A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data. BioData Mining 9 (2009)Google Scholar
- 3.Chang, F.C., Huang, H.C.: A refactoring method for cache-efficient swarm intelligence algorithms. Inf. Sci. (2010), doi:10.1016/j.ins.2010.02.025 (in press, corrected proof)Google Scholar
- 4.Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proc. of the 8th Int. Conf. On Intell. Systems For Molecular Biology, pp. 93–103 (2000)Google Scholar
- 5.Cyran, K.: Modified Indiscernibility Relation in the Theory of Rough Sets with Real-Valued Attributes: Application to Recognition of Fraunhofer Diffraction Patterns. In: Peters, J.F., Skowron, A., Rybiński, H. (eds.) Transactions on Rough Sets IX. LNCS, vol. 5390, pp. 14–34. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 11.Murali, T.M., Kasif, S.: Extracting Conserved Gene Expression Motifs from Gene Expression Data. In: Pacific Symposium on Biocomputing, pp. 77–88 (2003)Google Scholar
- 12.Nisar, A., Ahmad, W., Liao, W., Choudhary, A.: High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic. In: Proc. of SIAM Int. Conf. on Data Mining, pp. 1050–1061 (2009)Google Scholar
- 14.Sayoud, H., Ouamour, S.: Speaker Clustering of Stereo Audio Documents Based on Sequential Gathering Process. J. of Inf. Hiding. and Multimed. Signal Process. 4, 344–360 (2010)Google Scholar
- 15.Sikora, M.: An algorithm for generalization of decision rules by joining. Found. on Comput. and Decis. Sci. 30, 227–239 (2005)Google Scholar
- 17.Sikora, M.: Filtering of decision rules using rules quality function. Stud. Inform. 4(46), 5–21 (2001)Google Scholar
- 18.Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: A survey. In: Handbook of computational molecular biology. Chapman Hall/CRC Press (2006)Google Scholar