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

Bernard Koch

dblp:249/2574 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
1 paper
Web and social media mining · 44% Data mining · 44% Recommender systems · 13%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › network embedding
heterogeneous graph embedding
0.512021
HINTS: Citation Time Series Prediction for New Publications via Dynamic Heterogeneous Information Network Embedding · WWW 2021
Web and social media mining › citation network analysis
citation prediction
0.512021
HINTS: Citation Time Series Prediction for New Publications via Dynamic Heterogeneous Information Network Embedding · WWW 2021
Data mining › time series analysis
time series forecasting
0.512021
HINTS: Citation Time Series Prediction for New Publications via Dynamic Heterogeneous Information Network Embedding · WWW 2021

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

dynamic heterogeneous information network embedding · 1.0deep learning · 1.0
YearPublicationVenuePosition
2021 HINTS: Citation Time Series Prediction for New Publications via Dynamic Heterogeneous Information Network Embedding
abstract
Accurate prediction of scientific impact is important for scientists, academic recommender systems, and granting organizations alike. Existing approaches rely on many years of leading citation values to predict a scientific paper’s citations (a proxy for impact), even though most papers make their largest contributions in the first few years after they are published. In this paper, we tackle a new problem: predicting a new paper’s citation time series from the date of publication (i.e., without leading values). We propose HINTS, a novel end-to-end deep learning framework that converts citation signals from dynamic heterogeneous information networks (DHIN) into citation time series. HINTS imputes pseudo-leading values for a paper in the years before it is published from DHIN embeddings, and then transforms these embeddings into the parameters of a formal model that can predict citation counts immediately after publication. Empirical analysis on two real-world datasets from Computer Science and Physics show that HINTS is competitive with baseline citation prediction models. While we focus on citations, our approach generalizes to other “cold start” time series prediction tasks where relational data is available and accurate prediction in early timestamps is crucial.
Song Jiang 0002, Bernard Koch, Yizhou Sun
WWW2