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
Online social networks have emerged as prominent platforms for individuals to rapidly share ideas and perspectives. However, their swift dissemination capabilities also make them powerful channels for the spread of misinformation. Such dissemination results in substantial economic and societal harm, highlighting the ne...
Jing-Hao Wang, Yan-Ping Wu, Xiao-Yang Wang et al.· The VLDB journal· 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
The proposed AHEAD, an unsupervised anti-hallucination anomaly detection framework featuring a hallucination refinement pipeline and a temporal-structural detector, which is compatible with various T-GNN backbones for reliable anomaly detection on CTDGs.
Yingxuan Li, Yuanyuan Xu, Xue-Min Lin et al.· Proceedings of the 32nd ACM...· 0 citations
Temporal graph neural networks (T-GNNs) are powerful for representation learning on continuous-time dynamic graphs (CTDGs), but naively applying them to unsupervised anomaly detection is often unreliable. The key challenge is learning normal dynamics while being exposed to unlabeled anomalies, which destabilizes optimi...
Yingxuan Li, Yuanyuan Xu, Xuemin Lin et al.· Proceedings of the 32nd ACM...· 0 citations
This survey model agent state as a dynamic graph, where memories, tools, skills, workflows, and inter-agent relations are represented as typed nodes, edges, and subgraphs updated through schema-constrained rewrites to provide a compact structural lens for designing and governing self-evolving agents.
Yuanyuan Xu, Wenjie Zhang, Yin Chen et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
