← Search

Hua Jiang

7 accepted papers

2025

GCTAM: Global and Contextual Truncated Affinity Combined Maximization Model For Unsupervised Graph Anomaly Detection

IJCAI 2025

Anomalies often occur in real-world information networks/graphs, such as malevolent users, malicious comments, banned users, and fake news in social graphs. The latest graph anomaly detection methods use a novel mechanism called truncated affinity maximization (TAM) to detect anomaly nodes without u

2024

Leveraging Noisy Labels of Nearest Neighbors for Label Correction and Sample Selection

ICASSP 2024accepted

Dealing with noisy labels (LNL) emerges as a critical challenge when applying deep learning (DL) in practical settings. Previous methodologies primarily concentrated on harnessing model predictions to mitigate the impact of noisy labels. Nevertheless, their efficacy is strongly contingent on the acc…

Cited by 0SourceScholar
2023

A Refined Upper Bound and Inprocessing for the Maximum K-plex Problem

IJCAI 2023poster

A k-plex of a graph G is an induced subgraph in which every vertex has at most k-1 nonadjacent vertices. The Maximum k-plex Problem (MKP) consists in finding a k-plex of the largest size, which is NP-hard and finds many applications. Existing exact algorithms mainly implement a branch-and-bound appr…

2023

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem

AAAI 2023technical

Maximum Common Induced Subgraph (MCIS) is an important NP-hard problem with wide real-world applications. An efficient class of MCIS algorithms uses Branch-and-Bound (BnB), consisting in successively selecting vertices to match and pruning when it is discovered that a solution better than the best s…

Cited by 3SourcePDFScholar
2022

Cross-Utterance Conditioned VAE for Non-Autoregressive Text-to-Speech

ACL 2022long

Modelling prosody variation is critical for synthesizing natural and expressive speech in end-to-end text-to-speech (TTS) systems. In this paper, a cross-utterance conditional VAE (CUC-VAE) is proposed to estimate a posterior probability distribution of the latent prosody features for each phoneme b…

2021

A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem

IJCAI 2021poster

Given an undirected graph, the Maximum k-plex Problem (MKP) is to find a largest induced subgraph in which each vertex has at most k−1 non-adjacent vertices. The problem arises in social network analysis and has found applications in many important areas employing graph-based data mining. Existing e…