The Evolution of Biclustering Algorithms
2011
Oleg Uzhga-Rebrov, Gaļina Kuļešova

Biclustering methods have been initially developed for solving tasks of finding local correlations between expressions of gene subsets in the subsets of conditions. Later on they started to be employed in target marketing for revealing preferences of subsets of customers/buyers over the subsets of products/services. It can be stated with confidence that in the future these methods will find a wide application in other research areas for mining knowledge when initial data are of specific character. This paper provides a short description and analysis of the four well-known biclustering methods in the order of their evolution.


Atslēgas vārdi
biclustering, -clustering, -p-clustering, OP-clustering, mean squared residue, mean residue, prefix tree, OPC-tree
DOI
10.2478/v10143-011-0051-0
Hipersaite
http://www.degruyter.com/view/j/acss.2011.45.issue--1/v10143-011-0051-0/v10143-011-0051-0.xml?format=INT

Uzhga-Rebrov, O., Kuļešova, G. The Evolution of Biclustering Algorithms. Informācijas tehnoloģija un vadības zinātne. Nr.49, 2011, 109.-115.lpp. ISSN 1407-7493. Pieejams: doi:10.2478/v10143-011-0051-0

Publikācijas valoda
English (en)
RTU Zinātniskā bibliotēka.
E-pasts: uzzinas@rtu.lv; Tālr: +371 28399196