ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2505.09516
  4. Cited By
Depth-Based Local Center Clustering: A Framework for Handling Different Clustering Scenarios

Depth-Based Local Center Clustering: A Framework for Handling Different Clustering Scenarios

14 May 2025
Siyi Wang
Alexandre Leblanc
Paul D. McNicholas
ArXiv (abs)PDFHTML

Papers citing "Depth-Based Local Center Clustering: A Framework for Handling Different Clustering Scenarios"

4 / 4 papers shown
Title
CRAD: Clustering with Robust Autocuts and Depth
CRAD: Clustering with Robust Autocuts and Depth
Xin Huang
Yulia R. Gel
128
9
0
08 Apr 2019
EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm
  Based on kNN Graph
EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph
Cong Fu
Deng Cai
98
110
0
23 Sep 2016
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Ehsan Elhamifar
René Vidal
116
2,335
0
05 Mar 2012
A Tutorial on Spectral Clustering
A Tutorial on Spectral Clustering
U. V. Luxburg
290
10,543
0
01 Nov 2007
1