EDBT 2026 Demo / reviewers in the wild / expert
Ling Cheng 0002
dblp:69/764-2
· DBLP profile ↗
7ranked-venue papers in the field
5as first author
7since 2021 · last 2026
0000-0002-2834-9728ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 4 (2 first)Database Systems & Data Management · 2 (2 first)Big Data, Cloud & Distributed Data Systems · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LLM-based Few-Shot Early Rumor Detection with Imitation Agent
Fengzhu Zeng, Qian Shao, Ling Cheng 0002, Wei Gao 0001, Shih-Fen Cheng, Jing Ma 0004, Cheng Niu |
KDD (1) | 3 |
| 2026 | Clique Annealing: Semi-Supervised Community Detection Under Crystallization KineticsabstractSemi-supervised community detection seeks to find a specified community type when only few communities are labeled. Existing “select-then-refine” pipelines often start from mis-aligned cores and rely on Reinforcement-Learning or Gen-erative Adversarial Network, increasing computational cost and limiting scalability. We address these issues with a unified energy framework under crystallization kinetics that jointly models energy, structure, and growth. Based on this perspective, we pro-pose CLique ANNealing (CLANN), which first employs Nucleus Proposer to select candidate clique as community core under four physics-inspired criteria. A learning-free Transitive Annealer then iteratively merges neighboring cliques and repositions the nucleus, enabling spontaneous, scalable community growth. Evaluated on diverse real-world and synthetic networks, CLANN surpasses state-of-the-art baselines by a wide margin while running faster on large graphs, demonstrating that the energy-driven crystallization kinetics framework is both princi-pled and practical for semi-supervised community detection. Ling Cheng 0002, Jiashu Pu, Ruicheng Liang, Qian Shao, Hezhe Qiao, Feida Zhu 0001 |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2025 | Defending Federated Recommender Systems against Untargeted Attacks: A Contribution-Aware Robust Aggregation SchemeabstractFederated recommender systems (FedRSs) effectively tackle the tradeoff between recommendation accuracy and privacy preservation. However, recent studies have revealed severe vulnerabilities in FedRSs, particularly against untargeted attacks seeking to undermine their overall performance. Defense methods employed in traditional recommender systems are not applicable to FedRSs, and existing robust aggregation schemes for other federated learning-based applications have proven ineffective in FedRSs. Building on the observation that malicious clients contribute negatively to the training process, we design a novel contribution-aware robust aggregation scheme to defend FedRSs against untargeted attacks, named contribution-aware Bayesian knowledge distillation aggregation (ConDA), comprising two key components for the defense. In the first contribution estimation component, we decentralize the estimation from the server side to the client side and propose an ensemble-based Shapley value to enable the efficient calculation of contributions, addressing the limitations of lacking auxiliary validation data and high computational complexity. In the second contribution-aware aggregation component, we merge the decentralized contributions via a majority voting mechanism and integrate the merged contributions into a Bayesian knowledge distillation aggregation scheme for robust aggregation, mitigating the impact of unreliable contributions induced by attacks. We evaluate the effectiveness and efficiency of ConDA on two real-world datasets from movie and music service providers. Through extensive experiments, we demonstrate the superiority of ConDA over the baseline robust aggregation schemes. Ruicheng Liang, Yuan-Chun Jiang, Feida Zhu 0001, Ling Cheng 0002 |
ACM Trans. Knowl. Discov. Data | 4 |
| 2025 | Early Detection of Malicious Crypto Addresses With Asset Path Tracing and SelectionabstractIn response to the burgeoning cryptocurrency sector and its associated financial risks, there is a growing focus on detecting fraudulent activities and malicious addresses. Traditional studies are limited by their reliance on comprehensive historical data and address-wise manipulation, which are not available for early malice detection and fail to identify addresses controlled by the same fraudulent entity. We thus introduceEvolve Path Tracer, a novel solution designed for early malice detection in cryptocurrency. This system innovatively incorporates Asset Transfer Paths and corresponding path graphs in an evolve model, which effectively characterize rapidly evolving transaction patterns. First, for the target address, theClustering-based Path Selectorweight each Asset Transfer Path by finding sibling addresses along the Asset Transfer Paths.Evolve Path Encoder LSTMandEvolve Path Graph GCNthen encode the asset transfer path and path graph within a dynamic structure. Additionally, ourHierarchical Survival Predictorefficiently scales to predict the address labels, demonstrating high scalability and efficiency. We rigorously testedEvolve Path Traceron three real-world datasets of malicious addresses, where it consistently outperformed existing state-of-the-art methods. Our extensive scalability tests further confirmed the model's robust adaptability in dynamic prediction environments, highlighting its potential as a significant tool in the realm of cryptocurrency security. Ling Cheng 0002, Feida Zhu 0001, Qian Shao, Jiashu Pu, Fengzhu Zeng |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2024 | A Full-History Network Dataset for BTC Asset Decentralization ProfilingabstractSince its advent in 2009, Bitcoin (BTC) has garnered increasing attention from both academia and industry. However, due to the massive transaction volume, no systematic study has quantitatively measured the asset decentralization degree specifically from a network perspective.In this paper, by conducting a thorough analysis of the BTC transaction network, we first address the significant gap in the availability of full-history BTC graph and network property dataset, which spans over 15 years from the genesis block (1st March, 2009) to the 845651-th block (29, May 2024). We then present the first systematic investigation to profile BTC’s asset decentralization and design several decentralization degrees for quantification. Through extensive experiments, we emphasize the significant role of network properties and our network-based decentralization degree in enhancing Bitcoin analysis. Our findings demonstrate the importance of our comprehensive dataset and analysis in advancing research on Bitcoin’s transaction dynamics and decentralization, providing valuable insights into the network’s structure and its implications. The whole transaction data is available at dataset link. Ling Cheng 0002, Qian Shao, Fengzhu Zeng, Feida Zhu 0001 |
IEEE Big Data | 1 |
| 2024 | From Asset Flow to Status, Action, and Intention Discovery: Early Malice Detection in CryptocurrencyabstractCryptocurrency has been subject to illicit activities probably more often than traditional financial assets due to the pseudo-anonymous nature of its transacting entities. An ideal detection model is expected to achieve all three critical properties of early detection, good interpretability, and versatility for various illicit activities. However, existing solutions cannot meet all these requirements, as most of them heavily rely on deep learning without interpretability and are only available for retrospective analysis of a specific illicit type. To tackle all these challenges, we propose Intention Monitor for early malice detection in Bitcoin, where the on-chain record data for a certain address are much scarcer than other cryptocurrency platforms. We first define asset transfer paths with the Decision Tree based feature Selection and Complement to build different feature sets for different malice types. Then, the Status/Action Proposal module and the Intention-VAE module generate the status, action, intent-snippet, and hidden intent-snippet embedding. With all these modules, our model is highly interpretable and can detect various illegal activities. Moreover, well-designed loss functions further enhance the prediction speed and the model’s interpretability. Extensive experiments on three real-world datasets demonstrate that our proposed algorithm outperforms the state-of-the-art methods. Furthermore, additional case studies justify that our model not only explains existing illicit patterns but also can find new suspicious characters. Ling Cheng 0002, Feida Zhu 0001, Yong Wang 0021, Ruicheng Liang |
ACM Trans. Knowl. Discov. Data | 1 |
| 2023 | Evolve Path Tracer: Early Detection of Malicious Addresses in CryptocurrencyabstractWith the boom of cryptocurrency and its concomitant financial risk concerns, detecting fraudulent behaviors and associated malicious addresses has been drawing significant research effort. Most existing studies, however, rely on the full history features or full-fledged address transaction networks, both of which are unavailable in the problem of early malicious address detection and therefore failing them for the task. To detect fraudulent behaviors of malicious addresses in the early stage, we present Evolve Path Tracer, which consists of Evolve Path Encoder LSTM, Evolve Path Graph GCN, and Hierarchical Survival Predictor. Specifically, in addition to the general address features, we propose Asset Transfer Paths and corresponding path graphs to characterize early transaction patterns. Furthermore, since transaction patterns change rapidly in the early stage, we propose Evolve Path Encoder LSTM and Evolve Path Graph GCN to encode asset transfer path and path graph under an evolving structure setting. Hierarchical Survival Predictor then predicts addresses' labels with high scalability and efficiency. We investigate the effectiveness and generalizability of Evolve Path Tracer on three real-world malicious address datasets. Our experimental results demonstrate that Evolve Path Tracer outperforms the state-of-the-art methods. Extensive scalability experiments demonstrate the model's adaptivity under a dynamic prediction setting. Ling Cheng 0002, Feida Zhu 0001, Yong Wang 0021, Ruicheng Liang |
KDD | 1 |