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

Christof Naumzik

dblp:195/5057 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 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
3 papers
Web and social media mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Web and social media mining
information diffusion
0.612022
Detecting False Rumors from Retweet Dynamics on Social Media · WWW 2022
Web and social media mining
misinformation detection
0.612022
Detecting False Rumors from Retweet Dynamics on Social Media · WWW 2022
Web and social media mining › information diffusion
retweet cascade modeling
0.612022
Detecting False Rumors from Retweet Dynamics on Social Media · WWW 2022
Web and social media mining
location-based social network analysis
0.412020
Mining Points-of-Interest for Explaining Urban Phenomena: A Scalable Variational Inference Approach · WWW 2020

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

statistical inference · 0.9deep learning · 0.9probabilistic mixture model · 0.6marked hawkes process · 0.6variational inference · 0.4sparse approximation · 0.4gaussian process · 0.4
YearPublicationVenuePosition
2022 Detecting False Rumors from Retweet Dynamics on Social Media
abstract
False rumors are known to have detrimental effects on society. To prevent the spread of false rumors, social media platforms such as Twitter must detect them early. In this work, we develop a novel probabilistic mixture model that classifies true vs. false rumors based on the underlying spreading process. Specifically, our model is the first to formalize the self-exciting nature of true vs. false retweeting processes. This results in a novel mixture marked Hawkes model (MMHM). Owing to this, our model obviates the need for feature engineering; instead, it directly models the spreading process in order to make inferences of whether online rumors are incorrect. Our evaluation is based on 13,650 retweet cascades of both true. vs. false rumors from Twitter. Our model recognizes false rumors with a balanced accuracy of 64.97 % and an AUC of 69.46 %. It outperforms state-of-the-art baselines (both neural and feature engineering) by a considerable margin but while being fully interpretable. Our work has direct implications for practitioners: it leverages the spreading process as an implicit quality signal and, based on it, detects false content.
Christof Naumzik, Stefan Feuerriegel
WWW1
2020 One Picture Is Worth a Thousand Words? The Pricing Power of Images in e-Commerce
abstract
In e-commerce, product presentations, and particularly images, are known to provide important information for user decision-making, and yet the relationship between images and prices has not been studied. To close this research gap, we suggest a tailored web mining framework, since one must quantify the relative contribution of image content in describing prices ceteris paribus. That is, one must account for the fact that such images inherently depict heterogeneous products. In order to isolate the pricing power of image content, we suggest a three-stage framework involving deep learning and statistical inference.
Christof Naumzik, Stefan Feuerriegel
WWW1
2020 Mining Points-of-Interest for Explaining Urban Phenomena: A Scalable Variational Inference Approach
abstract
Points-of-interest (POIs; i.e., restaurants, bars, landmarks, and other entities) are common in web-mined data: they greatly explain the spatial distributions of urban phenomena. The conventional modeling approach relies upon feature engineering, yet it ignores the spatial structure among POIs. In order to overcome this shortcoming, the present paper proposes a novel spatial model for explaining spatial distributions based on web-mined POIs. Our key contributions are: (1) We present a rigorous yet highly interpretable formalization in order to model the influence of POIs on a given outcome variable. Specifically, we accommodate the spatial distributions of both the outcome and POIs. In our case, this modeled by the sum of latent Gaussian processes. (2) In contrast to previous literature, our model infers the influence of POIs without feature engineering, instead we model the influence of POIs via distance-weighted kernel functions with fully learnable parameterizations. (3) We propose a scalable learning algorithm based on sparse variational approximation. For this purpose, we derive a tailored evidence lower bound (ELBO) and, for appropriate likelihoods, we even show that an analytical expression can be obtained. This allows fast and accurate computation of the ELBO. Finally, the value of our approach for web mining is demonstrated in two real-world case studies. Our findings provide substantial improvements over state-of-the-art baselines with regard to both predictive and, in particular, explanatory performance. Altogether, this yields a novel spatial model for leveraging web-mined POIs. Within the context of location-based social networks, it promises an extensive range of new insights and use cases.
Christof Naumzik, Patrick Zoechbauer, Stefan Feuerriegel
WWW1