32 citations · 49 across the 36 of their papers we have counts for
3 papers · 1 filter
Algorithms for an Efficient Tensor Biclustering
Andriantsiory Dina Faneva, Mustapha Lebbah, Hanane Azzag +1
Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tenso…
Nearest Neighbor Median Shift Clustering for Binary Data
Gaël Beck, Tarn Duong, Mustapha Lebbah +1
We describe in this paper the theory and practice behind a new modal clustering method for binary data. Our approach (BinNNMS) is based on the nearest neighbor median shift. The me…
A Distributed and Approximated Nearest Neighbors Algorithm for an Efficient Large Scale Mean Shift Clustering
Gaël Beck, Tarn Duong, Mustapha Lebbah +2
In this paper we target the class of modal clustering methods where clusters are defined in terms of the local modes of the probability density function which generates the data. T…