Yassin Laaziz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yassin Laaziz has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Abdelhak Tali
LabTIC, National School of Applied Sciences, Abdelmalek Essaadi University, Campus Ziaten, Tangier 90000, Morocco
1 shared publication - Alexandru Vulpe
Telecommunications Department, Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology POLITEHNICA Bucharest, Bucharest, Romania
1 shared publication - Habeeb Salaudeen
Department of Computer Engineering, Faculty of Engineering, Cyprus International University, Nicosia 99010, Cyprus
1 shared publication - Mohamed Khoali
LabTIC, National School of Applied Sciences, Abdelmalek Essaadi University, Campus Ziaten, Tangier 90000, Morocco
1 shared publication - Omayma Belkadi
National School of Applied Sciences Tangier, LabTIC, Abdelmalek Essaadi University, Tetouan 93002, Morocco
1 shared publication - Simona Halunga
Telecommunications Department, Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology POLITEHNICA Bucharest, Bucharest, Romania
1 shared publication
Latest Publications
- Open Access
- 10 March 2022
- Published by MDPI AG in Electronics
- Vol. 11 (6) , 878
A Survey of One Class E-Commerce Recommendation System Techniques
Although several recommendation algorithms are widely used by both commercial and non-commercial platforms, they face unique challenges such as sparse data sets and the absence of negative or “neutral” feedback. One-class algorithms attempt to overcome the data sparsity problem by using the implicit feedback inherent in user’s clicks and purchases, which are deduced from both positive and negative feedback. Existing literature uses several heuristic strategies to derive the negative samples needed for training, such as using random sampling or utilizing user-item interaction. However, these assumptions do not always reflect reality. In addition, with the explosive increase in the availability of big data for training recommendation systems, these methods might not adequately encapsulate the representations of the latent vectors. In this paper, we address the common issues of one-class recommendation and provide a survey on approaches that have been used to mitigate the existing challenges. To tackle the identified problems, we propose a neural network-based Bayesian Personalized Ranking (BPR) for item recommendation and personalized ranking from implicit feedback. BPR provides an optimization criterion derived from Bayesian analysis of a problem to develop an optimized model for such a problem. We conduct several experiments on two varieties of MovieLens datasets to illustrate the performance of the proposed approach. Our approach shows an impressive result in mitigating the issues of one-class recommendation when compared with the complexity of the state-of-the-art methods.
- 10 March 2022
- Published by MDPI AG in Electronics
- Vol. 11 (6) , 878
Open AccessA Survey of One Class E-Commerce Recommendation System Techniques
Although several recommendation algorithms are widely used by both commercial and non-commercial platforms, they face unique challenges such as sparse data sets and the absence of negative or “neutral” feedback. One-class algorithms attempt to overcome the data sparsity problem by using the implicit feedback inherent in user’s clicks and purchases, which are deduced from both positive and negative feedback. Existing literature uses several heuristic strategies to derive the negative samples needed for training, such as using random sampling or utilizing user-item interaction. However, these assumptions do not always reflect reality. In addition, with the explosive increase in the availability of big data for training recommendation systems, these methods might not adequately encapsulate the representations of the latent vectors. In this paper, we address the common issues of one-class recommendation and provide a survey on approaches that have been used to mitigate the existing challenges. To tackle the identified problems, we propose a neural network-based Bayesian Personalized Ranking (BPR) for item recommendation and personalized ranking from implicit feedback. BPR provides an optimization criterion derived from Bayesian analysis of a problem to develop an optimized model for such a problem. We conduct several experiments on two varieties of MovieLens datasets to illustrate the performance of the proposed approach. Our approach shows an impressive result in mitigating the issues of one-class recommendation when compared with the complexity of the state-of-the-art methods.
- 1 January 2020
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Telfor Journal
- Vol. 12 (2) , 74-79
OpenDaylight and OpenNebula integration: Testing traffic management
Software-Defined Networking (SDN) and Cloud Computing are now two of the most adopted technologies, on which many organizations are working to enhance every day. For instance, SDN is particularly emerging to solve networking complexity in cloud data centers, so we see many attempts to integrate Network and Cloud Managers. In this paper, we address an integration of these two technologies, particularly a yet undiscussed combination of two popular frameworks: OpenNebula and OpenDaylight. These open source solutions are widely used for cloud management and network management, yet there are no developed modules for communication between the two. Therefore, we propose a simple way for OpenDaylight to manage OpenNebula's compute nodes, using a common component they both support: OpenvSwitch. We compared OpenNebula with the popular OpenStack cloud manager, as it is attracting more attention in both academia and industry, by evaluating some relevant time metrics and discussing the differences of the proposed technologies. Then, we deployed a test topology to conduct some traffic management techniques in this integration. Our results show that OpenNebula's deployment time as well as clean-up time is significantly lower than OpenStack, but OpenStack takes less time to the running state, besides proving the simplicity of traffic management in OpenNebula using OpenDaylight.
- 1 January 2020
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Telfor Journal
- Vol. 12 (2) , 74-79
OpenDaylight and OpenNebula integration: Testing traffic management
Software-Defined Networking (SDN) and Cloud Computing are now two of the most adopted technologies, on which many organizations are working to enhance every day. For instance, SDN is particularly emerging to solve networking complexity in cloud data centers, so we see many attempts to integrate Network and Cloud Managers. In this paper, we address an integration of these two technologies, particularly a yet undiscussed combination of two popular frameworks: OpenNebula and OpenDaylight. These open source solutions are widely used for cloud management and network management, yet there are no developed modules for communication between the two. Therefore, we propose a simple way for OpenDaylight to manage OpenNebula's compute nodes, using a common component they both support: OpenvSwitch. We compared OpenNebula with the popular OpenStack cloud manager, as it is attracting more attention in both academia and industry, by evaluating some relevant time metrics and discussing the differences of the proposed technologies. Then, we deployed a test topology to conduct some traffic management techniques in this integration. Our results show that OpenNebula's deployment time as well as clean-up time is significantly lower than OpenStack, but OpenStack takes less time to the running state, besides proving the simplicity of traffic management in OpenNebula using OpenDaylight.