Nassim Dennouni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nassim Dennouni has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Harbouche
Hassiba Benbouali University
1 shared publication - Djelloul Bettache
Hassiba Benbouali University
1 shared publication - Mourad Loukam
Hassiba Benbouali University of Chlef
1 shared publication - Sara Medjroud
Hassiba Benbouali University
1 shared publication - Zohra Slama
EEDIS Laboratory, Djillali Liabes University of Sidi Bel Abbes, Algeria
1 shared publication - Zoulikha Maghni Sandid
EEDIS Laboratory, Djillali Liabes University of Sidi Bel Abbes, Algeria and Abdelhamid Ben Badis University of Mostaganem, Algeria
1 shared publication
Latest Publications
- Open Access
- 19 September 2026
- Published by River Publishers in Journal of Mobile Multimedia
- p. 475–496
Towards a Reconciliation of Point-of-Interest Recommendation Systems Using Multi-Agent Systems
Point-of-interest (POI) recommendation is a good way to help Smartphone users discover new places by exploiting their preferences and social networks. However, this technique, which is often based on collaborative filtering, suffers from cold-start problem due to insufficient interaction with POIs (ratings) and the absence of declared friendship or trust relationships between users. To address this problem, one solution is to launch several Recommendations Systems (RS) simultaneously, using all available sources of information within the social network, especially in the case of a new user or a new POI. In this paper, a Multi-Agent System for Reconciling POI Recommendation Algorithms (MSRPRA) is proposed to exploit (1) the power of Pearson similarity deduced from POI ratings through the RatAg agent, (2) the effectiveness of Jaccard similarity derived from existing friendship relationships exploited by the FrAg agent and the contribution of trust scores declared by users using the TrAg agent. The system then uses a coordinator agent to merge, using the Borda voting method, the POIs lists generated by the RatAg, FrAg, and TrAg agents. The experimental results show that MSRPRA outperforms approaches based solely on Pearson similarity, Jaccard similarity, or explicit trust. On average, the model improves Precision by 7.38% and Recall by 7.73%, while achieving better precision in terms of RMSE, these results confirm the effectiveness of multi-agent fusion using Borda voting in improving the relevance of recommendations and mitigating the cold-start problem.
- 19 September 2026
- Published by River Publishers in Journal of Mobile Multimedia
- p. 475–496
Open AccessTowards a Reconciliation of Point-of-Interest Recommendation Systems Using Multi-Agent Systems
Point-of-interest (POI) recommendation is a good way to help Smartphone users discover new places by exploiting their preferences and social networks. However, this technique, which is often based on collaborative filtering, suffers from cold-start problem due to insufficient interaction with POIs (ratings) and the absence of declared friendship or trust relationships between users. To address this problem, one solution is to launch several Recommendations Systems (RS) simultaneously, using all available sources of information within the social network, especially in the case of a new user or a new POI. In this paper, a Multi-Agent System for Reconciling POI Recommendation Algorithms (MSRPRA) is proposed to exploit (1) the power of Pearson similarity deduced from POI ratings through the RatAg agent, (2) the effectiveness of Jaccard similarity derived from existing friendship relationships exploited by the FrAg agent and the contribution of trust scores declared by users using the TrAg agent. The system then uses a coordinator agent to merge, using the Borda voting method, the POIs lists generated by the RatAg, FrAg, and TrAg agents. The experimental results show that MSRPRA outperforms approaches based solely on Pearson similarity, Jaccard similarity, or explicit trust. On average, the model improves Precision by 7.38% and Recall by 7.73%, while achieving better precision in terms of RMSE, these results confirm the effectiveness of multi-agent fusion using Borda voting in improving the relevance of recommendations and mitigating the cold-start problem.
- Open Access
- 1 November 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 40 (2) , 814-828
Improving recommendations with implicit trust propagation from ratings and check-ins
This paper investigates how the propagation of implicit trust between users affects the quality of point-of-interest (POI) recommendations in location-based social networks (LBSNs). Through the analysis of user interactions via ratings and check-ins, this work proposes a recommendation model known as propagation of rating/check-in for implicit trust (PRCT). This model relies on two primary approaches: Similarity trust rating (STR), which utilizes user ratings, and similarity trust check-in (STC), which focuses on check-ins data. Both approaches employ trust propagation to enhance their similarity matrices between users. An evaluation of the PRCT model using the Yelp dataset shows that the STR approach surpasses other variants in terms of PRECISION and RECALL, while the STC approach demonstrates superior performance in terms of RMSE. Furthermore, while trust propagation in the PRCT model increases the density of its similarity matrices, it does not consistently enhance its PRECISION parameter. Only the similarity Jaccard check-in (SJC) and similarity cosine check-in (SCC) approaches show a significant improvement of this parameter.
- 1 November 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 40 (2) , 814-828
Open AccessImproving recommendations with implicit trust propagation from ratings and check-ins
This paper investigates how the propagation of implicit trust between users affects the quality of point-of-interest (POI) recommendations in location-based social networks (LBSNs). Through the analysis of user interactions via ratings and check-ins, this work proposes a recommendation model known as propagation of rating/check-in for implicit trust (PRCT). This model relies on two primary approaches: Similarity trust rating (STR), which utilizes user ratings, and similarity trust check-in (STC), which focuses on check-ins data. Both approaches employ trust propagation to enhance their similarity matrices between users. An evaluation of the PRCT model using the Yelp dataset shows that the STR approach surpasses other variants in terms of PRECISION and RECALL, while the STC approach demonstrates superior performance in terms of RMSE. Furthermore, while trust propagation in the PRCT model increases the density of its similarity matrices, it does not consistently enhance its PRECISION parameter. Only the similarity Jaccard check-in (SJC) and similarity cosine check-in (SCC) approaches show a significant improvement of this parameter.
- Open Access
- 1 October 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 40 (1) , 379-387
Enhancing points of interest recommendation by integrating users’ proximity into the calculation of their similarities
In recent years, tourists have increasingly used location-based social networks (LBSNs) to share their travel experiences with friends. Within the context of smart tourism, collaborative filtering (CF) is widely recognized as one of the most commonly used methods for point-of-interest (POI) recommendation systems. This approach analyzes user similarities using measures such Jaccard, or cosine similarity to predict the probabilities of choosing POIs to visit. However, traditional similarity measures fail to account for the physical distances between users and the locations of POIs. To address these limitations, we propose a novel similarity measure called IPUMC (integrating proximity of users in modified cosine similarity). This measure builds on the cosine similarity approach while incorporating geographic proximity between users into the calculation. Experimental results conducted on the Foursquare dataset reveal that IPUMC improves precision by 8.14%, mean average precision (MAP) by 18.01%, and normalized discounted cumulative gain (NDCG) by 16.99% compared to traditional similarity measures, specifically Pearson correlation, Spearman correlation, Euclidean distance, cosine similarity, adjusted cosine and Jaccard.
- 1 October 2025
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 40 (1) , 379-387
Open AccessEnhancing points of interest recommendation by integrating users’ proximity into the calculation of their similarities
In recent years, tourists have increasingly used location-based social networks (LBSNs) to share their travel experiences with friends. Within the context of smart tourism, collaborative filtering (CF) is widely recognized as one of the most commonly used methods for point-of-interest (POI) recommendation systems. This approach analyzes user similarities using measures such Jaccard, or cosine similarity to predict the probabilities of choosing POIs to visit. However, traditional similarity measures fail to account for the physical distances between users and the locations of POIs. To address these limitations, we propose a novel similarity measure called IPUMC (integrating proximity of users in modified cosine similarity). This measure builds on the cosine similarity approach while incorporating geographic proximity between users into the calculation. Experimental results conducted on the Foursquare dataset reveal that IPUMC improves precision by 8.14%, mean average precision (MAP) by 18.01%, and normalized discounted cumulative gain (NDCG) by 16.99% compared to traditional similarity measures, specifically Pearson correlation, Spearman correlation, Euclidean distance, cosine similarity, adjusted cosine and Jaccard.