Shahrokh Esmaeili
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shahrokh Esmaeili has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Parham Moradi
5 shared publicationsHashem Parvin
4 shared publications- Mostafa Shamsi
Department of Statistics, Amirkabir University of Technology, Tehran, Iran
3 shared publications Hazhir Sohrabi
2 shared publications- Parham Moradi
School of Engineering, RMIT University, Melbourne, Australia
2 shared publications Amjad Alipanah
1 shared publication
Latest Publications
- Open Access
- 24 February 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (4) , 198
Community detection via graph regularized symmetric nonnegative matrix tri-factorization
Identifying meaningful communities in complex networks is essential for uncovering functional structures in social, biological, and technological systems. Despite the success of Nonnegative Matrix Factorization (NMF) methods, most existing approaches fail to simultaneously preserve local structural patterns, enforce clear community separation, and effectively handle the sparsity of real-world graphs. To address these challenges, we propose SPD-SNMTF , a Structural Proximity and Diagonalized Symmetric Nonnegative Matrix Tri-Factorization framework that integrates three key components: (1) a hybrid similarity matrix combining explicit links and latent neighborhood affinities; (2) diagonal dominance constraints to enhance inter-community separation; and (3) graph Laplacian regularization to preserve topological smoothness. This unified approach jointly reconstructs the adjacency matrix while enforcing geometric and sparsity-aware constraints, resulting in more interpretable community detection with stable performance across a wide range of parameter settings. Experiments on eleven real-world datasets demonstrate that SPD-SNMTF consistently outperforms twelve state-of-the-art methods in terms of NMI, ACC, and ARI. Implementation details are available at https://github.com/sohrabi94/SPD-SNMTF .
- 24 February 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (4) , 198
Open AccessCommunity detection via graph regularized symmetric nonnegative matrix tri-factorization
Identifying meaningful communities in complex networks is essential for uncovering functional structures in social, biological, and technological systems. Despite the success of Nonnegative Matrix Factorization (NMF) methods, most existing approaches fail to simultaneously preserve local structural patterns, enforce clear community separation, and effectively handle the sparsity of real-world graphs. To address these challenges, we propose SPD-SNMTF , a Structural Proximity and Diagonalized Symmetric Nonnegative Matrix Tri-Factorization framework that integrates three key components: (1) a hybrid similarity matrix combining explicit links and latent neighborhood affinities; (2) diagonal dominance constraints to enhance inter-community separation; and (3) graph Laplacian regularization to preserve topological smoothness. This unified approach jointly reconstructs the adjacency matrix while enforcing geometric and sparsity-aware constraints, resulting in more interpretable community detection with stable performance across a wide range of parameter settings. Experiments on eleven real-world datasets demonstrate that SPD-SNMTF consistently outperforms twelve state-of-the-art methods in terms of NMI, ACC, and ARI. Implementation details are available at https://github.com/sohrabi94/SPD-SNMTF .
- 16 December 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 165
Community detection via deep motif-regularized asymmetric nonnegative matrix factorization
- 16 December 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 165
Community detection via deep motif-regularized asymmetric nonnegative matrix factorization
- 17 September 2025
- Published by Springer Nature in Iranian Journal of Science
- Vol. 50 (2) , 683-700
Graph regularized weighted symmetric nonnegative matrix factorization for data clustering
- 17 September 2025
- Published by Springer Nature in Iranian Journal of Science
- Vol. 50 (2) , 683-700
Graph regularized weighted symmetric nonnegative matrix factorization for data clustering
- 1 March 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 118, 152-168
TCFACO: Trust-aware collaborative filtering method based on ant colony optimization
- 1 March 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 118, 152-168
TCFACO: Trust-aware collaborative filtering method based on ant colony optimization
- 1 February 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 166, 92-107
A scalable and robust trust-based nonnegative matrix factorization recommender using the alternating direction method
- 1 February 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 166, 92-107
A scalable and robust trust-based nonnegative matrix factorization recommender using the alternating direction method
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 135-139
AN EFFICIENT RECOMMENDER SYSTEM BY INTEGRATING NON-NEGATIVE MATRIX FACTORIZATION WITH TRUST AND DISTRUST RELATIONSHIPS
Matrix factorization (MF) has been proved to be an effective approach to build a successful recommender system. However, most current MF-based recommenders cannot obtain high prediction accuracy due to the sparseness of user-item matrix. Moreover, these methods suffer from the scalability issues when applying on large-scale real-world tasks. To tackle these issues, in this paper a social regularization method called TrustRSNMF is proposed that incorporates the social trust information of users in nonnegative matrix factorization framework. The proposed method integrates trust statements along with user-item ratings as an additional information source into the recommendation model to deal with the data sparsity and cold-start issues. In order to evaluate the effectiveness of the proposed method, a number of experiments are performed on two real-world datasets. The obtained results demonstrate significant improvements of the proposed method compared to state-of-the-art recommendation methods.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 135-139
AN EFFICIENT RECOMMENDER SYSTEM BY INTEGRATING NON-NEGATIVE MATRIX FACTORIZATION WITH TRUST AND DISTRUST RELATIONSHIPS
Matrix factorization (MF) has been proved to be an effective approach to build a successful recommender system. However, most current MF-based recommenders cannot obtain high prediction accuracy due to the sparseness of user-item matrix. Moreover, these methods suffer from the scalability issues when applying on large-scale real-world tasks. To tackle these issues, in this paper a social regularization method called TrustRSNMF is proposed that incorporates the social trust information of users in nonnegative matrix factorization framework. The proposed method integrates trust statements along with user-item ratings as an additional information source into the recommendation model to deal with the data sparsity and cold-start issues. In order to evaluate the effectiveness of the proposed method, a number of experiments are performed on two real-world datasets. The obtained results demonstrate significant improvements of the proposed method compared to state-of-the-art recommendation methods.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1571-1576
Nonnegative Matrix Factorization Regularized with Trust Relationships for Solving Cold-Start Problem in Recommender Systems
Matrix factorization has shown as an effective collaborative filtering approach to build a successful recommender system. However, these systems have poor performance while facing cold-start users (items). To tackle this issue, in this paper, a social regularization method called TrustANLF is proposed which combines the social network information of users in a nonnegative matrix factorization framework. The proposed method integrates multiple information sources such as user-item ratings and trust statements to reduce the cold-start and data sparsity issues. Moreover, the alternating direction method is used to improve the convergence speed and reduce the computational cost. To evaluate the proposed method, several experiments are performed on two real-world datasets. The results report the effectiveness of the proposed method compared to several state-of-the-art methods.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1571-1576
Nonnegative Matrix Factorization Regularized with Trust Relationships for Solving Cold-Start Problem in Recommender Systems
Matrix factorization has shown as an effective collaborative filtering approach to build a successful recommender system. However, these systems have poor performance while facing cold-start users (items). To tackle this issue, in this paper, a social regularization method called TrustANLF is proposed which combines the social network information of users in a nonnegative matrix factorization framework. The proposed method integrates multiple information sources such as user-item ratings and trust statements to reduce the cold-start and data sparsity issues. Moreover, the alternating direction method is used to improve the convergence speed and reduce the computational cost. To evaluate the proposed method, several experiments are performed on two real-world datasets. The results report the effectiveness of the proposed method compared to several state-of-the-art methods.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 13-16
A collaborative filtering method based on genetic algorithm and trust statements
Collaborative Filtering (CF) is a frequently used recommendation method that has been successfully applied on many real-world systems. An important problem in CF is selecting a proper set of users and employing them in the rating prediction. Most of current similarity metrics incorporate only the rating values and ignore other information sources in their calculations; while in most of real-world systems, there are sparse data. To tackle this issue, in this paper, a two-step CF method called TCFGA is proposed to provide a set of similar users. In addition, their importance is weighed by employing social trust statements along with rating values. To evaluate the effectiveness of TCFGA, several experiments are performed on two real-world datasets and obtained results show the superiority of TCFGA compared to the others.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 13-16
A collaborative filtering method based on genetic algorithm and trust statements
Collaborative Filtering (CF) is a frequently used recommendation method that has been successfully applied on many real-world systems. An important problem in CF is selecting a proper set of users and employing them in the rating prediction. Most of current similarity metrics incorporate only the rating values and ignore other information sources in their calculations; while in most of real-world systems, there are sparse data. To tackle this issue, in this paper, a two-step CF method called TCFGA is proposed to provide a set of similar users. In addition, their importance is weighed by employing social trust statements along with rating values. To evaluate the effectiveness of TCFGA, several experiments are performed on two real-world datasets and obtained results show the superiority of TCFGA compared to the others.
- Open Access
- 1 December 2017
- Vol. 8 (4) , 425-437
Numerical solution of gas solution in a fluid: fractional derivative model
- 1 December 2017
- Vol. 8 (4) , 425-437
Open AccessNumerical solution of gas solution in a fluid: fractional derivative model
- Open Access
- 20 September 2017
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
- Vol. 24 (6) , 2941-2951
THE NUMERICAL SOLUTION OF THE BAGLEY-TORVIK EQUATION BY EXPONENTIAL INTEGRATORS
This paper presents a family of computational schemes for the solution of the Bagley-Torvik equation. The schemes are based on the reformulation of the original problem into a system of fractional differential equations of order 1/2. Then, suitable exponential integrators are devised to solve the resulting system accurately. The attainable order of convergence of exponential integrators for solving the fractional problem is studied. Theoretical ndings are validated by means of some numerical examples. The advantages of the proposed method are illustrated by comparing several of the existing methods
- 20 September 2017
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
- Vol. 24 (6) , 2941-2951
Open AccessTHE NUMERICAL SOLUTION OF THE BAGLEY-TORVIK EQUATION BY EXPONENTIAL INTEGRATORS
This paper presents a family of computational schemes for the solution of the Bagley-Torvik equation. The schemes are based on the reformulation of the original problem into a system of fractional differential equations of order 1/2. Then, suitable exponential integrators are devised to solve the resulting system accurately. The attainable order of convergence of exponential integrators for solving the fractional problem is studied. Theoretical ndings are validated by means of some numerical examples. The advantages of the proposed method are illustrated by comparing several of the existing methods