Big data visual exploration as a recommendation problem Online publication date: Fri, 09-Jun-2023
by Moustafa Sadek Kahil; Abdelkrim Bouramoul; Makhlouf Derdour
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 15, No. 2, 2023
Abstract: Big data visual exploration is believed to be considered as a recommendation problem. This proximity concerns essentially their purpose: it consists in selecting among huge amount of data those that are the most valuable according to specific criteria, to eventually present it to users. On the other hand, the recommendation systems are recently resolved mostly using neural networks (NNs). The present paper proposes three alternative solutions to improve the big data visual exploration based on recommendation using matrix factorisation (MF) namely: conventional, alternating least squares (ALS)-based and NN-based methods. It concerns generating the implicit data used to build recommendations, and providing the most valuable data patterns according to the user profiles. The first two solutions are developed using Apache Spark, while the third one was developed using TensorFlow2. A comparison based on results is done to show the most efficient one. The results show their applicability and effectiveness.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook