Search Results for author:
Found 3 papers, 1 papers with code
Algorithms for an Efficient Tensor Biclustering
Consider a data set collected by (individuals-features) pairs in different times.
Nearest Neighbor Median Shift Clustering for Binary Data
We describe in this paper the theory and practice behind a new modal clustering method for binary data.
A Distributed and Approximated Nearest Neighbors Algorithm for an Efficient Large Scale Mean Shift Clustering
Mean Shift clustering is a generalization of the k-means clustering which computes arbitrarily shaped clusters as defined as the basins of attraction to the local modes created by the density gradient ascent paths.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
