Ali Arabzadeh

dblp:194/4292 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6479-0131ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 2

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
Recommender systems · 96% Data mining · 4%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 58% Representation and self-supervised learning · 33% Graph learning · 9%

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

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering › factor models
poisson factorization
0.722020
Recurrent Poisson Factorization for Temporal Recommendation · IEEE Trans. Knowl. Data Eng. 2020
Recurrent Poisson Factorization for Temporal Recommendation · KDD 2017
Recommender systems › context-aware recommendation › dynamic recommendation
temporal recommendation
0.722020
Recurrent Poisson Factorization for Temporal Recommendation · IEEE Trans. Knowl. Data Eng. 2020
Recurrent Poisson Factorization for Temporal Recommendation · KDD 2017
Recommender systems
collaborative filtering
0.412020
Recurrent Poisson Factorization for Temporal Recommendation · IEEE Trans. Knowl. Data Eng. 2020
Machine learning › Representation and self-supervised learning › matrix factorization
poisson factorization
0.312017
Recurrent Poisson Factorization for Temporal Recommendation · KDD 2017
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
online inference
0.212016
HNP3: A Hierarchical Nonparametric Point Process for Modeling Content Diffusion over Social Media · ICDM 2016
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
point process
0.212016
HNP3: A Hierarchical Nonparametric Point Process for Modeling Content Diffusion over Social Media · ICDM 2016
Data mining › temporal analysis
temporal modeling
0.112017
Recurrent Poisson Factorization for Temporal Recommendation · KDD 2017
Machine learning › Graph learning
social network analysis
0.112016
HNP3: A Hierarchical Nonparametric Point Process for Modeling Content Diffusion over Social Media · ICDM 2016

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

variational inference · 1.0poisson factorization · 0.6poisson process · 0.4online inference · 0.2multidimensional point process · 0.2hierarchical nonparametric model · 0.2
YearPublicationVenuePosition
2020 Recurrent Poisson Factorization for Temporal Recommendation
abstract
Poisson Factorization (PF) is the gold standard framework for recommendation systems with implicit feedback whose variants show state-of-the-art performance on real-world recommendation tasks. However, they do not explicitly take into account the temporal behavior of users which is essential to recommend the right item to the right user at the right time. In this paper, we introduce Recurrent Poisson Factorization (RPF) framework that generalizes the classical PF methods by utilizing a Poisson process for modeling the implicit feedback. RPF treats time as a natural constituent of the model, and takes important factors for recommendation into consideration to provide a rich family of time-sensitive factorization models. They include Hierarchical RPFthat captures the consumption heterogeneity among users and items, Dynamic RPF that handles dynamic user preferences and item specifications, Social RPF that models the social-aspect of product adoption, Item-Item RPFthat considers the inter-item correlations, and eXtended Item-Item RPF that utilizes items' metadata to better infer the correlation among engagement patterns of users with items. We also develop an efficient variational algorithm for approximate inference that scales up to massive datasets. We demonstrate RPF's superior performance over many state-of-the-art methods on synthetic dataset, and wide variety of large scale real-world datasets.
Seyyed Abbas Hosseini, Ali Khodadadi, Keivan Alizadeh-Vahid, Ali Arabzadeh, Mehrdad Farajtabar, Hongyuan Zha, Hamid R. Rabiee 0001
IEEE Trans. Knowl. Data Eng.4
2017 Recurrent Poisson Factorization for Temporal Recommendation
abstract
Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization methods who show state-of-the-art performance on real-world recommendation tasks. However, most of them do not explicitly take into account the temporal behavior and the recurrent activities of users which is essential to recommend the right item to the right user at the right time. In this paper, we introduce Recurrent Poisson Factorization (RPF) framework that generalizes the classical PF methods by utilizing a Poisson process for modeling the implicit feedback. RPF treats time as a natural constituent of the model and brings to the table a rich family of time-sensitive factorization models. To elaborate, we instantiate several variants of RPF who are capable of handling dynamic user preferences and item specification (DRPF), modeling the social-aspect of product adoption (SRPF), and capturing the consumption heterogeneity among users and items (HRPF). We also develop a variational algorithm for approximate posterior inference that scales up to massive data sets. Furthermore, we demonstrate RPF's superior performance over many state-of-the-art methods on synthetic dataset, and large scale real-world datasets on music streaming logs, and user-item interactions in M-Commerce platforms.
Seyyed Abbas Hosseini, Keivan Alizadeh-Vahid, Ali Khodadadi, Ali Arabzadeh, Mehrdad Farajtabar, Hongyuan Zha, Hamid R. Rabiee 0001
KDD4
2016 HNP3: A Hierarchical Nonparametric Point Process for Modeling Content Diffusion over Social Media
abstract
This paper introduces a novel framework for modeling temporal events with complex longitudinal dependency that are generated by dependent sources. This framework takes advantage of multidimensional point processes for modeling time of events. The intensity function of the proposed process is a mixture of intensities, and its complexity grows with the complexity of temporal patterns of data. Moreover, it utilizes a hierarchical dependent nonparametric approach to model marks of events. These capabilities allow the proposed model to adapt its temporal and topical complexity according to the complexity of data, which makes it a suitable candidate for real world scenarios. An online inference algorithm is also proposed that makes the framework applicable to a vast range of applications. The framework is applied to a real world application, modeling the diffusion of contents over networks. Extensive experiments reveal the effectiveness of the proposed framework in comparison with state-of-the-art methods.
Seyyed Abbas Hosseini, Ali Khodadadi, Ali Arabzadeh, Hamid R. Rabiee 0001
ICDM3