Tarek F. Gharib
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tarek F. Gharib has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Sherine Rady
Faculty of Computer and Information Sciences, Ain Shams University, Cairo 11566, Egypt
8 shared publications - Huda Amin Maghawry
Faculty of Computer and Information Sciences,Ain shams University
3 shared publications - Mohammed A. Fouad
Information Systems Department Luxor University, Faculty of Computer and Information Sciences Luxor, Egypt
3 shared publications - Mohammed M. Fouad
Fujitsu Technology Solutions
3 shared publications - Philip S. Yu
University of Illinois Chicago
3 shared publications Wedad Hussein
Faculty of Computer and Information Sciences, Ain Shams University
3 shared publications
Latest Publications
- Open Access
- 17 April 2025
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 9 (4) , 102
Efficient Trajectory Prediction Using Check-In Patterns in Location-Based Social Network
Location-based social networks (LBSNs) leverage geo-location technologies to connect users with places, events, and other users nearby. Using GPS data, platforms like Foursquare enable users to check into locations, share their locations, and receive location-based recommendations. A significant research gap in LBSNs lies in the limited exploration of users’ tendencies to withhold certain location data. While existing studies primarily focus on the locations users choose to disclose and the activities they attend, there is a lack of research on the hidden or intentionally omitted locations. Understanding these concealed patterns and integrating them into predictive models could enhance the accuracy and depth of location prediction, offering a more comprehensive view of user mobility behavior. This paper solves this gap by proposing an Associative Hidden Location Trajectory Prediction model (AHLTP) that leverages user trajectories to infer unchecked locations. The FP-growth mining technique is used in AHLTP to extract frequent patterns of check-in locations, combined with machine-learning methods such as K-nearest-neighbor, gradient-boosted-trees, and deep learning to classify hidden locations. Moreover, AHLTP uses association rule mining to derive the frequency of successive check-in pairs for the purpose of hidden location prediction. The proposed AHLTP integrated with the machine-learning models classifies the data effectively, with the KNN attaining the highest accuracy at 98%, followed by gradient-boosted trees at 96% and deep learning at 92%. Comparative study using a real-world dataset demonstrates the model’s superior accuracy compared to state-of-the-art approaches.
- 17 April 2025
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 9 (4) , 102
Open AccessEfficient Trajectory Prediction Using Check-In Patterns in Location-Based Social Network
Location-based social networks (LBSNs) leverage geo-location technologies to connect users with places, events, and other users nearby. Using GPS data, platforms like Foursquare enable users to check into locations, share their locations, and receive location-based recommendations. A significant research gap in LBSNs lies in the limited exploration of users’ tendencies to withhold certain location data. While existing studies primarily focus on the locations users choose to disclose and the activities they attend, there is a lack of research on the hidden or intentionally omitted locations. Understanding these concealed patterns and integrating them into predictive models could enhance the accuracy and depth of location prediction, offering a more comprehensive view of user mobility behavior. This paper solves this gap by proposing an Associative Hidden Location Trajectory Prediction model (AHLTP) that leverages user trajectories to infer unchecked locations. The FP-growth mining technique is used in AHLTP to extract frequent patterns of check-in locations, combined with machine-learning methods such as K-nearest-neighbor, gradient-boosted-trees, and deep learning to classify hidden locations. Moreover, AHLTP uses association rule mining to derive the frequency of successive check-in pairs for the purpose of hidden location prediction. The proposed AHLTP integrated with the machine-learning models classifies the data effectively, with the KNN attaining the highest accuracy at 98%, followed by gradient-boosted trees at 96% and deep learning at 92%. Comparative study using a real-world dataset demonstrates the model’s superior accuracy compared to state-of-the-art approaches.
- 18 November 2022
- Published by Springer Nature
- p. 587-601
AraFranco: An Arabic Word Embedding Model for Representing Franco-Arabic User-Generated Text
- 18 November 2022
- Published by Springer Nature
- p. 587-601
AraFranco: An Arabic Word Embedding Model for Representing Franco-Arabic User-Generated Text
- 18 November 2022
- Published by Springer Nature
- p. 107-122
An Efficient 2-Stages Classification Model for Students Performance Prediction
- 18 November 2022
- Published by Springer Nature
- p. 107-122
An Efficient 2-Stages Classification Model for Students Performance Prediction
- 9 October 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- p. 1-12
A Hybrid Recommender System Combining Collaborative Filtering with Utility Mining
Based on a variety of information sources, recommender systems can identify specific items for various user interests. Techniques for recommender systems are classified into two types: personalized and non-personalized. Personalized algorithms are based on individual user preferences or collaborative filtering data; as the system learns more about the user, the recommendations will become more satisfying. They do, however, suffer from data sparsity and cold start issues. On the other hand, non-personalized algorithms make recommendations based on the importance of the items in the database; they are very useful when the system has no information about a specific user. Their accuracy, however, is limited by the issue of personalization. In most cases, one of the recommendation categories can be used to make recommendations. Yet, it is a challenge to evaluate the importance of items to the user while simultaneously using personalized and non-personalized preferences functions and ranking a set of candidate items based on these functions. This paper addresses this issue and improves recommendation quality by introducing a new hybrid recommendation technique. The proposed hybrid recommendation technique combines the importance of items to the user obtained by the utility mining method with the similarity weights of items produced by the collaborative filtering technique to make the recommendation process more reasonable and accurate. This technique can provide appropriate recommendations whether or not users have previous purchasing histories. Finally, experimental results show that the proposed hybrid recommendation technique outperforms both implemented collaborative filtering and utility-based recommendation techniques.
- 9 October 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- p. 1-12
A Hybrid Recommender System Combining Collaborative Filtering with Utility Mining
Based on a variety of information sources, recommender systems can identify specific items for various user interests. Techniques for recommender systems are classified into two types: personalized and non-personalized. Personalized algorithms are based on individual user preferences or collaborative filtering data; as the system learns more about the user, the recommendations will become more satisfying. They do, however, suffer from data sparsity and cold start issues. On the other hand, non-personalized algorithms make recommendations based on the importance of the items in the database; they are very useful when the system has no information about a specific user. Their accuracy, however, is limited by the issue of personalization. In most cases, one of the recommendation categories can be used to make recommendations. Yet, it is a challenge to evaluate the importance of items to the user while simultaneously using personalized and non-personalized preferences functions and ranking a set of candidate items based on these functions. This paper addresses this issue and improves recommendation quality by introducing a new hybrid recommendation technique. The proposed hybrid recommendation technique combines the importance of items to the user obtained by the utility mining method with the similarity weights of items produced by the collaborative filtering technique to make the recommendation process more reasonable and accurate. This technique can provide appropriate recommendations whether or not users have previous purchasing histories. Finally, experimental results show that the proposed hybrid recommendation technique outperforms both implemented collaborative filtering and utility-based recommendation techniques.
- 1 August 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- Vol. 22 (3) , 124-137
PREDICTING STUDENTS’ PERFORMANCE USING AN ENHANCED AGGREGATION STRATEGY FOR SUPERVISED MULTICLASS CLASSIFICATION
Predicting students performance efficiently became one of the most interesting research topics. Efficiently mining the educational data is the cornerstone and the first step to make the appropriate intervention to help at-risk students achieve better performance and enhance the educational outcomes. The objective of this paper is to efficiently predict students’ performance by predicting their academic performance level. This is achieved by proposing an enhanced aggregation strategy on a supervised multiclass classification problem to improve the prediction accuracy of students’ performance. Two binary classification techniques: Support Vector Machine (SVM) and Perceptron algorithms, have been experimented to use their output as an input to the proposed aggregation strategy to be compared with a previously used aggregation strategy. The proposed strategy improved the prediction performance and achieved an accuracy, recall, and precision of 75.0%, 76.0%, and 75.48% using Perceptron, respectively. Moreover, The proposed strategy outperformed and achieved an accuracy, recall, and precision of 73.96%, 73.93%, and 75.33% using SVM, respectively.
- 1 August 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- Vol. 22 (3) , 124-137
PREDICTING STUDENTS’ PERFORMANCE USING AN ENHANCED AGGREGATION STRATEGY FOR SUPERVISED MULTICLASS CLASSIFICATION
Predicting students performance efficiently became one of the most interesting research topics. Efficiently mining the educational data is the cornerstone and the first step to make the appropriate intervention to help at-risk students achieve better performance and enhance the educational outcomes. The objective of this paper is to efficiently predict students’ performance by predicting their academic performance level. This is achieved by proposing an enhanced aggregation strategy on a supervised multiclass classification problem to improve the prediction accuracy of students’ performance. Two binary classification techniques: Support Vector Machine (SVM) and Perceptron algorithms, have been experimented to use their output as an input to the proposed aggregation strategy to be compared with a previously used aggregation strategy. The proposed strategy improved the prediction performance and achieved an accuracy, recall, and precision of 75.0%, 76.0%, and 75.48% using Perceptron, respectively. Moreover, The proposed strategy outperformed and achieved an accuracy, recall, and precision of 73.96%, 73.93%, and 75.33% using SVM, respectively.
- 28 July 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- p. 1-12
The Identification of the Top Positive Influential Users of the Social Networks to Help in the Control of Covid-19 Spread
Covid-19 pandemic is considered the most worldwide problem, and causes horrible crises for all human being. Social networks can play a vital role in the prevention of the spread of the Covid-19 pandemic. The top influential users of social networks like Twitter can have positive or negative effect in the broadcast of useful and same time harmful information about how to deal with the virus, and encourage people to follow up the rules announced by World Health Organization (WHO). So the detection of the top positive and negative influential users can help in the control of the spread of the virus. The proposed approach is based on applying influence maximization solutions to identify the top influential users from Twitter social network graph, and to determine if the influence is positive or not. The proposed approach has four main phases, the first phase is collecting Covid-19 pandemic related tweets dataset and extract the related users and their followers. The second phase is creating a social network graph from the collected dataset. The third phase is using LKG influence maximization approach to identify the most effective users from the social network graph. The last phase is based on using hashtags frequency analysis to be able to identify the type of influence of each top influential user.
- 28 July 2022
- Published by Egyptian Knowledge Bank in International Journal of Intelligent Computing and Information Sciences
- p. 1-12
The Identification of the Top Positive Influential Users of the Social Networks to Help in the Control of Covid-19 Spread
Covid-19 pandemic is considered the most worldwide problem, and causes horrible crises for all human being. Social networks can play a vital role in the prevention of the spread of the Covid-19 pandemic. The top influential users of social networks like Twitter can have positive or negative effect in the broadcast of useful and same time harmful information about how to deal with the virus, and encourage people to follow up the rules announced by World Health Organization (WHO). So the detection of the top positive and negative influential users can help in the control of the spread of the virus. The proposed approach is based on applying influence maximization solutions to identify the top influential users from Twitter social network graph, and to determine if the influence is positive or not. The proposed approach has four main phases, the first phase is collecting Covid-19 pandemic related tweets dataset and extract the related users and their followers. The second phase is creating a social network graph from the collected dataset. The third phase is using LKG influence maximization approach to identify the most effective users from the social network graph. The last phase is based on using hashtags frequency analysis to be able to identify the type of influence of each top influential user.
- Open Access
- 19 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 75657-75671
An Efficient Approach for Rational Next-Basket Recommendation
E-commerce is one of the most valuable and popular application scenarios of recommendation technology. In this context, making rational decisions is required due to the necessity of objectivity and decision rationale tracking. However, a significant number of irrational recommendations may be generated as a result of using a narrow range of interestingness criteria, considering inconsistent user preferences, overlooking the temporal weights of items, and using outlier choices in making a prediction. In this paper, we propose an efficient approach called MONBR (Multi-Objective Next-Basket Recommendation) to improve the quality of recommendations. An approach promotes rational recommendations by measuring the temporal importance of items to the user using several interestingness criteria, namely utility, popularity, stability, frequency, occupancy, and novelty. Moreover, combining the multi-criteria weights of items obtained from the MONBR approach with the item-based collaborative filtering technique results in more accurate and reasonable recommendations. Experiment results on real-world datasets demonstrate that the proposed approach improves the quality of recommendations. The average quality of recommendations derived from the proposed approach is up to 60.95% more accurate than state-of-the-art algorithms with a recommended basket size ranging from 10 to 100. Furthermore, the results highlight the importance of adapting objectivity and rationality in the recommendation process to meet the needs of as many users as possible. The average user-level performance is up to 10.21% higher on dense datasets.
- 19 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 75657-75671
Open AccessAn Efficient Approach for Rational Next-Basket Recommendation
E-commerce is one of the most valuable and popular application scenarios of recommendation technology. In this context, making rational decisions is required due to the necessity of objectivity and decision rationale tracking. However, a significant number of irrational recommendations may be generated as a result of using a narrow range of interestingness criteria, considering inconsistent user preferences, overlooking the temporal weights of items, and using outlier choices in making a prediction. In this paper, we propose an efficient approach called MONBR (Multi-Objective Next-Basket Recommendation) to improve the quality of recommendations. An approach promotes rational recommendations by measuring the temporal importance of items to the user using several interestingness criteria, namely utility, popularity, stability, frequency, occupancy, and novelty. Moreover, combining the multi-criteria weights of items obtained from the MONBR approach with the item-based collaborative filtering technique results in more accurate and reasonable recommendations. Experiment results on real-world datasets demonstrate that the proposed approach improves the quality of recommendations. The average quality of recommendations derived from the proposed approach is up to 60.95% more accurate than state-of-the-art algorithms with a recommended basket size ranging from 10 to 100. Furthermore, the results highlight the importance of adapting objectivity and rationality in the recommendation process to meet the needs of as many users as possible. The average user-level performance is up to 10.21% higher on dense datasets.
- Open Access
- 28 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 1419-1431
An Efficient Approach for Mining Reliable High Utility Patterns
Utility mining is one of the most thriving research topics with a wide range of real-world applications. High utility pattern mining uses a utility function to extract all desired patterns that exceed a minimum utility threshold. However, a significant number of patterns will be generated if this threshold is set too low, which is an inherent limitation of these algorithms. This may cause the mining process to be inefficient as it would be difficult to analyze the patterns found. Furthermore, most of these patterns are unreliable and hard to be employed in making decisions. This paper proposed a novel problem of mining reliable high utility patterns by adapting the concept of reliability to mine a significant type of pattern called reliable high utility patterns. To address this issue, an efficient approach named RUPM (Reliable Utility-based Pattern Mining) is presented. RUPM introduces three novel measurements for estimating the reliability of utility-based patterns and proposes several strategies to efficiently handle reliable patterns with high utility values. Experimental results suggest that up to 99% of the patterns discovered by existing traditional high utility pattern mining algorithms were, in fact, unreliable. In contrast, the average reliability proportion in the resultant patterns obtained from the RUPM approach is at least 47.6% higher. Moreover, the proposed pruning strategies provide a reduction in both the runtime and memory usage.
- 28 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 1419-1431
Open AccessAn Efficient Approach for Mining Reliable High Utility Patterns
Utility mining is one of the most thriving research topics with a wide range of real-world applications. High utility pattern mining uses a utility function to extract all desired patterns that exceed a minimum utility threshold. However, a significant number of patterns will be generated if this threshold is set too low, which is an inherent limitation of these algorithms. This may cause the mining process to be inefficient as it would be difficult to analyze the patterns found. Furthermore, most of these patterns are unreliable and hard to be employed in making decisions. This paper proposed a novel problem of mining reliable high utility patterns by adapting the concept of reliability to mine a significant type of pattern called reliable high utility patterns. To address this issue, an efficient approach named RUPM (Reliable Utility-based Pattern Mining) is presented. RUPM introduces three novel measurements for estimating the reliability of utility-based patterns and proposes several strategies to efficiently handle reliable patterns with high utility values. Experimental results suggest that up to 99% of the patterns discovered by existing traditional high utility pattern mining algorithms were, in fact, unreliable. In contrast, the average reliability proportion in the resultant patterns obtained from the RUPM approach is at least 47.6% higher. Moreover, the proposed pruning strategies provide a reduction in both the runtime and memory usage.
- Open Access
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 153266-153275
An Efficient Heartbeats Classifier Based on Optimizing Convolutional Neural Network Model
Recently, deep learning models have emerged as promising methods for the diagnosis of different diseases. Cardiac disease is among the leading life-threatening diseases on a global scale. The aim of this paper is to propose an optimized Convolutional Neural Network (CNN) model for the classification of electrocardiogram (ECG) heartbeat data. The proposed ECG classification approach is designed with an optimal CNN configuration to classify cardiac arrhythmias quickly and effectively. Finding an optimal configuration for the CNN hyperparameters is time-consuming and needs extensive experimentation. To overcome this challenge, we present an optimization step for the proposed CNN model using a customized genetic algorithm. It provides an automatic suggestion for the best hyperparameter settings of the proposed CNN. The challenge in utilizing the genetic algorithm is that its operators need to be customized to handle our problem domain. Our approach accepts raw ECG signals without any preprocessing steps, which has benefit in saving the computation time. Our approach also provides a resampling step to ensure generalization, to better handle imbalanced ECG classes. Experiments show promising results of our proposed approach against other approaches whose CNN hyperparameters setting depended on numerous trials, requiring extensive ECG feature extraction steps, and do not consider imbalanced classes. The performance of our proposed approach is better than other existing methods both in terms of higher classification accuracy (98.45%), and lower computational complexity.
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 153266-153275
Open AccessAn Efficient Heartbeats Classifier Based on Optimizing Convolutional Neural Network Model
Recently, deep learning models have emerged as promising methods for the diagnosis of different diseases. Cardiac disease is among the leading life-threatening diseases on a global scale. The aim of this paper is to propose an optimized Convolutional Neural Network (CNN) model for the classification of electrocardiogram (ECG) heartbeat data. The proposed ECG classification approach is designed with an optimal CNN configuration to classify cardiac arrhythmias quickly and effectively. Finding an optimal configuration for the CNN hyperparameters is time-consuming and needs extensive experimentation. To overcome this challenge, we present an optimization step for the proposed CNN model using a customized genetic algorithm. It provides an automatic suggestion for the best hyperparameter settings of the proposed CNN. The challenge in utilizing the genetic algorithm is that its operators need to be customized to handle our problem domain. Our approach accepts raw ECG signals without any preprocessing steps, which has benefit in saving the computation time. Our approach also provides a resampling step to ensure generalization, to better handle imbalanced ECG classes. Experiments show promising results of our proposed approach against other approaches whose CNN hyperparameters setting depended on numerous trials, requiring extensive ECG feature extraction steps, and do not consider imbalanced classes. The performance of our proposed approach is better than other existing methods both in terms of higher classification accuracy (98.45%), and lower computational complexity.
- 3 January 2021
- Published by Springer Nature in Cognitive Computation
- Vol. 13 (1) , 164-178
Optimizing Sentiment Classification for Arabic Opinion Texts
- 3 January 2021
- Published by Springer Nature in Cognitive Computation
- Vol. 13 (1) , 164-178
Optimizing Sentiment Classification for Arabic Opinion Texts