Issue Downloads
ID-SR: Privacy-Preserving Social Recommendation Based on Infinite Divisibility for Trustworthy AI
- Jingyi Cui,
- Guangquan Xu,
- Jian Liu,
- Shicheng Feng,
- Jianli Wang,
- Hao Peng,
- Shihui Fu,
- Zhaohua Zheng,
- Xi Zheng,
- Shaoying Liu
Recommendation systems powered by artificial intelligence (AI) are widely used to improve user experience. However, AI inevitably raises privacy leakage and other security issues due to the utilization of extensive user data. Addressing these challenges ...
Mixed Graph Contrastive Network for Semi-supervised Node Classification
Graph Neural Networks (GNNs) have achieved promising performance in semi-supervised node classification in recent years. However, the problem of insufficient supervision, together with representation collapse, largely limits the performance of the GNNs in ...
Fair Feature Selection: A Causal Perspective
Fair feature selection for classification decision tasks has recently garnered significant attention from researchers. However, existing fair feature selection algorithms fall short of providing a full explanation of the causal relationship between ...
FairGAT: Fairness-Aware Graph Attention Networks
Graphs can facilitate modeling various complex systems such as gene networks and power grids as well as analyzing the underlying relations within them. Learning over graphs has recently attracted increasing attention, particularly graph neural network (...
Dual-Side Adversarial Learning Based Fair Recommendation for Sensitive Attribute Filtering
With the development of recommendation algorithms, researchers are paying increasing attention to fairness issues such as user discrimination in recommendations. To address these issues, existing works often filter users’ sensitive information that may ...
Automatically Inspecting Thousands of Static Bug Warnings with Large Language Model: How Far Are We?
Static analysis tools for capturing bugs and vulnerabilities in software programs are widely employed in practice, as they have the unique advantages of high coverage and independence from the execution environment. However, existing tools for analyzing ...
Attacking Social Media via Behavior Poisoning
Since social media such as Facebook and X (formerly known as Twitter) have permeated various aspects of daily life, people have strong incentives to influence information dissemination on these platforms and differentiate their content from the fierce ...
Properties of Fairness Measures in the Context of Varying Class Imbalance and Protected Group Ratios
- Dariusz Brzezinski,
- Julia Stachowiak,
- Jerzy Stefanowski,
- Izabela Szczech,
- Robert Susmaga,
- Sofya Aksenyuk,
- Uladzimir Ivashka,
- Oleksandr Yasinskyi
Society is increasingly relying on predictive models in fields like criminal justice, credit risk management, and hiring. To prevent such automated systems from discriminating against people belonging to certain groups, fairness measures have become a ...
TOMGPT: Reliable Text-Only Training Approach for Cost-Effective Multi-modal Large Language Model
Multi-modal large language models (MLLMs), such as GPT-4, exhibit great comprehension capabilities on human instruction, as well as zero-shot ability on new downstream multi-modal tasks. To integrate the different modalities within a unified embedding ...
A Fully Test-time Training Framework for Semi-supervised Node Classification on Out-of-Distribution Graphs
Graph neural networks (GNNs) have shown great potential in representation learning for various graph tasks. However, the distribution shift between the training and test sets poses a challenge to the efficiency of GNNs. To address this challenge, HomoTTT ...
A Survey of Trustworthy Representation Learning Across Domains
As AI systems have obtained significant performance to be deployed widely in our daily lives and human society, people both enjoy the benefits brought by these technologies and suffer many social issues induced by these systems. To make AI systems good ...
SA2E-AD: A Stacked Attention Autoencoder for Anomaly Detection in Multivariate Time Series
Anomaly detection for multivariate time series is an essential task in the modern industrial field. Although several methods have been developed for anomaly detection, they usually fail to effectively exploit the metrical-temporal correlation and the ...
Towards Robust Rumor Detection with Graph Contrastive and Curriculum Learning
Establishing a robust rumor detection model is vital in safeguarding the veracity of information on social media platforms. However, existing approaches to stopping rumor from spreading rely on abundant and clean training data, which is rarely available ...
Toward Few-Label Vertical Federated Learning
Federated Learning (FL) provides a novel paradigm for privacy-preserving machine learning, enabling multiple clients to collaborate on model training without sharing private data. To handle multi-source heterogeneous data, Vertical Federated Learning (VFL)...
LMACL: Improving Graph Collaborative Filtering with Learnable Model Augmentation Contrastive Learning
Graph collaborative filtering (GCF) has achieved exciting recommendation performance with its ability to aggregate high-order graph structure information. Recently, contrastive learning (CL) has been incorporated into GCF to alleviate data sparsity and ...
Enhancing Unsupervised Outlier Model Selection: A Study on IREOS Algorithms
Outlier detection stands as a critical cornerstone in the field of data mining, with a wide range of applications spanning from fraud detection to network security. However, real-world scenarios often lack labeled data for training, necessitating ...
Congestion-aware Spatio-Temporal Graph Convolutional Network-based A* Search Algorithm for Fastest Route Search
The fastest route search, which is to find a path with the shortest travel time when the user initiates a query, has become one of the most important services in many map applications. To enhance the user experience of travel, it is necessary to achieve ...
Computing Random Forest-distances in the presence of missing data
In this article, we study the problem of computing Random Forest-distances in the presence of missing data. We present a general framework which avoids pre-imputation and uses in an agnostic way the information contained in the input points. We centre our ...
Distributed Pseudo-Likelihood Method for Community Detection in Large-Scale Networks
This paper proposes a distributed pseudo-likelihood method (DPL) to conveniently identify the community structure of large-scale networks. Specifically, we first propose a block-wise splitting method to divide large-scale network data into several ...
FETILDA: Evaluation Framework for Effective Representations of Long Financial Documents
In the financial sphere, there is a wealth of accumulated unstructured financial data, such as the textual disclosure documents that companies submit on a regular basis to regulatory agencies, such as the Securities and Exchange Commission. These ...