Sub-Matrix Factorization for Real-Time Vote Prediction

4Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of predicting aggregate vote outcomes (e.g., national) from partial outcomes (e.g., regional) that are revealed sequentially. We combine matrix factorization techniques and generalized linear models (GLMs) to obtain a flexible, efficient, and accurate algorithm. This algorithm works in two stages: First, it learns representations of the regions from high-dimensional historical data. Second, it uses these representations to fit a GLM to the partially observed results and to predict unobserved results. We show experimentally that our algorithm is able to accurately predict the outcomes of Swiss referenda, U.S. presidential elections, and German legislative elections. We also explore the regional representations in terms of ideological and cultural patterns. Finally, we deploy an online Web platform (www.predikon.ch) to provide real-time vote predictions in Switzerland and a data visualization tool to explore voting behavior. A by-product is a dataset of sequential vote results for 330 referenda and 2196 Swiss municipalities.

Cite

CITATION STYLE

APA

Immer, A., Kristof, V., Grossglauser, M., & Thiran, P. (2020). Sub-Matrix Factorization for Real-Time Vote Prediction. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 2280–2290). Association for Computing Machinery. https://doi.org/10.1145/3394486.3403277

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free