Feature groupweighting and topological biclustering

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a new method to weight feature groups for biclustering. In this method, the observations and features are divided into biclusters, based on their characteristics. The weights are introduced to the biclustering process to simultaneously identify the relevance of feature groups in each bicluster. A new biclustering algorithm wBiTM (Weighted Biclustering Topological Map) is proposed. The new method is an extension to self-organizing map algorithm by adding the weight parameter and a new prototype for bicluster. Experimental results on synthetic data show the properties of the weights in wBiTM.

Cite

CITATION STYLE

APA

Sarazin, T., Lebbah, M., Azzag, H., & Chaibi, A. (2014). Feature groupweighting and topological biclustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8835, pp. 369–376). Springer Verlag. https://doi.org/10.1007/978-3-319-12640-1_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free