Contextually Affinitive Neighborhood Refinery for Deep Clustering

• URL: http://arxiv.org/abs/2312.07806v2
• Date: Mon, 4 Mar 2024 13:39:52 GMT
• Title: Contextually Affinitive Neighborhood Refinery for Deep Clustering
• Abstract summary: We propose an efficient online re-ranking process to mine more informative neighbors in a Contextually Affinitive (ConAff) Neighborhood. Our method can be easily integrated into the generic self-supervised frameworks and outperforms the state-of-the-art methods on several popular benchmarks.
• Score: 13.48547883315848
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Previous endeavors in self-supervised learning have enlightened the research of deep clustering from an instance discrimination perspective. Built upon this foundation, recent studies further highlight the importance of grouping semantically similar instances. One effective method to achieve this is by promoting the semantic structure preserved by neighborhood consistency. However, the samples in the local neighborhood may be limited due to their close proximity to each other, which may not provide substantial and diverse supervision signals. Inspired by the versatile re-ranking methods in the context of image retrieval, we propose to employ an efficient online re-ranking process to mine more informative neighbors in a Contextually Affinitive (ConAff) Neighborhood, and then encourage the cross-view neighborhood consistency. To further mitigate the intrinsic neighborhood noises near cluster boundaries, we propose a progressively relaxed boundary filtering strategy to circumvent the issues brought by noisy neighbors. Our method can be easily integrated into the generic self-supervised frameworks and outperforms the state-of-the-art methods on several popular benchmarks.

Related papers

• ANFI: Rethinking Neighbor Feature Interaction in Person Re-ID [55.27872970486155]
  We propose a novel Adaptive Neighbor Feature Interaction (ANFI) method for person re-identification.<n>ANFI accounts for negative effects from noisy neighbors, allowing samples to remain distinguishable from false positive neighbors.<n>In addition, we propose Noisy Relation Supervision (NRS) to train ANFI, gradually injecting robustness to noisy relations into the model.
  arXiv  Detail & Related papers  (2026-07-28T08:06:44Z)
• Unleashing the Potential of Neighbors: Diffusion-based Latent Neighbor Generation for Session-based Recommendation [51.74332787641956]
  Session-based recommendation aims to predict the next item that anonymous users may be interested in, based on their current session interactions.<n>Recent studies have demonstrated that retrieving neighbor sessions to augment the current session can effectively alleviate the data sparsity issue.<n>We propose a novel model of diffusion-based latent neighbor generation for session-based recommendation, named DiffSBR.
  arXiv  Detail & Related papers  (2026-01-07T13:14:12Z)
• Learning Cluster Representatives for Approximate Nearest Neighbor Search [0.0]
  This thesis provides a comprehensive explanation of clustering-based approximate nearest neighbor search. It also introduces and delve into every aspect of our novel state-of-the-art method. The development of this intuition and applying it to maximum inner product search has led us to demonstrate that learning cluster representatives using a simple linear function significantly boosts the accuracy of clustering-based approximate nearest neighbor search.
  arXiv  Detail & Related papers  (2024-12-08T12:31:32Z)
• Comparative Study of Neighbor-based Methods for Local Outlier Detection [4.556974104115929]
  This paper studies the neighbor in the existing outlier detection algorithms and a taxonomy is introduced, which uses the three-level components of information, neighbor and methodology to define hybrid methods. The results show that reverse K-nearest neighbor based methods achieve promising performance and dynamic selection method is suitable for working in high-dimensional space.
  arXiv  Detail & Related papers  (2024-05-29T16:28:12Z)
• Neighbour Consistency Guided Pseudo-Label Refinement for Unsupervised Person Re-Identification [80.98291772215154]
  Unsupervised person re-identification (ReID) aims at learning discriminative identity features for person retrieval without any annotations. Recent advances accomplish this task by leveraging clustering-based pseudo labels. We propose a Neighbour Consistency guided Pseudo Label Refinement framework.
  arXiv  Detail & Related papers  (2022-11-30T09:39:57Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Reformulating Speaker Diarization as Community Detection With Emphasis On Topological Structure [10.508187462682308]
  Clustering-based speaker diarization has stood firm as one of the major approaches in reality. We propose to view clustering-based diarization as a community detection problem.
  arXiv  Detail & Related papers  (2022-04-26T07:18:05Z)
• XPROAX-Local explanations for text classification with progressive neighborhood approximation [13.312630052709766]
  We propose a progressive approximation of the neighborhood using counterfactual instances as initial landmarks. We then refine counterfactuals and generate factuals in the neighborhood of the input instance to be explained. Our experiments on real-world datasets demonstrate that our method outperforms the competitors in terms of usefulness and stability.
  arXiv  Detail & Related papers  (2021-09-30T11:01:07Z)
• Modelling Neighbor Relation in Joint Space-Time Graph for Video Correspondence Learning [53.74240452117145]
  This paper presents a self-supervised method for learning reliable visual correspondence from unlabeled videos. We formulate the correspondence as finding paths in a joint space-time graph, where nodes are grid patches sampled from frames, and are linked by two types of edges. Our learned representation outperforms the state-of-the-art self-supervised methods on a variety of visual tasks.
  arXiv  Detail & Related papers  (2021-09-28T05:40:01Z)
• Correlation Clustering Reconstruction in Semi-Adversarial Models [70.11015369368272]
  Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a latent clustering corrupted by random noise and adversarial modifications.
  arXiv  Detail & Related papers  (2021-08-10T14:46:17Z)
• Refining Pseudo Labels with Clustering Consensus over Generations for Unsupervised Object Re-identification [84.72303377833732]
  Unsupervised object re-identification targets at learning discriminative representations for object retrieval without any annotations. We propose to estimate pseudo label similarities between consecutive training generations with clustering consensus and refine pseudo labels with temporally propagated and ensembled pseudo labels. The proposed pseudo label refinery strategy is simple yet effective and can be seamlessly integrated into existing clustering-based unsupervised re-identification methods.
  arXiv  Detail & Related papers  (2021-06-11T02:42:42Z)
• Weighted Sparse Subspace Representation: A Unified Framework for Subspace Clustering, Constrained Clustering, and Active Learning [0.3553493344868413]
  We first propose a novel spectral-based subspace clustering algorithm that seeks to represent each point as a sparse convex combination of a few nearby points. We then extend the algorithm to constrained clustering and active learning settings. Our motivation for developing such a framework stems from the fact that typically either a small amount of labelled data is available in advance; or it is possible to label some points at a cost.
  arXiv  Detail & Related papers  (2021-06-08T13:39:43Z)
• Panoster: End-to-end Panoptic Segmentation of LiDAR Point Clouds [81.12016263972298]
  We present Panoster, a novel proposal-free panoptic segmentation method for LiDAR point clouds. Unlike previous approaches, Panoster proposes a simplified framework incorporating a learning-based clustering solution to identify instances. At inference time, this acts as a class-agnostic segmentation, allowing Panoster to be fast, while outperforming prior methods in terms of accuracy.
  arXiv  Detail & Related papers  (2020-10-28T18:10:20Z)
• A flexible outlier detector based on a topology given by graph communities [0.0]
  anomaly detection is essential for optimal performance of machine learning methods and statistical predictive models. Topology is computed using the communities of a weighted graph codifying mutual nearest neighbors in the feature space. Our approach overall outperforms, both, local and global strategies in multi and single view settings.
  arXiv  Detail & Related papers  (2020-02-18T18:40:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.