Faisal M. Almutairi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Faisal M. Almutairi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Nicholas Sidiropoulos
Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA
4 shared publications - Charilaos I. Kanatsoulis
Department of ECE, University of Minnesota, Minneapolis, MN, USA
2 shared publications - Christos Faloutsos
Carnegie Mellon University
2 shared publications - Fan Yang
School of Microelectronics, Fudan University
2 shared publications - Hyun Ah Song
Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Vladimir Zadorozhny
University of Pittsburgh, Pittsburgh, USA
2 shared publications
Latest Publications
- Open Access
- 7 July 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (1) , 253
Correction to: TurboLift: fast accuracy lifting for historical data recovery
- 7 July 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (1) , 253
Open AccessCorrection to: TurboLift: fast accuracy lifting for historical data recovery
- 3 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 15 (3) , 535-549
Prema: Principled Tensor Data Recovery From Multiple Aggregated Views
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 method, called Prema , leverages low-rank tensor factorization tools to fuse the multiple views and provide recovery guarantees under certain conditions. Prema can tackle challenging scenarios, such as missing or partially observed data, double aggregation, and even blind disaggregation (without knowledge of the aggregation patterns) using a variant of Prema called B-Prema . To showcase the effectiveness of Prema , the paper includes extensive experiments using real data from different domains: retail sales, crime counts, and weather observations.
- 3 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 15 (3) , 535-549
Prema: Principled Tensor Data Recovery From Multiple Aggregated Views
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 method, called Prema , leverages low-rank tensor factorization tools to fuse the multiple views and provide recovery guarantees under certain conditions. Prema can tackle challenging scenarios, such as missing or partially observed data, double aggregation, and even blind disaggregation (without knowledge of the aggregation patterns) using a variant of Prema called B-Prema . To showcase the effectiveness of Prema , the paper includes extensive experiments using real data from different domains: retail sales, crime counts, and weather observations.
- 6 May 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 12085, 867-880
Tendi: Tensor Disaggregation from Multiple Coarse Views
Multidimensional data appear in various interesting applications, e.g., sales data indexed by stores, items, and time. Oftentimes, data are observed aggregated over multiple data atoms, thus exhibit low resolution. Temporal aggregation is most common, but many datasets are also aggregated over other attributes. Multidimensional data, in particular, are sometimes available in multiple coarse views, aggregated across different dimensions – especially when sourced by different agencies. For instance, item sales can be aggregated temporally, and over groups of stores based on their location or affiliation. However, data in finer granularity significantly benefit forecasting and data analytics, prompting increasing interest in data disaggregation methods. In this paper, we propose Tendi, a principled model that efficiently disaggregates multidimensional (tensor) data from multiple views, aggregated over different dimensions. Tendi employs coupled tensor factorization to fuse the multiple views and provide recovery guarantees under realistic conditions. We also propose a variant of Tendi, called TendiB, which performs the disaggregation task without any knowledge of the aggregation mechanism. Experiments on real data from different domains demonstrate the high effectiveness of the proposed methods.
- 6 May 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 12085, 867-880
Tendi: Tensor Disaggregation from Multiple Coarse Views
Multidimensional data appear in various interesting applications, e.g., sales data indexed by stores, items, and time. Oftentimes, data are observed aggregated over multiple data atoms, thus exhibit low resolution. Temporal aggregation is most common, but many datasets are also aggregated over other attributes. Multidimensional data, in particular, are sometimes available in multiple coarse views, aggregated across different dimensions – especially when sourced by different agencies. For instance, item sales can be aggregated temporally, and over groups of stores based on their location or affiliation. However, data in finer granularity significantly benefit forecasting and data analytics, prompting increasing interest in data disaggregation methods. In this paper, we propose Tendi, a principled model that efficiently disaggregates multidimensional (tensor) data from multiple views, aggregated over different dimensions. Tendi employs coupled tensor factorization to fuse the multiple views and provide recovery guarantees under realistic conditions. We also propose a variant of Tendi, called TendiB, which performs the disaggregation task without any knowledge of the aggregation mechanism. Experiments on real data from different domains demonstrate the high effectiveness of the proposed methods.
- 9 March 2020
- Published by Springer Nature in The VLDB Journal
- Vol. 29 (5) , 1129-1148
TurboLift: fast accuracy lifting for historical data recovery
- 9 March 2020
- Published by Springer Nature in The VLDB Journal
- Vol. 29 (5) , 1129-1148
TurboLift: fast accuracy lifting for historical data recovery