Tag Archives: cluster_algorithm

Transformed Residual Quantization for Approximate Nearest Neighbor Search

‘The success of product quantization (PQ) for fast nearest neighbor search depends on the exponentially reduced complexities of both storage and computation with respect to the codebook size. Recent efforts have been focused on employing sophisticated optimization strategies, or seeking … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged , | Comments Off on Transformed Residual Quantization for Approximate Nearest Neighbor Search

Innovation Pursuit: A New Approach to Subspace Clustering

‘In subspace clustering, a group of data points belonging to a union of subspaces are assigned membership to their respective subspaces. This paper presents a new approach dubbed Innovation Pursuit (iPursuit) to the problem of subspace clustering using a new … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged | Comments Off on Innovation Pursuit: A New Approach to Subspace Clustering

Learning ℓ0-Graph for Data Clustering

‘ℓ1-graph \cite{YanW09,ChengYYFH10}, a sparse graph built by reconstructing each datum with all the other data using sparse representation, has been demonstrated to be effective in clustering high dimensional data and recovering independent subspaces from which the data are drawn. It … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged | Comments Off on Learning ℓ0-Graph for Data Clustering

Sparsity-aware Possibilistic Clustering Algorithms

‘In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may also be of significantly different … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged | Comments Off on Sparsity-aware Possibilistic Clustering Algorithms