Medoid selection from sub‐tree leaf nodes for k‐medoid clustering‐based hierarchical template tree construction | Zendy

Jung H. G. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Medoid selection from sub‐tree leaf nodes for k‐medoid clustering‐based hierarchical template tree construction

Author(s) -

Jung H. G.

Publication year - 2013

Publication title -

electronics letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.375

H-Index - 146

ISSN - 1350-911X

DOI - 10.1049/el.2012.3288

Subject(s) - medoid , hierarchical clustering , tree (set theory) , cluster analysis , selection (genetic algorithm) , computer science , data mining , hierarchical clustering of networks , mathematics , pattern recognition (psychology) , artificial intelligence , correlation clustering , combinatorics , cure data clustering algorithm

A method to construct a hierarchical template tree for pedestrian contour detection by iteratively applying a k‐medoid clustering algorithm from the lowest level to the highest level was recently proposed and received much attention. Analysed here is the limitation of the method using lower level medoids as points of the next higher level, and proposed is a method of selecting a medoid from the leaf nodes of sub‐trees corresponding to the lower level medoids.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research