Eyad Kannout

dblp:276/0273 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0001-7543-774XORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 4 first-author · 4 since 2021Software engineering, systems software and programming languages · 4 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2024 Forecasting Stock Trends with Feedforward Neural Networks
abstract
Stock market prediction stands as a complex and crucial task, pivotal for enhancing the overall stability and efficiency of financial markets by offering essential insights into market movements and trends.In this study, we introduce a simple yet potent model based on feedforward neural networks to tackle this challenge effectively.Our approach leverages advancements in machine learning and deep learning to analyze large datasets of financial statements, demonstrating promising results in forecasting stock trends.
Marcin Traskowski, Eyad Kannout
FedCSIS2
2022 Speeding Up Recommender Systems Using Association Rules
Eyad Kannout, Hung Son Nguyen, Marek Grzegorowski
ACIIDS (2)1
2022 Utilizing Frequent Pattern Mining for Solving Cold-Start Problem in Recommender Systems
abstract
Although several approaches have been proposed throughout the last decade to build recommender systems (RS), most of them suffer from the cold-start problem.This problem occurs when a new item hits the system or a new user signs up.It is generally recognized that the ability to handle cold users and items is one of the key success factors of any new recommender algorithm.This paper introduces a frequent pattern mining framework for recommender systems (FPRS) -a novel approach to address this challenging task.FPRS is a hybrid RS that incorporates collaborative and content-based recommendation algorithms and employs a frequent pattern (FP) growth algorithm.The article proposes several strategies to combine the generated frequent itemsets with content-based methods to mitigate the cold-start problem for both new users and new items.The performed empirical evaluation confirmed its usefulness.Furthermore, the developed solution can be easily combined with any other approach to build a recommender system and can be further extended to make up a complete and standalone RS.Index Terms-recommendation system, cold-start problem, frequent pattern mining, quality of recommendations.
Eyad Kannout, Michal Grodzki, Marek Grzegorowski
FedCSIS1
2022 Considering various aspects of models' quality in the ML pipeline - application in the logistics sector
abstract
The industrial machine learning applications today involve developing and deploying MLOps pipelines to ensure the versatile quality of forecasting models over an extended period, simultaneously assuring the model's accuracy, stability, short training time, and resilience.In this study, we present the ML pipeline conforming to all the abovementioned aspects of models' quality formulated as a constrained multi-objective optimization problem.We also provide the reference implementation on stateof-the-art methods for data preprocessing, feature extraction, dimensionality reduction, feature and instance selection, model fitting, and ensemble blending.The experimental study on the real data set from the logistics industry confirmed the qualities of the proposed approach, as the successful participation in an international data competition did.
Eyad Kannout, Michal Grodzki, Marek Grzegorowski
FedCSIS1
2020 Context Clustering-based Recommender Systems
abstract
Recommender systems have gained lots of attention due to the rapid increase in the amount of data on the internet.Therefore, the demand for finding more advanced techniques to generate more useful recommendations becomes an urgent.The increasing need for generating more relevant recommendations led to the emergence of many novel recommendation systems, such as Context-aware Recommender System (CARS), which is based on incorporating the contextual information in recommendation systems.The goal of this paper is to propose new recommender systems that utilize the contextual information to find more relevant recommendations.In this paper, we propose CoCl, a novel Context Clusteringbased recommender system.We introduce two approaches which utilize the contextual information and KMeans clustering algorithm to generate new forms of user-item matrices.We show that the accuracy of CoCl which uses the new user-item matrices has been improved comparing with the accuracy of classical recommender system which uses the original user-item matrix.
Eyad Kannout
FedCSIS1