2012
DOI: 10.1016/j.eswa.2011.08.059
|View full text |Cite
|
Sign up to set email alerts
|

CLICOM: Cliques for combining multiple clusterings

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
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…(A) Clustering analysis of the data using modified CLICOM clustering, using five underlying clustering setups, evidence threshold of 50%, and a minimal cluster size of 75 (Mimaroglu and Yagci, 2012). Clusters are sorted by their size.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…(A) Clustering analysis of the data using modified CLICOM clustering, using five underlying clustering setups, evidence threshold of 50%, and a minimal cluster size of 75 (Mimaroglu and Yagci, 2012). Clusters are sorted by their size.…”
Section: Resultsmentioning
confidence: 99%
“…Finally, RNAlysis allows users to cluster genes based on the similarity of their expression patterns. RNAlysis supports an extensive selection of clustering algorithms, including distance-based clustering (K-Means, K-Medoids, Hierarchical clustering), density-based clustering (HDBSCAN) (McInnes et al, 2017), and ensemble-based clustering (a modified version of the CLICOM algorithm) (Mimaroglu and Yagci, 2012).…”
Section: Introductionmentioning
confidence: 99%
“…A cluster is organized as Undirected, Weighted and Complete graph [3], [12]. Vertices of the graph are the clusters and weights of the edges are the Similarity Within Cluster (SWC) values between corresponding clusters with n vertices and n (n-1) edges.…”
Section: E Undirected Weighted Graph Constructionmentioning
confidence: 99%
“…For example, if we assumed that the co-occurrence matrix represented edge weights (a numerical value indicating the strength of connection) connecting the data points, we could traverse these weights to find maximally connected subgraphs and provide a different representation of robust clusters (61). With this concept of graph theory representations of ensemble clustering, we discovered that robustly clustered dynamic tyrosine phosphorylation data uncovered molecularlevel interactions (8).…”
Section: Ensemble Generation Finishing and Visualizationmentioning
confidence: 99%