资源论文Quickshift++: Provably Good Initializations for Sample-Based Mean Shift

Quickshift++: Provably Good Initializations for Sample-Based Mean Shift

2020-03-11 | |  75 |   41 |   0

Abstract

We provide initial seedings to the Quick Shift clu tering algorithm, which approximate the locally high-density regions of the data. Such seedings act as more stable and expressive cluster-cores than the singleton modes found by Quick Shift. We establish statistical consistency guarantees fo this modification. We then show strong clustering performance on real datasets as well as promising applications to image segmentation.

上一篇:Selecting Representative Examples for Program Synthesis

下一篇:Extreme Learning to Rank via Low Rank Assumption

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...