ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2003.10038
  4. Cited By
Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE
v1v2v3 (latest)

Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE

IEEE Journal on Selected Areas in Information Theory (JSAIT), 2020
23 March 2020
Jeonghwa Lee
Daesung Kim
Hye Won Chung
ArXiv (abs)PDFHTML

Papers citing "Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE"

9 / 9 papers shown
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite
  Graphs with the Spectral Method
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral MethodElectronic Journal of Statistics (EJS), 2023
Guillaume Braun
384
3
0
14 Apr 2023
Multilayer hypergraph clustering using the aggregate similarity matrix
Multilayer hypergraph clustering using the aggregate similarity matrixWorkshop on Algorithms and Models for the Web-Graph (WAW), 2023
Kalle Alaluusua
Konstantin Avrachenkov
B. K. Shreyamsha Kumar
Lasse Leskelä
423
6
0
27 Jan 2023
Community Detection in the Hypergraph SBM: Exact Recovery Given the
  Similarity Matrix
Community Detection in the Hypergraph SBM: Exact Recovery Given the Similarity Matrix
Julia Gaudio
Nirmit Joshi
324
9
0
23 Aug 2022
Sparse random hypergraphs: Non-backtracking spectra and community
  detection
Sparse random hypergraphs: Non-backtracking spectra and community detectionIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022
Ludovic Stephan
Yizhe Zhu
376
31
0
14 Mar 2022
Partial recovery and weak consistency in the non-uniform hypergraph
  Stochastic Block Model
Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block ModelCombinatorics, probability & computing (CPC), 2021
Ioana Dumitriu
Haixiao Wang
Yizhe Zhu
303
17
0
22 Dec 2021
A Worker-Task Specialization Model for Crowdsourcing: Efficient
  Inference and Fundamental Limits
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental LimitsIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2021
Doyeon Kim
Jeonghwa Lee
Hye Won Chung
394
6
0
19 Nov 2021
Exact Recovery in the General Hypergraph Stochastic Block Model
Exact Recovery in the General Hypergraph Stochastic Block ModelIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2021
Q. Zhang
Vincent Y. F. Tan
271
29
0
11 May 2021
Crowdsourced Labeling for Worker-Task Specialization Model
Crowdsourced Labeling for Worker-Task Specialization ModelInternational Symposium on Information Theory (ISIT), 2020
Doyeon Kim
Hye Won Chung
FedML
395
1
0
21 Mar 2020
Binary Classification with XOR Queries: Fundamental Limits and An
  Efficient Algorithm
Binary Classification with XOR Queries: Fundamental Limits and An Efficient AlgorithmIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2020
Daesung Kim
Hye Won Chung
232
3
0
31 Jan 2020
1
Page 1 of 1