Loading [MathJax]/extensions/MathMenu.js
Xiaoran Yan - IEEE Xplore Author Profile

Showing 1-12 of 12 results

Results

Federated learning has a wide range of applications in recommendation systems, but most federated recommendation systems can only achieve federated communication between users and servers. Only a few are vertical federated recommendation systems, achieving federated server communication. In addition, the current federated recommendation frameworks require that each participant have the same model....Show More
In the field of vision-language models (VLMs), human action recognition models, while effective, always rely on large pre-trained models or high-resolution inputs, leading to computational challenges. To address this, we propose a novel VLM approach with fine-grained attention to body movements. Unlike methods relying on coarse video-text matching, we guide the model to infer actions from fine-gra...Show More
Multivariate time series anomaly detection plays a crucial role in industrial production. However, the inherent complexity and randomness of time series pose significant challenges. Furthermore, existing detection methods struggle to provide reliable explanations for outliers. To address these issues, this paper presents an unsupervised multivariate time series anomaly detection model named Point-...Show More
Attribute graph anomaly detection aims to identify nodes that significantly deviate from the majority of normal nodes, and has received increasing attention due to the ubiquity and complexity of graph-structured data in various real-world scenarios. However, current mainstream anomaly detection methods are primarily designed for centralized settings, which may pose privacy leakage risks in certain...Show More
With the development of deep learning, people are more and more concerned about the security of data. Federated learning can solve the problem of data island, but it also brings more serious data privacy problems. Furthermore, in the process of multisource data collaboration, the efficiency of the whole federated learning system is usually not high. In this article, we introduce a scheme named FVF...Show More
Network embedding aims to represent nodes with low dimensional vectors while preserving structural information. It has been recently shown that many popular network embedding methods can be transformed into matrix factorization problems. In this paper, we propose the unifying framework “Z-NetMF,” which generalizes random walk samplers to Z-Laplacian graph filters, leading to embedding algorithms w...Show More
The meta information in scientific literature including article title, author, institutions, year, journal, etc., plays a critical role in providing useful information to research peers. Traditional meta information extraction methods usually rely on rules and templates. Recently, due to the booming of Large Language Models (LLMs), its application in scientific literature meta-information extracti...Show More
Data privacy is an essential issue in publishing data visualizations. However, it is challenging to represent multiple data patterns in privacy-preserving visualizations. The prior approaches target specific chart types or perform an anonymization model uniformly without considering the importance of data patterns in visualizations. In this paper, we propose a visual analytics approach that facili...Show More
In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas, such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, and national security. However, subgraph matching remains a computationally challenging problem, let alone identifying special motifs among them. This i...Show More
We propose a information theoretical framework to capture transition and information costs of network navigation models. Based on the minimum description length principle and the Markov decision process, we demonstrate that efficient global navigation can be achieved with only partial information. Additionally, we derived a scalable algorithm for optimal solutions under certain conditions. The pro...Show More
In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form of different graph shifts and their induced algebraic systems. In this paper, we propose the unifying Z-Laplacian framework, whose instances can act as graph sh...Show More
A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links. Despite its flexibility and popularity, there has been a lack of principled statistical model selection criteria for the stochastic block model. Here we propose a ...Show More