TL;DR
PREMA introduces a principled tensor-based approach for reconstructing detailed data from multiple aggregated views, enabling accurate disaggregation even with missing data or unknown aggregation patterns.
Contribution
It presents a novel low-rank tensor factorization method, PREMA, for data disaggregation from multiple aggregated views, including blind disaggregation without prior aggregation knowledge.
Findings
Effective in recovering detailed data from multiple coarse views
Handles missing or partially observed data robustly
Works in blind disaggregation scenarios without known aggregation patterns
Abstract
Multidimensional data have become ubiquitous and are frequently encountered in situations where the information is aggregated over multiple data atoms. The aggregation can be over time or other features, such as geographical location. We often have access to multiple aggregated views of the same data, each aggregated in one or more dimensions, especially when data are collected or measured by different agencies. For instance, item sales can be aggregated temporally, and over groups of stores based on their location or affiliation. However, data mining and machine learning models benefit from detailed data for personalized analysis and prediction. Thus, data disaggregation algorithms are becoming increasingly important in various domains. The goal of this paper is to reconstruct finer-scale data from multiple coarse views, aggregated over different (subsets of) dimensions. The proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
