The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Fusion of multimedia streams for enhanced performance is a critical problem for retrieval. However, fusion performance tends to easily overfit the hillclimb set used to learn fus...
Remote patient monitoring generates much more data than healthcare professionals are able to manually interpret. Automated detection of events of interest is therefore critical so...
Erich P. Stuntebeck, John S. Davis II, Gregory D. ...
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...