Hoda M. O. Mokhtar

Prof. Hoda M. O. Mokhtar


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2022 in Egyptian Informatics Journal
Verified
Journal Article
Open access
MHMariam M. Hassan
Mariam M. Hassan
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar

29 June 2022 in IEEE Access
Verified
Journal Article
Open access
MRMohamed Ramadan
Mohamed Ramadan
AEAyman El-Kilany
Ayman El-Kilany
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar
ISIbrahim Sobh
Ibrahim Sobh
With the current availability of massive datasets and scalability requirements, different systems are required to provide their users with the best performance possible in terms of speed. On the physical level, performance can be translated into queries’ execution time in database management systems. Queries have to execute efficiently (i.e. in minimum time) to meet users’ needs, which puts an excessive burden on the database management system (DBMS). In this paper, we mainly focus on enhancing the query optimizer, which is one of the main components in DBMS that is responsible for choosing the optimal query execution plan and consequently determines the query execution time. Inspired by recent research in reinforcement learning in different domains, this paper proposes A Deep Reinforcement Learning Based Query Optimizer (RL_QOptimizer), a new approach to find the best policy for join order in the query plan which depends solely on the reward system of reinforcement learning. The experimental results show that a notable advantage of the proposed approach against the existing query optimization model of PostgreSQL DBMS.

15 January 2020 in IEEE Access
Verified
Journal Article
Open access
MAMohammed Abdalla
Mohammed Abdalla
AHAbdeltawab Hendawi
Abdeltawab Hendawi
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar
NENeveen Elgamal
Neveen Elgamal
JKJohn Krumm
John Krumm
MAMohamed Ali
Mohamed Ali
Trajectory prediction techniques play a serious role in many location-based services such as mobile advertising, carpooling, taxi services, traffic management, and routing services. These techniques rely on the object’s motion history to predict the future path(s). As a consequence, these techniques fail when history is unavailable. The unavailability of history might occur for several reasons such as; history might be inaccessible, a recently registered user with no preceding history, or previously logged data is preserved for confidentiality and privacy. This paper presents a Bi-directional recurrent deep-learning based prediction system, named DeepMotions , to predict the future path of a query object without any prior knowledge of the object historical motions. The main idea of DeepMotions is to observe the moving objects in the vicinity that have similar motion patterns of the query object. Then use those similar objects to train and predict the query object’s future steps. To compute similarity, we propose a similarity function that is based on the KNN algorithm. Extensive experiments conducted on real data sets confirm the efficient performance and the quality of prediction in DeepMotions with up to 96% accuracy.

Verified
Journal Article
Open access
PDF file
EEEman El-dawy
Eman El-dawy
AHAbdeltawab Hendawi
Abdeltawab Hendawi
MAMohammed Abdalla
Mohammed Abdalla
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar
Taxicabs and rideshare cars nowadays are equipped with GPS devices that enable capturing a large volume of traces. These GPS traces represent the moving behavior of the car drivers. Indeed, the real-time discovery of fraud drivers earlier is a demand for saving the passenger’s life and money. For this purpose, this paper proposes a novel time-based system, namely FraudMove, to discover fraud drivers in real-time by identifying outlier active trips. Mainly, the proposed FraudMove system computes the time of the most probable path of a trip. For trajectory outlier detection, a trajectory is considered an outlier trajectory if its time exceeds the time of this computed path by a specified threshold. FraudMove employs a tunable time window parameter to control the number of checks for detecting outlier trips. This parameter allows FraudMove to trade responsiveness with efficiency. Unlike other related works that wait until the end of a trip to indicate that it was an outlier, FraudMove discovers outlier trips instantly during the trip. Extensive experiments conducted on a real dataset confirm the efficiency and effectiveness of FraudMove in detecting outlier trajectories. The experimental results prove that FraudMove saves the response time of the outlier check process by up to 65% compared to the state-of-the-art systems.

1 January 2018
Verified
Conference Paper
Open access
AEAmani H. B. Eissa
Amani H. B. Eissa
MEMohamed E. El-Sharkawi
Mohamed E. El-Sharkawi
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar

13 August 2020 in IEEE Access
Verified
Journal Article
Open access
WMWafaa Moamen
Wafaa Moamen
HMHoda M. O. Mokhtar
Hoda M. O. Mokhtar
MEMohamed E. El-Sharkawi
Mohamed E. El-Sharkawi
Community search is the task of discovering dense subgraph that satisfy a set of given query parameters. Most community search algorithms consider link structure while ignoring link weight. A recent study proposed the idea of discovering weighted communities which focuses on both link structure and link weight using an online search approach and index-based approach. In this paper two online algorithms are proposed to scale-up the existing online approach efficiency. Performance evaluation of the proposed algorithms against the existing online approach over different datasets shows a great improvement in terms of search and query evaluation time.