Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiali Mei

dblp:203/4444 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0002-5057-0146ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 57% Recommender systems · 43%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering
matrix factorization
0.722019
Nonnegative Matrix Factorization with Side Information for Time Series Recovery and Prediction · IEEE Trans. Knowl. Data Eng. 2019
Nonnegative Matrix Factorization for Time Series Recovery From a Few Temporal Aggregates · ICML 2017
Data mining › dimensionality reduction
nonnegative matrix factorization
0.722019
Nonnegative Matrix Factorization with Side Information for Time Series Recovery and Prediction · IEEE Trans. Knowl. Data Eng. 2019
Nonnegative Matrix Factorization for Time Series Recovery From a Few Temporal Aggregates · ICML 2017
Data mining
time series analysis
0.412019
Nonnegative Matrix Factorization with Side Information for Time Series Recovery and Prediction · IEEE Trans. Knowl. Data Eng. 2019
Recommender systems › factorization models
matrix factorization recommendation
0.112019
Nonnegative Matrix Factorization with Side Information for Time Series Recovery and Prediction · IEEE Trans. Knowl. Data Eng. 2019
Energy systems and smart grids › power system monitoring
electricity consumption analysis
0.112017
Nonnegative Matrix Factorization for Time Series Recovery From a Few Temporal Aggregates · ICML 2017

Methods — techniques the papers use, named apart from their topics

non-negative matrix factorization · 0.6convex relaxation · 0.6hierarchical alternating least squares · 0.4HALSX · 0.4
YearPublicationVenuePosition
2019 Nonnegative Matrix Factorization with Side Information for Time Series Recovery and Prediction
abstract
Motivated by the recovery and prediction of electricity consumption time series, we extend Nonnegative Matrix Factorization to take into account external features as side information. We consider general linear measurement settings, and propose a framework which models non-linear relationships between external features and the response variable. We extend previous theoretical results to obtain a sufficient condition on the identifiability of NMF with side information. Based on the classical Hierarchical Alternating Least Squares (HALS) algorithm, we propose a new algorithm (HALSX, or Hierarchical Alternating Least Squares with eXogeneous variables) which estimates NMF in this setting. The algorithm is validated on both simulated and real electricity consumption datasets as well as a recommendation system dataset, to show its performance in matrix recovery and prediction for new rows and columns.
Jiali Mei, Yohann de Castro, Yannig Goude, Jean-Marc Azaïs, Georges Hébrail
IEEE Trans. Knowl. Data Eng.1
2017 Nonnegative Matrix Factorization for Time Series Recovery From a Few Temporal Aggregates
abstract
Motivated by electricity consumption reconstitution, we propose a new matrix recovery method using nonnegative matrix factorization (NMF). The task tackled here is to reconstitute electricity consumption time series at a fine temporal scale from measures that are temporal aggregates of individual consumption. Contrary to existing NMF algorithms, the proposed method uses temporal aggregates as input data, instead of matrix entries. Furthermore, the proposed method is extended to take into account individual autocorrelation to provide better estimation, using a recent convex relaxation of quadratically constrained quadratic programs. Extensive experiments on synthetic and real-world electricity consumption datasets illustrate the effectiveness of the proposed method.
Jiali Mei, Yohann de Castro, Yannig Goude, Georges Hébrail
ICML1