By Topic

DPBC: Distance Based Possibilistic Biclustering with Application to Gene Expression Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahfouz, M.A. ; Dept. of Comput. & Syst. Eng., Alexandria Univ., Alexandria, Egypt ; Ismail, M.A.

Biclustering is a key step in analyzing gene expression data by identifying patterns where subset of genes are co-related based on a subset of conditions. This paper proposes a new distance based possibilistic biclustering algorithm (DPBC), in which the average distances between rows and between columns of the bicluster are minimized and at the same time the size of the bicluster is maximized by computing the zeros of the derivative of appropriate objective function. The proposed algorithm uses the possibilistic clustering paradigm similar to another existing possibilistic biclustering algorithm PBC. Whereas PBC is based on residue our approach is applicable to any accepted definition for distances between pairs of rows or columns. Experimental study on the human dataset and several artificial datasets having different noise levels shows that the DPBC algorithm can offer substantial improvements over the previously proposed algorithms.

Published in:

Bioinformatics and Biomedical Engineering , 2009. ICBBE 2009. 3rd International Conference on

Date of Conference:

11-13 June 2009