DeepAI AI Chat
Log In Sign Up

Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation

12/01/2022
by   Ashlin Richardson, et al.
University of Victoria
0

A clustering termination procedure which is locally adaptive (with respect to the hierarchical tree of sets representative of the agglomerative merging) is proposed, for agglomerative hierarchical clustering on a set equipped with a distance function. It represents a multi-scale alternative to conventional scale dependent threshold based termination criteria.

READ FULL TEXT

page 1

page 2

page 3

page 8

02/25/2019

Dependent choice as a termination principle

We introduce a new formulation of the axiom of dependent choice that can...
12/05/2018

Termination of λΠ modulo rewriting using the size-change principle (work in progress)

The Size-Change Termination principle was first introduced to study the ...
11/11/2021

Hierarchical clustering by aggregating representatives in sub-minimum-spanning-trees

One of the main challenges for hierarchical clustering is how to appropr...
05/21/2019

Termination of Triangular Integer Loops is Decidable

We consider the problem whether termination of affine integer loops is d...
03/03/2020

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...
07/30/2020

Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometry

Systems that are based on recursive Bayesian updates for classification ...