Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiaowen Ji

dblp:21/54 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 83% Language models and text generation · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph anomaly detection
dynamic graph anomaly detection
0.812024
AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models · ICDM 2024
Machine learning › Graph learning › dynamic graph learning
dynamic network embedding
0.812024
AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models · ICDM 2024
Machine learning › Graph learning
graph representation learning
0.812024
AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models · ICDM 2024
Natural language and speech › Language models and text generation
in-context learning
0.212024
AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models · ICDM 2024
Natural language and speech › Language models and text generation
prompting
0.212024
AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models · ICDM 2024

Methods — techniques the papers use, named apart from their topics

prototype reprogramming · 0.8large language model · 0.8in-context learning · 0.8dynamic-aware encoder · 0.8
YearPublicationVenuePosition
2024 AnomalyLLM: Few-Shot Anomaly Edge Detection for Dynamic Graphs Using Large Language Models
abstract
Detecting anomaly edges for dynamic graphs aims to identify edges significantly deviating from the normal pattern and can be applied in various domains, such as cybersecurity, financial transactions and AIOps. With the evolving of time, the types of anomaly edges are emerging and the labeled anomaly samples are few for each type. Current methods are either designed to detect randomly inserted edges or require sufficient labeled data for model training, which harms their applicability for real-world applications. In this paper, we study this problem by cooperating with the rich knowledge encoded in large language models(LLMs) and propose a method, namely AnomalyLLM. To align the dynamic graph with LLMs, AnomalyLLM pretrains a dynamic-aware encoder to generate the representations of edges and reprograms the edges using the prototypes of word embeddings. Along with the encoder, we design an in-context learning framework that integrates the information of a few labeled samples to achieve few-shot anomaly detection. Experiments on four datasets reveal that AnomalyLlmcan not only significantly improve the performance of few-shot anomaly detection, but also achieve superior results on new anomalies without any update of model parameters.
Di Yao 0001, Lanting Fang, Zhetao Li, Wenbin Li 0012, Kaiyu Feng, Xiaowen Ji, Jingping Bi
ICDM7
2021 An OT-ET Analysis of Polish Singular-Plural Pairs
Xiaowen Ji, Jincheng Ni
ACM Trans. Asian Low Resour. Lang. Inf. Process.1
2003 Non-Photorealistic Rendering and Content-Based Image Retrieval
abstract
In this paper, we will show how non-photorealistic rendering (NPR) can take a new role in content-based image retrieval (CBIR). The proposed CBIR method applies a novel image similarity measure: unlike traditional features like color, texture, or shape, our measure is based on a painted representation of the original image. This is produced by a stochastic paintbrush algorithm which simulates a painting process. We use the stroke parameters (color, size, orientation, and location) as features and similarity is measured by matching strokes of a pair of images. The advantage of our approach is that it provides information not only about the color content but also about the structural properties of an image without the segmentation of the image. Experimental results show that the CBIR method using paintbrush features has higher retrieval rate than traditional methods using color or texture features only.
Xiaowen Ji, Zoltan Kato
PG1
2002 Content-based image retrieval using stochastic paintbrush transformation
abstract
We propose a new content based image retrieval method. The novelty of our approach lies in the applied image similarity measure: unlike traditional features, such as color, texture or shape, our measure is based on a painted representation of the original image. We use paintbrush stroke parameters as features. These strokes are produced by a stochastic paintbrush algorithm which simulates a painting process. Stroke parameters include color, orientation and location. Therefore, it provides information not only about the color content but also about the structural properties of an image. Experimental results on a database of more than 500 images show that the CBIR method using paintbrush features has a higher retrieval rate than methods using color features only.
Zoltan Kato, Xiaowen Ji, Tamás Szirányi, Zoltán Tóth, László Czúni
ICIP (1)2