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

Xiaonan Ji

dblp:23/2368 · DBLP profile ↗
← Back
14ranked-venue papers
9as first author
2since 2021 · last 2025
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 7 · 3 first-authorDatabases, data management, data science and information retrieval · 4 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 53% Data mining · 47%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › visual analytics
visual analytics system
0.412019
Visual Exploration of Neural Document Embedding in Information Retrieval: Semantics and Feature Selection · IEEE Trans. Vis. Comput. Graph. 2019
Data mining › dimensionality reduction
feature selection
0.112019
Visual Exploration of Neural Document Embedding in Information Retrieval: Semantics and Feature Selection · IEEE Trans. Vis. Comput. Graph. 2019
Data mining › pattern mining › subgroup discovery
contrast set mining
0.112005
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints · ICDM 2005
Data mining › pattern mining › sequential pattern mining
gap-constrained pattern mining
0.112005
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints · ICDM 2005
Data mining
pattern mining
0.112005
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints · ICDM 2005
Data mining › pattern mining
sequential pattern mining
0.112005
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints · ICDM 2005

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

visual analytics · 0.8neural document embedding · 0.8prefix growth · 0.1bitset operations · 0.1
YearPublicationVenuePosition
2025 GraFS: An Integrated GNN-LLM Approach for Inferring Best Functional Substitute Products
Favour Nerrise, Edward W. Huang, Xiaonan Ji, Karthik Subbian, Danai Koutra
CIKM3
2021 USEVis: Visual analytics of attention-based neural embedding in information retrieval
abstract
Neural attention-based encoders, which effectively attend sentence tokens to their associated context without being restricted by long-term distance or dependency, have demonstrated outstanding performance in embedding sentences into meaningful representations (embeddings). The Universal Sentence Encoder (USE) is one of the most well-recognized deep neural network (DNN) based solutions, which is facilitated with an attention-driven transformer architecture and has been pre-trained on a large number of sentences from the Internet. Besides the fact that USE has been widely used in many downstream applications, including information retrieval (IR), interpreting its complicated internal working mechanism remains challenging. In this work, we present a visual analytics solution towards addressing this challenge. Specifically, focused on semantics and syntactics (concepts and relations) that are critical to domain clinical IR, we designed and developed a visual analytics system, i.e., USEVis. The system investigates the power of USE in effectively extracting sentences’ semantics and syntactics through exploring and interpreting how linguistic properties are captured by attentions. Furthermore, by thoroughly examining and comparing the inherent patterns of these attentions, we are able to exploit attentions to retrieve sentences/documents that have similar semantics or are closely related to a given clinical problem in IR. By collaborating with domain experts, we demonstrate use cases with inspiring findings to validate the contribution of our work and the effectiveness of our system.
Xiaonan Ji, Yamei Tu, Junpeng Wang 0001, Han-Wei Shen, Po-Yin Yen
Vis. Informatics1
2019 Visual Exploration of Neural Document Embedding in Information Retrieval: Semantics and Feature Selection
abstract
Neural embeddings are widely used in language modeling and feature generation with superior computational power. Particularly, neural document embedding - converting texts of variable-length to semantic vector representations - has shown to benefit widespread downstream applications, e.g., information retrieval (IR). However, the black-box nature makes it difficult to understand how the semantics are encoded and employed. We propose visual exploration of neural document embedding to gain insights into the underlying embedding space, and promote the utilization in prevalent IR applications. In this study, we take an IR application-driven view, which is further motivated by biomedical IR in healthcare decision-making, and collaborate with domain experts to design and develop a visual analytics system. This system visualizes neural document embeddings as a configurable document map and enables guidance and reasoning; facilitates to explore the neural embedding space and identify salient neural dimensions (semantic features) per task and domain interest; and supports advisable feature selection (semantic analysis) along with instant visual feedback to promote IR performance. We demonstrate the usefulness and effectiveness of this system and present inspiring findings in use cases. This work will help designers/developers of downstream applications gain insights and confidence in neural document embedding, and exploit that to achieve more favorable performance in application domains.
Xiaonan Ji, Han-Wei Shen, Alan Ritter, Raghu Machiraju, Po-Yin Yen
IEEE Trans. Vis. Comput. Graph.1
2017 Using ontology-based semantic similarity to facilitate the article screening process for systematic reviews
Xiaonan Ji, Alan Ritter, Po-Yin Yen
J. Biomed. Informatics1
2016 A Review of Mobile Phone-based Interventions and Applications for Medication Adherence
Po-Yin Yen, Jessica Garvey Smith, Michelle P. Zhou, Megan Chamberlain, Xiaonan Ji, Albert M. Lai
AMIA5
2015 Examining the Distribution, Modularity, and Community Structure in Article Networks for Systematic Reviews
Xiaonan Ji, Raghu Machiraju, Alan Ritter, Po-Yin Yen
AMIA1
2015 Health Information Technology Evaluation Studies: Trends in Communities and Geography from 2004 to 2014
Marjorie M. Kelley, Xiaonan Ji, Po-Yin Yen, Gina M. Torelli
AMIA2
2015 Intelligence in Usability Survey Research (iUSuR): an Online Usability Question Bank for Usability Survey Research
Po-Yin Yen, Nima Esmaili Mokaram, Gina M. Torelli, Alissa A. Schultz, Xiaonan Ji
AMIA5
2014 Road damage information extraction using high-resolution SAR imagery
abstract
Road is a great part of transportation, emergency response and disaster relief, the monitor and real-time evaluation of the state of road are always important for the rescue works after disaster. SAR has some advantages of all-weather and all-time, which can be well adapted to disaster conditions. Until now the extraction of road damage information has been studied more in optical remote sensing, while less in SAR images. Base on the researches in optical and the studies of road information extraction in SAR, we explored the road damage information extraction in this paper, and proposed a new method of road damage information extraction.
Chenrong Fu, Yan Chen 0003, Ling Tong 0001, Mingquan Jia, Longfei Tan, Xiaonan Ji
IGARSS6
2014 Area retrieval of melting snow in alpine areas
abstract
This paper developed a method of mapping wet snow and dry snow in alpine terrain based on multi-polarimetric and mono temporal ASAR data in the snow melting season.14 ASAR images were used to obtain the variation of the backscattering coefficients of snow covered areas in the snow melting process. Shi's method combining intensity and polarization property is taken as a reference to retrieve wet snow. DEM data was also used to retrieve dry snow. In order to verify the accuracy of the result, we made a scale conversion to images resulting from the ASAR data to match with the MODIS image and found an overall accuracy of 82.04%. The Google Earth image was also used as an aided verification. The results are all found to show a good estimation of the snow covered areas.
Xiaonan Ji, Yan Chen 0003, Ling Tong 0001, Mingquan Jia, Longfei Tan, Shaokai Fan
IGARSS1
2010 Classifying proteins using gapped Markov feature pairs
Xiaonan Ji, James Bailey 0001, Kotagiri Ramamohanarao
Neurocomputing1
2008 Mining, Ranking, and Using Acronym Patterns
Xiaonan Ji, Gu Xu, James Bailey 0001, Hang Li 0001
APWeb1
2007 Mining minimal distinguishing subsequence patterns with gap constraints
Xiaonan Ji, James Bailey 0001, Guozhu Dong
Knowl. Inf. Syst.1
2005 Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints
abstract
Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a minimal distinguishing subsequence (MDS). An MDS is a minimal subsequence that occurs frequently in one class of sequences and infrequently in sequences of another class. It is a natural way of representing strong and succinct contrast information between two sequential datasets and can be useful in applications such as protein comparison, document comparison and building sequential classification models. Mining MDS patterns is a challenging task and is significantly different from mining contrasts between relational/transactional data. One particularly important type of constraint that can be integrated into the mining process is the maximum gap constraint. We present an efficient algorithm called ConSGapMiner, to mine all MDSs according to a maximum gap constraint. It employs highly efficient bitset and Boolean operations, for powerful gap based pruning within a prefix growth framework. A performance evaluation with both sparse and dense datasets, demonstrates the scalability of ConSGapMiner and shows its ability to mine patterns from high dimensional datasets at low supports.
Xiaonan Ji, James Bailey 0001, Guozhu Dong
ICDM1