2011 World Congress on Information and Communication Technologies 2011
DOI: 10.1109/wict.2011.6141358
|View full text |Cite
|
Sign up to set email alerts
|

Intersected coexpressed subcube miner: An effective triclustering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
2
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…A set of principles for each dimension is illustrated and detailed throughout this work for each biclustering step (mining, mapping and closing) and biclustering goal (defined according to a specific type, structure and quality of biclustering solutions). 3 Illustrating, xMotif [94] relies on greedy search and uses a size merit function and a noise threshold to guarantee the discovery of large and interesting biclusters, and SAMBA-based approaches [119] map binarized matrices into a weighted bipartite graph to find subgraphs that maximize a weight merit function. 4 For a matrix A ¼ ðX; YÞ and I D X; J D Y, the support metric is defined as…”
Section: Mining Approaches To Compose Biclustersmentioning
confidence: 99%
See 1 more Smart Citation
“…A set of principles for each dimension is illustrated and detailed throughout this work for each biclustering step (mining, mapping and closing) and biclustering goal (defined according to a specific type, structure and quality of biclustering solutions). 3 Illustrating, xMotif [94] relies on greedy search and uses a size merit function and a noise threshold to guarantee the discovery of large and interesting biclusters, and SAMBA-based approaches [119] map binarized matrices into a weighted bipartite graph to find subgraphs that maximize a weight merit function. 4 For a matrix A ¼ ðX; YÞ and I D X; J D Y, the support metric is defined as…”
Section: Mining Approaches To Compose Biclustersmentioning
confidence: 99%
“…The additional dimensions can be used to capture additional informative views (such as time points or replicates) [3], to model contributions from overlapping areas of biclusters under a plaid model assumption [60], or to find biclusters' consensus over cubes with different pre-processing and closing criteria.…”
Section: Mining Approaches To Compose Biclustersmentioning
confidence: 99%
“…gTRICLUSTER [89] uses Spearmen correlation coefficient to measure correlation among objects across time points while mining triclusters. ICSM [63] is a triclustering method that operates on possible pairs of time planes and detects some initial modules which are further extended to triclusters.…”
Section: Existing Clustering Methodsmentioning
confidence: 99%
“…Another variant of clustering, called triclustering operates on such datasets to generate triclusters. A tricluster is a group of objects that are not only similar over a subset of features, but are also similar across a subset of time points [63]. Triclustering promotes grouping of objects, features and time points simultaneously.…”
Section: Unsupervised Learningmentioning
confidence: 99%
“…Hence three dimensional data anal sis approach evolved leading to generation of another variant of clustering called triclustering. A tricluster thus generated consist of objects which are similar regarding subset of feature and also subset of time points [52]. It leads to a simultaneous grouping of objects with feature points and time PLDA RF single SVM N., & Raza.…”
Section: Unsupervised Learning Process Does Not Use Class Labels For mentioning
confidence: 99%