Name
Abstract | ||
|---|---|---|
Transitive distance is an ultrametric with elegant properties for clustering. Conventional transitive distance can be found by referring to the minimum spanning tree (MST). We show that such distance metric can be generalized onto a minimum spanning random forest (MSRF) with element-wise max pooling over the set of transitive distance matrices from an MSRF. Our proposed approach is both intuitively reasonable and theoretically attractive. Intuitively, max pooling alleviates undesired short links with single MST when noise is present. Theoretically, one can see that the distance metric obtained max pooling is still an ultrametric, rendering many good clustering properties. Comprehensive experiments on data clustering and image segmentation show that MSRF with max pooling improves the clustering performance over single MST and achieves state of the art performance on the Berkeley Segmentation Dataset. |
Year | Venue | Field |
|---|---|---|
2015 | IJCAI | Distance matrices in phylogeny,Computer science,Pooling,Algorithm,Metric (mathematics),Image segmentation,Artificial intelligence,Ultrametric space,Cluster analysis,Machine learning,Transitive relation,Minimum spanning tree |
DocType | Citations | PageRank |
Conference | 4 | 0.43 |
References | Authors | |
11 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiding Yu | 1 | 421 | 30.08 |
| Weiyang Liu | 2 | 31 | 6.29 |
| Wenbo Liu | 3 | 20 | 3.81 |
| Xi Peng | 4 | 447 | 23.84 |
| Hui Zhuo | 5 | 34 | 4.94 |
| B. V. K. Vijaya Kumar | 6 | 924 | 126.77 |