2009
DOI: 10.1108/17563780910982707
|View full text |Cite
|
Sign up to set email alerts
|

Improved biclustering on expression data through overlapping control

Abstract: PurposeThe purpose of this paper is to present a novel control mechanism for avoiding overlapping among biclusters in expression data.Design/methodology/approachBiclustering is a technique used in analysis of microarray data. One of the most popular biclustering algorithms is introduced by Cheng and Church (2000) (Ch&Ch). Even if this heuristic is successful at finding interesting biclusters, it presents several drawbacks. The main shortcoming is that it introduces random values in the expression matrix to con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
14
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 17 publications
0
14
0
Order By: Relevance
“…For this particular work, we have simulated data from 5 different time points and 10 conditions using microarrays containing 1000 genes. Each gene is assigned a random value which is contained in the rank, respectively for each condition, [1,15], [7,35] [10,30]. In such data set, we have allocated a tricluster with all its values fixed to 1.…”
Section: Results Using Synthetic Datamentioning
confidence: 99%
See 1 more Smart Citation
“…For this particular work, we have simulated data from 5 different time points and 10 conditions using microarrays containing 1000 genes. Each gene is assigned a random value which is contained in the rank, respectively for each condition, [1,15], [7,35] [10,30]. In such data set, we have allocated a tricluster with all its values fixed to 1.…”
Section: Results Using Synthetic Datamentioning
confidence: 99%
“…Traditional clustering algorithms work on the whole space of data dimensions examining each gene in the dataset under all conditions tested. Biclustering techniques [8] go a step further by relaxing the conditions and by allowing assessment only under a subset of the conditions of the experiment, and it has proved to be successful finding gene patterns [6,10]. However, clustering and biclustering are insufficient when analyzing data from microarray experiments where attention is payed on how the time affects gene's behavior.…”
Section: Introductionmentioning
confidence: 99%
“…For this particular work, we have simulated data from 5 different time points and 10 conditions using microarrays containing 1000 genes. Each gene is assigned a random value which is contained in the rank, respectively for each condition, [1,15], [7,35] [10,30]. In such data set, we have allocated a tricluster with all its values fixed to 1.…”
Section: A Results Using Synthetic Datamentioning
confidence: 99%
“…Traditional clustering algorithms work on the whole space of data dimensions examining each gene in the dataset under all conditions tested. Biclustering techniques [5] go a step further by relaxing the conditions and by allowing assessment only under a subset of the conditions of the experiment, and it has proved to be successful finding gene patterns [6], [7]. However, clustering and biclustering …”
Section: Introductionmentioning
confidence: 99%
“…Traditional clustering algorithms work on the whole space of data dimensions examining each gene in the dataset under all conditions tested. Biclustering techniques [5] go a step further by relaxing the conditions and by allowing assessment only under a subset of the conditions of the experiment, and it has proved to be successful finding gene patterns [6], [7]. However, clustering and biclustering are insufficient when analyzing data from microarray experiments where attention is payed on how the time affects gene's behavior.…”
Section: Introductionmentioning
confidence: 99%