KLIGER , Mark

This paper introduces a novel distance measure for clustering high dimensional data based on the hitting time of two Minimal Spanning Trees (MST) grown sequentially from a pair of points by Prim's algorithm. When the proposed measure is used in conjunction with spectral clustering, we obtain a powerful clustering algorithm that is able to...

This paper introduces a novel distance measure for clustering high dimensional data based on the hitting time of two Minimal Spanning Trees (MST) grown sequentially from a pair of points by Prim's algorithm. When the proposed measure is used in conjunction with spectral clustering, we obtain a powerful clustering algorithm that is able to...

This paper focusses on a new clustering method called evidence accumulation clustering with dual rooted prim tree cuts (EAC-DC), based on the principle of cluster ensembles also known as ''combining multiple clustering methods". A simple weak clustering algorithm is introduced based upon the properties of dual rooted minimal spanning trees and...