Nino Antulov-Fantulin

dblp:91/10229 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-4337-2475ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
3 papers
Deep learning architectures and training · 30% Graph learning · 28% Trustworthy machine learning · 24%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 100%
Databases, data mining, and information retrieval
2 papers
Web and social media mining · 80% Data mining · 20%

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

TopicWeightPapersLastEvidence papers
Computational finance and economics
cryptocurrency markets
0.712023
Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data · WSDM 2023
Computational finance and economics › financial forecasting
volatility forecasting
0.712023
Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data · WSDM 2023
Web and social media mining
social media analysis
0.712023
Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data · WSDM 2023
Web and social media mining › social media analysis
twitter analysis
0.712023
Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data · WSDM 2023
Machine learning › Graph learning
directed graph
0.412020
Low-dimensional statistical manifold embedding of directed graphs · ICLR 2020
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
low-dimensional embedding
0.412020
Low-dimensional statistical manifold embedding of directed graphs · ICLR 2020
Machine learning › Graph learning
network embedding
0.412020
Low-dimensional statistical manifold embedding of directed graphs · ICLR 2020
Machine learning › Trustworthy machine learning › interpretability › attention analysis
attention-based explanation
0.412019
Exploring interpretable LSTM neural networks over multi-variable data · ICML 2019
Machine learning › Trustworthy machine learning
interpretability
0.412019
Exploring interpretable LSTM neural networks over multi-variable data · ICML 2019
Machine learning › Deep learning architectures and training › recurrent neural network
LSTM
0.412019
Exploring interpretable LSTM neural networks over multi-variable data · ICML 2019
Machine learning › Deep learning architectures and training
recurrent neural network
0.412019
Exploring interpretable LSTM neural networks over multi-variable data · ICML 2019
Data mining › time series analysis
time series forecasting
0.312018
Bitcoin Volatility Forecasting with a Glimpse into Buy and Sell Orders · ICDM 2018
Machine learning › Deep learning architectures and training › convolutional neural network › convolutional neural network architecture
temporal convolutional network
0.212023
Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data · WSDM 2023
Machine learning › Time series and sequential data
time series analysis
0.112019
Exploring interpretable LSTM neural networks over multi-variable data · ICML 2019

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

