2007
DOI: 10.1093/bioinformatics/btm526
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical tree snipping: clustering guided by prior knowledge

Abstract: A java package is available at http://www.cs.bgu.ac.il/~dotna/ TreeSnipping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
18
0
1

Year Published

2009
2009
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(20 citation statements)
references
References 42 publications
1
18
0
1
Order By: Relevance
“…Our method improves the selection procedure by combining information on false discovery rate p-value with both functional group and characteristic temporal pattern association, thus diminishing the number of false negatives without significantly increasing the number of false positives. Previous works have addressed the integration of prior knowledge either in clustering algorithms [26][28] or in selection procedures [29], whereas our approach integrates selection, clustering and annotation in a single computational framework.…”
Section: Discussionmentioning
confidence: 99%
“…Our method improves the selection procedure by combining information on false discovery rate p-value with both functional group and characteristic temporal pattern association, thus diminishing the number of false negatives without significantly increasing the number of false positives. Previous works have addressed the integration of prior knowledge either in clustering algorithms [26][28] or in selection procedures [29], whereas our approach integrates selection, clustering and annotation in a single computational framework.…”
Section: Discussionmentioning
confidence: 99%
“…The optimization function becomes maximizing for the interclass variance with the restriction that only allow those splits that can be explained by a common feature [17]. Dotan-Cohen et al proposed a hierarchical tree snipping method which incorporates the gene annotation information from Gene Ontology (GO) to obtain clusters that are substantially enriched in genes participating in the same biological process [18].…”
Section: Optimization Functionmentioning
confidence: 99%
“…Now, subtrees below these k  edges define a partitioning into k  classes. In general, however, there are numerous non-horizontal cuts supported by the same dendrogram that yield a different partitioning into the same number of clusters, which has been considered only recently in literature [23-25]. …”
Section: Introductionmentioning
confidence: 99%