research
∙
12/07/2015
Clustering by Deep Nearest Neighbor Descent (D-NND): A Density-based Parameter-Insensitive Clustering Method
Most density-based clustering methods largely rely on how well the under...
share
research
∙
09/09/2015
Clustering by Hierarchical Nearest Neighbor Descent (H-NND)
Previously in 2014, we proposed the Nearest Descent (ND) method, capable...
research
∙
07/29/2015
IT-Dendrogram: A New Member of the In-Tree (IT) Clustering Family
Previously, we proposed a physically-inspired method to construct data p...
research
∙
06/19/2015
A general framework for the IT-based clustering methods
Previously, we proposed a physically inspired rule to organize the data ...
research
∙
02/17/2015
Nonparametric Nearest Neighbor Descent Clustering based on Delaunay Triangulation
In our physically inspired in-tree (IT) based clustering algorithm and t...
research
∙
02/16/2015
Clustering by Descending to the Nearest Neighbor in the Delaunay Graph Space
In our previous works, we proposed a physically-inspired rule to organiz...
research
∙
01/26/2015
IT-map: an Effective Nonlinear Dimensionality Reduction Method for Interactive Clustering
Scientists in many fields have the common and basic need of dimensionali...
research
∙
01/18/2015
A Generalized Affinity Propagation Clustering Algorithm for Nonspherical Cluster Discovery
Clustering analysis aims to discover the underlying clusters in the data...
research
∙
12/24/2014
An Effective Semi-supervised Divisive Clustering Algorithm
Nowadays, data are generated massively and rapidly from scientific field...
research
∙
12/07/2014
