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

Fang He 0002

dblp:98/3421-2 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0001-7074-488XORCID · conflict

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

Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 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
Data mining · 67% Web and social media mining · 33%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › time series analysis
time series classification
0.712023
Rel-CNN: Learning Relationship Features in Time Series for Classification · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Graph learning
dynamic graph
0.512021
CINES: Explore Citation Network and Event Sequences for Citation Forecasting · SIGIR 2021
Web and social media mining › citation network analysis
citation prediction
0.512021
CINES: Explore Citation Network and Event Sequences for Citation Forecasting · SIGIR 2021
Data mining › predictive modeling › classification
ensemble learning
0.212023
Rel-CNN: Learning Relationship Features in Time Series for Classification · IEEE Trans. Knowl. Data Eng. 2023
Data mining › sequence analysis
event sequence modeling
0.112021
CINES: Explore Citation Network and Event Sequences for Citation Forecasting · SIGIR 2021

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

recurrent neural network · 1.0feature propagation · 1.0attention mechanism · 1.0relationship feature based convolution filtering · 0.7latent relationship feature based convolution filtering · 0.7convolutional neural network · 0.7
YearPublicationVenuePosition
2024 Leveraging Transfer Learning for Enhancing Graph Optimization Problem Solving
Hui-Ju Hung, Wang-Chien Lee, Fang He 0002, Zhen Lei 0005
PAKDD (2)4
2023 Rel-CNN: Learning Relationship Features in Time Series for Classification
abstract
Time series classification has ubiquitous applications in the real world. Owing to its importance, many time series classification techniques have been proposed over years. Among them, neural network based methods have attracted significant research attention due to their ability to automatically extract latent and discriminative features from data. In this paper, we explorerelationship features, which provide valuable global information for time series analytics, and propose a general neural network architecture, namelyRel-CNN, to learn both global and local subsequence features for time series classification. Moreover, we provide two detailed model designs,Relationship Feature based Convolution FilteringandLatent Relationship Feature based Convolution Filtering, and address technical issues due to excessive parameters to learn in these models. We evaluate our models and baselines on time series classification, with extensive experiments on the widely-used 85 uni-variate “bake-off” datasets and 8 multi-variate UEA datasets. Experimental results show that our Rel-CNN models are superior to the representative time series classifiers, in terms of average accuracy, average Macro-f1 and ranking metrics. In addition, an ensemble version of Rel-CNN also outperforms the state-of-the-art ensemble classifiers in terms of average rank, average accuracy and average Macro-f1 on the bake-off datasets.
Fang He 0002, Tao-Yang Fu, Wang-Chien Lee
IEEE Trans. Knowl. Data Eng.1
2021 CINES: Explore Citation Network and Event Sequences for Citation Forecasting
abstract
Citations of scientific papers and patents reveal the knowledge flow and usually serve as the metric for evaluating their novelty and impacts in the field. Citation Forecasting thus has various applications in the real world. Existing works on citation forecasting typically exploit the sequential properties of citation events, without exploring the citation network. In this paper, we propose to explore both the citation network and the related citation event sequences which provide valuable information for future citation forecasting. We propose a novel \em Citation Network and Event Sequence (CINES) Model to encode signals in the citation network and related citation event sequences into various types of embeddings for decoding to the arrivals of future citations. Moreover, we propose atemporal network attention and three alternative designs of \em bidirectional feature propagation to aggregate the retrospective and prospective aspects of publications in the citation network, coupled with the citation event sequence embeddings learned by a \em two-level attention mechanism for the citation forecasting. We evaluate our models and baselines on both a U.S. patent dataset and a DBLP dataset. Experimental results show that our models outperform the state-of-the-art methods, i.e., RMTPP, CYAN-RNN, Intensity-RNN, and PC-RNN, reducing the forecasting error by 37.76% - 75.32%.
Fang He 0002, Wang-Chien Lee, Tao-Yang Fu, Zhen Lei 0005
SIGIR1