2009 3rd International Conference on Bioinformatics and Biomedical Engineering 2009
DOI: 10.1109/icbbe.2009.5162662
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 7 publications
0
9
0
Order By: Relevance
“…de Souto et al [34] compare three normalization procedures (z-score, scaling and rank-based procedures) over gene expression datasets using alternative clustering algorithms. Additional methods for preprocessing the input matrix have been reported [118,83,25]. levels of noise allowance, commonly occurring in binarized partitions or through the use of rule-based approaches under a relaxed level of confidence.…”
Section: Closing Options: Postprocessing Biclustering Solutionsmentioning
confidence: 99%
See 1 more Smart Citation
“…de Souto et al [34] compare three normalization procedures (z-score, scaling and rank-based procedures) over gene expression datasets using alternative clustering algorithms. Additional methods for preprocessing the input matrix have been reported [118,83,25]. levels of noise allowance, commonly occurring in binarized partitions or through the use of rule-based approaches under a relaxed level of confidence.…”
Section: Closing Options: Postprocessing Biclustering Solutionsmentioning
confidence: 99%
“…A sensitivity analysis on the impact of the number of items on the quality and size of biclusters was, first, performed in Bidens [83] and BiModule [96]. Fig.…”
Section: Mapping Options: Preprocessing Input Datamentioning
confidence: 99%
“…Normalization techniques are often required to enhance differences across rows and/or columns. Alternative methods have been reported [ 34 , 48 ]. BicPAM allows the normalization criteria to be applied in the context of a row, a column or the overall matrix.…”
Section: Bicpam: Pattern-based Biclusteringmentioning
confidence: 99%
“…GenMiner [ 15 ] includes external knowledge within the input matrix to derive biclusters from association rules that relate annotations (external grouping of rows or columns) with computed clusters of rows and columns from (closed) frequent patterns using CLOSE [ 33 ]. Although other biclustering approaches seize contributions from these previous works [ 34 , 35 ], we do not refer to them as PM-based appproaches if the core mining task does not rely on FIM.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, when missing values are present, classical data mining algorithms discover multiple small fragments of the real cluster, but miss the cluster itself [15]. The problem is even worse for clusters which cover many rows and columns, since they are more vulnerable to this kind of "noise" [17].…”
Section: Introductionmentioning
confidence: 99%