Adaptive Hierarchical Clustering Using Ordinal Queries

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 415-429, 2018.

Cited by: 9|Bibtex|Views24|Links
EI

Abstract:

In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering. A hierarchical clustering over n elements is represented by a rooted binary tree with n leaves, each corresponding to one element. The subtrees rooted at interior nod...More

Code:

Data:

Your rating :
0

 

Tags
Comments