Demo Data from SIGIR 2026 / reviewers in the wild / expert
Dikla Dotan-Cohen
dblp:33/6261
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
gene expression analysis |
0.2 | 2 | 2009 | Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering · Bioinform. 2009 Hierarchical tree snipping: clustering guided by prior knowledge · Bioinform. 2007 |
Bioinformatics and computational biology
hierarchical clustering |
0.2 | 2 | 2009 | Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering · Bioinform. 2009 Hierarchical tree snipping: clustering guided by prior knowledge · Bioinform. 2007 |
Bioinformatics and computational biology
ontology-based clustering |
0.1 | 1 | 2009 | Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering · Bioinform. 2009 |
Bioinformatics and computational biology › protein function prediction
gene ontology annotation |
0.0 | 1 | 2009 | Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering · Bioinform. 2009 |
Methods — techniques the papers use, named apart from their topics
semantic similarity · 0.1cross-validation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clusteringabstractMOTIVATION: There is a growing interest in improving the cluster analysis of expression data by incorporating into it prior knowledge, such as the Gene Ontology (GO) annotations of genes, in order to improve the biological relevance of the clusters that are subjected to subsequent scrutiny. The structure of the GO is another source of background knowledge that can be exploited through the use of semantic similarity. RESULTS: We propose here a novel algorithm that integrates semantic similarities (derived from the ontology structure) into the procedure of deriving clusters from the dendrogram constructed during expression-based hierarchical clustering. Our approach can handle the multiple annotations, from different levels of the GO hierarchy, which most genes have. Moreover, it treats annotated and unannotated genes in a uniform manner. Consequently, the clusters obtained by our algorithm are characterized by significantly enriched annotations. In both cross-validation tests and when using an external index such as protein-protein interactions, our algorithm performs better than previous approaches. When applied to human cancer expression data, our algorithm identifies, among others, clusters of genes related to immune response and glucose metabolism. These clusters are also supported by protein-protein interaction data. Dikla Dotan-Cohen, Simon Kasif, Avraham A. Melkman |
Bioinform. | 1 |
| 2007 | Hierarchical tree snipping: clustering guided by prior knowledgeabstractMOTIVATION: Hierarchical clustering is widely used to cluster genes into groups based on their expression similarity. This method first constructs a tree. Next this tree is partitioned into subtrees by cutting all edges at some level, thereby inducing a clustering. Unfortunately, the resulting clusters often do not exhibit significant functional coherence. RESULTS: To improve the biological significance of the clustering, we develop a new framework of partitioning by snipping--cutting selected edges at variable levels. The snipped edges are selected to induce clusters that are maximally consistent with partially available background knowledge such as functional classifications. Algorithms for two key applications are presented: functional prediction of genes, and discovery of functionally enriched clusters of co-expressed genes. Simulation results and cross-validation tests indicate that the algorithms perform well even when the actual number of clusters differs considerably from the requested number. Performance is improved compared with a previously proposed algorithm. AVAILABILITY: A java package is available at http://www.cs.bgu.ac.il/~dotna/ TreeSnipping Dikla Dotan-Cohen, Avraham A. Melkman, Simon Kasif |
Bioinform. | 1 |