activity
20172021
most citedCrowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms

17 citations · 37 across the 4 of their papers we have counts for

collaborators

6 papers

cs.LG2021

Multi-version Tensor Completion for Time-delayed Spatio-temporal Data

Cheng Qian, Nikos Kargas, Cao Xiao +3

Real-world spatio-temporal data is often incomplete or inaccurate due to various data loading delays. For example, a location-disease-time tensor of case counts can have multiple d…

cs.LG20203 cited

STELAR: Spatio-temporal Tensor Factorization with Latent Epidemiological Regularization

Nikos Kargas, Cheng Qian, Nicholas D. Sidiropoulos +3

Accurate prediction of the transmission of epidemic diseases such as COVID-19 is crucial for implementing effective mitigation measures. In this work, we develop a tensor method to…

cs.LG201917 cited

Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms

Shahana Ibrahim, Xiao Fu, Nikos Kargas +1

The data deluge comes with high demands for data labeling. Crowdsourcing (or, more generally, ensemble learning) techniques aim to produce accurate labels via integrating noisy, no…

cs.LG2019

Nonlinear System Identification via Tensor Completion

Nikos Kargas, Nicholas D. Sidiropoulos

Function approximation from input and output data pairs constitutes a fundamental problem in supervised learning. Deep neural networks are currently the most popular method for lea…

eess.SP201915 cited

Learning Mixtures of Smooth Product Distributions: Identifiability and Algorithm

Nikos Kargas, Nicholas D. Sidiropoulos

We study the problem of learning a mixture model of non-parametric product distributions. The problem of learning a mixture model is that of finding the component distributions alo…

cs.LG20172 cited

Completing a joint PMF from projections: a low-rank coupled tensor factorization approach

Nikos Kargas, Nicholas D. Sidiropoulos

There has recently been considerable interest in completing a low-rank matrix or tensor given only a small fraction (or few linear combinations) of its entries. Related approaches…