2006
DOI: 10.1007/11691730_6
|View full text |Cite
|
Sign up to set email alerts
|

gTRICLUSTER: A More General and Effective 3D Clustering Algorithm for Gene-Sample-Time Microarray Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(31 citation statements)
references
References 6 publications
0
31
0
Order By: Relevance
“…Along with the algorithm, several metrics were also introduced to evaluate its performance. A revised and generalized version, called g-triCluster, was proposed the following year [21]. In this case, the novelty claimed was that more coherent triclusters could be found, as well as being robust to noise.…”
Section: Use Of Triclusteringmentioning
confidence: 99%
“…Along with the algorithm, several metrics were also introduced to evaluate its performance. A revised and generalized version, called g-triCluster, was proposed the following year [21]. In this case, the novelty claimed was that more coherent triclusters could be found, as well as being robust to noise.…”
Section: Use Of Triclusteringmentioning
confidence: 99%
“…was published one year later [18]. The generalization claimed by the authors was based on the discovery of more coherent triclusters and on its robustness to noise.…”
Section: Related Workmentioning
confidence: 99%
“…Triclustering Algorithms for Three-Dimensional Data Analysis 95:3 (4) Robustness: triclustering should be able to handle varying types (and degrees) of noise and missing values inherent to real-world 3D biomedical and social data (Jiang et al 2006). (5) Flexibility: the ability to discover a nonfixed number of triclusters with arbitrary size, shape, and positioning should be pursued to guarantee that all relevant subspaces are found.…”
Section: Introductionmentioning
confidence: 99%