Sven Laur

Sven Laur

Auto-generated profile, based on publicly available information

Sven Laur

Tartu University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 July 2018 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
DBDan Bogdanov
Dan Bogdanov
LKLiina Kamm
Liina Kamm
SLSven Laur
Sven Laur
VSVille Sokk
Ville Sokk
We improve the quality of cryptographically privacy-preserving genome-wide association studies by correctly handling population stratification - the inherent genetic difference of patient groups, e.g., people with different ancestries. Our approach is to use principal component analysis to reduce the dimensionality of the problem so that we get less spurious correlations between traits of interest and certain positions in the genome. While this approach is commonplace in practical genomic analysis, it has not been used within a privacy-preserving setting. In this paper, we use cryptographically secure multi-party computation to tackle principal component analysis, and present an implementation and experimental results showing the performance of the approach.

5 April 2017 in arXiv
Verified
Preprint
Open access
PDF file
AMAvo Muromägi
Avo Muromägi
KSKairit Sirts
Kairit Sirts
SLSven Laur
Sven Laur
This paper explores linear methods for combining several word embedding models into an ensemble. We construct the combined models using an iterative method based on either ordinary least squares regression or the solution to the orthogonal Procrustes problem. We evaluate the proposed approaches on Estonian---a morphologically complex language, for which the available corpora for training word embeddings are relatively small. We compare both combined models with each other and with the input word embedding models using synonym and analogy tests. The results show that while using the ordinary least squares regression performs poorly in our experiments, using orthogonal Procrustes to combine several word embedding models into an ensemble model leads to 7-10% relative improvements over the mean result of the initial models in synonym tests and 19-47% in analogy tests.