Cohesive subgraph mining in hypergraphs has recently attracted increasing research attention due to its broad applicability in domains such as social networks, co-authorship networks, and recommendation systems. An important model, the hyper
k
-truss, is defined as a maximal cohesive subgraph in which each hyper-ed...
Hao-Zhe Yin, Kai Wang, Wen-Jie Zhang et al.· Proceedings of the VLDB Endo...· 0 citations
This work provides the first formal analysis of HTSA, proving its NP-hardness and showing that the objective is neither monotone nor submodular, and proposes OSS, whose discretized search provides a 1/alpha-approximation guarantee for each single optimal-subtree computation.
Yihan Wu, Xuliang Zhu, Guozhong Li et al.· Proceedings of the 32nd ACM...· 0 citations
LUCID, an LLM-guided, interpretable, training-free, and unsupervised community detection method, designed as a four-stage pipeline that achieves state-of-the-art performance and consistently outperforms leading unsupervised and semi-supervised baselines.
Aoting Zeng, Kai Wang, Jianwei Wang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.