Longfeng Wu

dblp:256/5049 · DBLP profile ↗
← Back
6ranked-venue papers in the field
5as first author
6since 2021 · last 2025
0000-0001-7422-4398ORCID · corroborated

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4 (3 first)Information Retrieval & Web Search · 1 (1 first)Big Data, Cloud & Distributed Data Systems · 1 (1 first)
YearPublicationVenuePosition
2025 Bi-NAS: Towards Effective and Personalized Explanation for Recommender Systems via Bi-Level Neural Architecture Search
abstract
Recommender systems are vital in helping users navigate vast amounts of information, offering personalized suggestions and effective explanations for these recommendations. While previous efforts have attempted to provide such explanations, evaluating their effectiveness across various scenarios remains a challenge. Enhancing these explanations is essential for improving user engagement, trust, and decision-making. To facilitate effective explanations within the recommender system, we propose a Bi-level Neural Architecture Search (Bi-NAS) frame-work to optimize explanations. This approach simultaneously refines cross-attention mechanisms and feature interaction functions by exploring both intra-layer and inter-layer design spaces. Furthermore, we integrate Large Language Models (LLMs) to enhance explanation generation, leveraging zero-shot prompting to produce more effective and personalized justifications. By aligning user feature preferences with item quality scores, our approach ensures that explanations reflect both user intent and item attributes, improving transparency and reasoning depth. Extensive evaluations on four real-world datasets demonstrate that Bi-NAS not only boosts recommendation accuracy but also significantly improves the effectiveness of explanations for recommender systems, providing users with clear and reliable insights into the suggestions they receive. Meanwhile, we publish our data and code at https://github.com/wulongfeng/Bi-NAS.git.
Longfeng Wu, Yao Zhou 0003, Tong Zeng, Zhimin Peng, Bhanu Pratap Singh Rawat, Lecheng Zheng, Giovanni Seni, Dawei Zhou 0003
ICDM1
2025 Are Vision LLMs Road-Ready? A Comprehensive Benchmark for Safety-Critical Driving Video Understanding
abstract
Vision Large Language Models (VLLMs) have demonstrated impressive capabilities in general visual tasks such as image captioning and visual question answering.However, their effectiveness in specialized, safety-critical domains like autonomous driving remains largely unexplored.Autonomous driving systems require sophisticated scene understanding in complex environments, yet existing multimodal benchmarks primarily focus on normal driving conditions, failing to adequately assess VLLMs' performance in safety-critical scenarios.To address this, we introduce DVBench-a pioneering benchmark designed to evaluate the performance of VLLMs in understanding safety-critical driving videos.Built around a hierarchical ability taxonomy that aligns with widely adopted frameworks for describing driving scenarios used in assessing highly automated driving systems, DVBench features 10,000 multiple-choice questions with human-annotated ground-truth answers , enabling a comprehensive evaluation of VLLMs' capabilities in perception and reasoning.Experiments on 14 state-of-the-art VLLMs, ranging from 0.5B to 72B parameters, reveal significant performance gaps, with no model achieving over 40% accuracy, highlighting critical limitations in understanding complex driving scenarios.To probe adaptability, we fine-tuned selected models using domain-specific data from DVBench, achieving accuracy gains ranging from 5.24 to 10.94 percentage points, with relative improvements of up to 43.59%.This improvement underscores the
Tong Zeng, Longfeng Wu, Dawei Zhou 0003
KDD (2)2
2025 Bridging Fairness and Uncertainty: Theoretical Insights and Practical Strategies for Equalized Coverage in GNNs
abstract
Graph Neural Networks (GNNs) have become indispensable tools in many domains, such as social network analysis, financial fraud detection, and drug discovery. Prior research primarily concentrated on improving prediction accuracy while overlooking how reliable the model predictions are. Conformal prediction on graphs emerges as a promising solution, offering statistically sound uncertainty estimates with a pre-defined coverage level. Despite the promising progress, existing works only focus on achieving model coverage guarantees without considering fairness in the coverage within different demographic groups. To bridge the gap between conformal prediction and fair coverage across different groups, we pose the fundamental question: Can fair GNNs enable the uncertainty estimates to be fairly applied across demographic groups? To answer this question, we provide a comprehensive analysis of the uncertainty estimation in fair GNNs employing various strategies. We prove theoretically that fair GNNs can enforce consistent uncertainty bounds across different demographic groups, thereby minimizing bias in uncertainty estimates. Furthermore, we conduct extensive experiments on five commonly used datasets across seven state-of-the-art fair GNN models to validate our theoretical findings. Additionally, based on the theoretical and empirical insights, we identify and analyze the key strategies from various fair GNN models that contribute to ensuring equalized uncertainty estimates. Our work estimates a solid foundation for future exploration of the practical implications and potential adjustments needed to enhance fairness in GNN applications across various domains. For reproducibility, we publish our data and code at https://github.com/wulongfeng/EqualizedCoverage_CP.
Longfeng Wu, Yao Zhou 0003, Jian Kang 0008, Dawei Zhou 0003
WWW1
2024 Towards Trustworthy Graph Neural Networks and Their Applications in Recommender Systems
abstract
Graph Neural Networks have demonstrated remarkable success in modeling graph-structured data and are increasingly applied in various domains, including recommendation, drug discovery, and financial analysis. However, concerns regarding their trustworthiness, due to issues like data noise sensitivity, interpretability, and fairness, hinder widespread adoption. This research aims to enhance GNNs trustworthiness from three critical perspectives: reliability, explainability, and fairness. We introduce novel methods, including incorporating logical reasoning and model calibration techniques to ensure robust and reliable predictions, employing neural architecture to search for effective explanations, and analyzing the uncertainty quantification in fair GNNs with various strategies. This work establishes foundational insights and strategies for developing trustworthy GNNs, paving the way for equitable and transparent predictions in high-stakes applications.
Longfeng Wu
IEEE Big Data1
2023 Towards Reliable Rare Category Analysis on Graphs via Individual Calibration
abstract
Rare categories abound in a number of real-world networks and play a pivotal role in a variety of high-stakes applications, including financial fraud detection, network intrusion detection, and rare disease diagnosis. Rare category analysis (RCA) refers to the task of detecting, characterizing, and comprehending the behaviors of minority classes in a highly-imbalanced data distribution. While the vast majority of existing work on RCA has focused on improving the prediction performance, a few fundamental research questions heretofore have received little attention and are less explored: How confident or uncertain is a prediction model in rare category analysis? How can we quantify the uncertainty in the learning process and enable reliable rare category analysis?
Longfeng Wu, Bowen Lei, Dongkuan Xu, Dawei Zhou 0003
KDD1
2022 Towards High-Order Complementary Recommendation via Logical Reasoning Network
abstract
Complementary recommendation gains increasing attention in e-commerce since it expedites the process of finding frequently-bought-with products for users in their shopping journey. Therefore, learning the product representation that can reflect this complementary relationship plays a central role in modern recommender systems. In this work, we propose a logical reasoning network, LOGIREC, to effectively learn embeddings of products as well as various transformations (projection, intersection, negation) between them. LOGIREC is capable of capturing the asymmetric complementary relationship between products and seamlessly extending to high-order recommendations where more comprehensive and meaningful complementary relationship is learned for a query set of products. Finally, we further propose a hybrid network that is jointly optimized for learning a more generic product representation. We demonstrate the effectiveness of our LOGIREC on multiple public real-world datasets in terms of various ranking-based metrics under both low-order and high-order recommendation scenarios.
Longfeng Wu, Yao Zhou 0003, Dawei Zhou 0003
ICDM1