KNNCC: An Algorithm for K-Nearest Neighbor Clique Clustering

K-nearest neighbor algorithm is the most widely used classification and clustering algorithm. It is simple, fast, straight and effective. However, the relationship between the nearest items is a partial order. Since it is not a strong conjunction, items could be clustered by force. To that end, in this paper, we propose a concept of k-nearest neighbor clique based on k-nearest neighbors and reversed k-nearest neighbors. First, by measuring the similarity between items, we select the items that form the pairs of mutually k-nearest neighbor and reversed k-nearest neighbor. These items are used to construct k-nearest neighbor cliques. Since the relationship between items in the same clique is a total order, they have a high similarity to each other. Then, we use the cliques as new data to seed clustering in the next round. This process is repeated until some conditions are satisfied. Finally, the experiments on the real-world datasets validate the effectiveness of our proposed algorithm.