temporal convolutional network · 2.0autoregressive model · 2.0ablation study · 2.0temporal mixture model · 0.7rolling incremental learning · 0.7order book feature analysis · 0.7statistical manifold embedding · 0.4variable-wise hidden states · 0.4mixture attention · 0.4LSTM · 0.4
YearPublicationVenuePosition
2023 Temporal-Weighted Bipartite Graph Model for Sparse Expert Recommendation in Community Question Answering
abstract
Community Question Answering (CQA) websites are valuable knowledge repositories where individuals exchange information by asking and answering questions. With an ever-increasing number of questions and high in-flow and out-flow of users in these communities, a key challenge is to design effective strategies for recommending experts for new questions. This requires robust approaches that facilitate modeling users’ expertise given their changing interests and sparse historical data, at the same time being computationally less expensive for periodic updates. In this paper, we propose a simple graph diffusion-based expert recommendation model for CQA, that can outperform state-of-the-art convolutional neural network and transformers-based deep learning representatives and collaborative models. Our proposed method learns users’ expertise in the context of both semantic and temporal information to capture their changing interests and activity levels with time. Experiments on six real-world datasets from the Stack Exchange network demonstrate that our approach outperforms competitive baseline methods. Further, experiments on cold-start users (users with a limited historical record) show our model achieves an average of 50% performance gain compared to the best baseline method.
Vaibhav Krishna, Nino Antulov-Fantulin
UMAP2
2023 Ask "Who", Not "What": Bitcoin Volatility Forecasting with Twitter Data
abstract
Understanding the variations in trading price (volatility), and its response to exogenous information, is a well-researched topic in finance. In this study, we focus on finding stable and accurate volatility predictors for a relatively new asset class of cryptocurrencies, in particular Bitcoin, using deep learning representations of public social media data obtained from Twitter. For our experiments, we extracted semantic information and user statistics from over 30 million Bitcoin-related tweets, in conjunction with 15-minute frequency price data over a horizon of 144 days. Using this data, we built several deep learning architectures that utilized different combinations of the gathered information. For each model, we conducted ablation studies to assess the influence of different components and feature sets over the prediction accuracy. We found statistical evidences for the hypotheses that: (i) temporal convolutional networks perform significantly better than both classical autoregressive models and other deep learning-based architectures in the literature, and (ii) tweet author meta-information, even detached from the tweet itself, is a better predictor of volatility than the semantic content and tweet volume statistics. We demonstrate how different information sets gathered from social media can be utilized in different architectures and how they affect the prediction results. As an additional contribution, we make our dataset public for future research.
M. Eren Akbiyik, Mert Erkul, Killian Kaempf, Vaiva Vasiliauskaite, Nino Antulov-Fantulin
WSDM5
2020 Low-dimensional statistical manifold embedding of directed graphs
Thorben Funke, Tian Guo 0002, Alen Lancic, Nino Antulov-Fantulin
ICLR4
2019 Exploring interpretable LSTM neural networks over multi-variable data
abstract
For recurrent neural networks trained on time series with target and exogenous variables, in addition to accurate prediction, it is also desired to provide interpretable insights into the data. In this paper, we explore the structure of LSTM recurrent neural networks to learn variable-wise hidden states, with the aim to capture different dynamics in multi-variable time series and distinguish the contribution of variables to the prediction. With these variable-wise hidden states, a mixture attention mechanism is proposed to model the generative process of the target. Then we develop associated training methods to jointly learn network parameters, variable and temporal importance w.r.t the prediction of the target variable. Extensive experiments on real datasets demonstrate enhanced prediction performance by capturing the dynamics of different variables. Meanwhile, we evaluate the interpretation results both qualitatively and quantitatively. It exhibits the prospect as an end-to-end framework for both forecasting and knowledge extraction over multi-variable data.
Tian Guo 0002, Tao Lin 0004, Nino Antulov-Fantulin
ICML3
2018 Bitcoin Volatility Forecasting with a Glimpse into Buy and Sell Orders
abstract
Bitcoin is one of the most prominent decentralized digital cryptocurrencies. Ability to understand which factors drive the fluctuations of the Bitcoin price and to what extent they are predictable is interesting both from the theoretical and practical perspective. In this paper, we study the problem of the Bitcoin short-term volatility forecasting based on volatility history and order book data. Order book, consisting of buy and sell orders over time, reflects the intention of the market and is closely related to the evolution of volatility. We propose temporal mixture models capable of adaptively exploiting both volatility history and order book features. By leveraging rolling and incremental learning and evaluation procedures, we demonstrate the prediction performance of our model as well as studying the robustness, in comparison to a variety of statistical and machine learning baselines. Meanwhile, our temporal mixture model enables to decipher the time-varying effect of order book features on volatility. It demonstrates the prospect of our temporal mixture model as an interpretable forecasting framework over heterogeneous Bitcoin data.
Tian Guo 0002, Albert Bifet, Nino Antulov-Fantulin
ICDM3
2018 A nonlinear orthogonal non-negative matrix factorization approach to subspace clustering
Dijana Tolic, Nino Antulov-Fantulin, Ivica Kopriva
Pattern Recognit.2
2014 Synthetic Sequence Generator for Recommender Systems - Memory Biased Random Walk on a Sequence Multilayer Network
Nino Antulov-Fantulin, Matko Bosnjak, Vinko Zlatic, Miha Grcar, Tomislav Smuc
Discovery Science1
2013 FastSIR algorithm: A fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
Nino Antulov-Fantulin, Alen Lancic, Hrvoje Stefancic, Mile Sikic
Inf. Sci.1