About: This is a tool for retrieving nearest neighbors and clustering of large categorical data sets represented in transactional form. The clustering is achieved via a locality-sensitive hashing of categorical datasets for speed and scalability. Changes:Initial Announcement on mloss.org.
|
About: The proposed hashing algorithm leverages the bootstrap sampling idea and integrates it with PCA, resulting in a new projection method called Bagging PCA Hashing. Changes:Initial Announcement on mloss.org.
|
About: This is an online hashing algorithm which can handle the stream data with low computational cost. Changes:Initial Announcement on mloss.org.
|
About: This algorithm is described in Deep Semantic Ranking Based Hashing for Multi-Label Image Retrieval. See https://github.com/zhaofang0627/cuda-convnet-for-hashing Changes:Initial Announcement on mloss.org.
|