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

Julia Proskurnia

dblp:186/0754 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2021
—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-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
Data mining · 87% Web and social media mining · 13%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › pattern learning
template learning
0.312017
Template Induction over Unstructured Email Corpora · WWW 2017
Data mining
pattern mining
0.312017
Predicting the Success of Online Petitions Leveraging Multidimensional Time-Series · WWW 2017
Data mining › time series analysis
time series forecasting
0.312017
Predicting the Success of Online Petitions Leveraging Multidimensional Time-Series · WWW 2017
Natural language and speech › Information extraction and text analysis
text classification
0.112017
Template Induction over Unstructured Email Corpora · WWW 2017
Web and social media mining
social media marketing
0.112017
Predicting the Success of Online Petitions Leveraging Multidimensional Time-Series · WWW 2017

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

unsupervised template induction · 0.3self-excitation · 0.3seasonality modeling · 0.3interpretable time-series model · 0.3
YearPublicationVenuePosition
2021 Replacing Human Audio with Synthetic Audio for on-Device Unspoken Punctuation Prediction
abstract
We present a novel multi-modal unspoken punctuation prediction system for the English language which combines acoustic and text features. We demonstrate for the first time, that by relying exclusively on synthetic data generated using a prosody-aware text-to-speech system, we can outperform a model trained with expensive human audio recordings on the unspoken punctuation prediction problem. Our model architecture is well suited for on-device use. This is achieved by leveraging hash-based embeddings of automatic speech recognition text output in conjunction with acoustic features as input to a quasi-recurrent neural network, keeping the model size small and latency low.
Daria Soboleva, Ondrej Skopek, Márius Sajgalík, Victor Carbune, Felix Weissenberger, Julia Proskurnia, Bogdan Prisacari, Daniel Valcarce, Justin Lu, Rohit Prabhavalkar, Balint Miklos
ICASSP6
2017 Efficient Document Filtering Using Vector Space Topic Expansion and Pattern-Mining: The Case of Event Detection in Microposts
abstract
Automatically extracting information from social media is challenging given that social content is often noisy, ambiguous, and inconsistent. However, as many stories break on social channels first before being picked up by mainstream media, developing methods to better handle social content is of utmost importance. In this paper, we propose a robust and effective approach to automatically identify microposts related to a specific topic defined by a small sample of reference documents. Our framework extracts clusters of semantically similar microposts that overlap with the reference documents, by extracting combinations of key features that define those clusters through frequent pattern mining. This allows us to construct compact and interpretable representations of the topic, dramatically decreasing the computational burden compared to classical clustering and k-NN-based machine learning techniques and producing highly-competitive results even with small training sets (less than 1'000 training objects). Our method is efficient and scales gracefully with large sets of incoming microposts. We experimentally validate our approach on a large corpus of over 60M microposts, showing that it significantly outperforms state-of-the-art techniques.
Julia Proskurnia, Ruslan Mavlyutov, Carlos Castillo 0001, Karl Aberer, Philippe Cudré-Mauroux
CIKM1
2017 Template Induction over Unstructured Email Corpora
abstract
Unsupervised template induction over email data is a central component in applications such as information extraction, document classification, and auto-reply. The benefits of automatically generating such templates are known for structured data, e.g. machine generated HTML emails. However much less work has been done in performing the same task over unstructured email data.
Julia Proskurnia, Marc-Allen Cartright, Lluís Garcia Pueyo, Ivo Krka, James B. Wendt, Tobias Kaufmann 0004, Balint Miklos
WWW1
2017 Predicting the Success of Online Petitions Leveraging Multidimensional Time-Series
abstract
Applying classical time-series analysis techniques to online content is challenging, as web data tends to have data quality issues and is often incomplete, noisy, or poorly aligned. In this paper, we tackle the problem of predicting the evolution of a time series of user activity on the web in a manner that is both accurate and interpretable, using related time series to produce a more accurate prediction. We test our methods in the context of predicting signatures for online petitions using data from thousands of petitions posted on The Petition Site - one of the largest platforms of its kind. We observe that the success of these petitions is driven by a number of factors, including promotion through social media channels and on the front page of the petitions platform. We propose an interpretable model that incorporates seasonality, aging effects, self-excitation, and external effects. The interpretability of the model is important for understanding the elements that drives the activity of an online content. We show through an extensive empirical evaluation that our model is significantly better at predicting the outcome of a petition than state-of-the-art techniques.
Julia Proskurnia, Przemyslaw A. Grabowicz, Ryota Kobayashi, Carlos Castillo 0001, Philippe Cudré-Mauroux, Karl Aberer
WWW1