Heba Helal

Mrs. Heba Helal

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
2 April 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
HHHeba Helal
Heba Helal
Farag SallabiFarag Sallabi
Farag Sallabi
MSMohamed Sharaf
Mohamed Sharaf
SISaad TATI YOUSF LXA MA IPX
Saad TATI YOUSF LXA MA IPX
MHMohammad Hayajneh
Mohammad Hayajneh
HKHeba Moustafa Khater
Heba Moustafa Khater
Wireless body area networks (WBANs) have emerged as a promising solution for addressing challenges faced by elderly individuals, limited medical facilities, and various chronic medical conditions. WBANs consist of wearable sensing and computing devices interconnected through wireless communication channels, enabling the collection and transmission of vital physiological data. However, the energy constraints of the battery-powered sensor nodes in WBANs pose a significant challenge to ensuring long-term operational efficiency. Two-hop routing protocols have been suggested to extend the stability period and maximize the network’s lifetime. These protocols select appropriate parent nodes or forwarders with a maximum of two hops to relay data from sensor nodes to the sink. While numerous energy-efficient routing solutions have been proposed for WBANs, reliability has often been overlooked. Our paper introduces an energy-efficient routing protocol called a Hybrid Clustering Approach for Extending WBAN Lifetime (HCEL) to address these limitations. HCEL leverages a utility function to select parent nodes based on residual energy (RE), proximity to the sink node, and the received signal strength indicator (RSSI). The parent node selection process also incorporates an energy threshold value and a constrained number of serving nodes. The main goal is to extend the overall lifetime of all nodes within the network. Through extensive simulations, the study shows that HCEL outperforms both Stable Increased Throughput Multihop Protocol for Link Efficiency (SIMPLE) and Energy-Efficient Reliable Routing Scheme (ERRS) protocols in several key performance metrics. The specific findings of our article highlight the superior performance of HCEL in terms of increased network stability, extended network lifetime, reduced energy consumption, improved data throughput, minimized delays, and improved link reliability.

6 June 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
MSMohamed Sharaf
Mohamed Sharaf
HHHeba Helal
Heba Helal
NZNazar Zaki
Nazar Zaki
WAWadha Alketbi
Wadha Alketbi
LALatifa ALkaabi
Latifa ALkaabi
FAFatmah Rashed Alhefeiti
Fatmah Rashed Alhefeiti
Analyzing crowdfunding data has been the focus of many research efforts, where analysts typically explore this data to identify the main factors and characteristics of the lending process as well as to discover unique patterns and anomalies in loan distributions. However, the manual exploration and visualization of such data is clearly an ad hoc, time-consuming, and labor-intensive process. Hence, in this work, we propose LoanVis, which is an automated solution for discovering and recommending those valuable and insightful visualizations. LoanVis is a data-driven system that utilizes objective metrics to quantify the “interestingness” of a visualization and employs such metrics in the recommendation process. We demonstrate the effectiveness of LoanVis in analyzing and exploring different aspects of the Kiva crowdfunding dataset.

22 December 2025 in IEEE Access
Verified
Journal Article
Open access
HHHeba Helal
Heba Helal
MSMohamed Sharaf
Mohamed Sharaf
PCPanos K. Chrysanthis
Panos K. Chrysanthis
Exploring time series data to visually extract interesting insights is an essential yet challenging task due to the high dimensionality and complexity of such data. We focus on cross-dissimilarities among time series subsequence pairs. Existing state-of-the-art techniques, however, rely on a fixed subsequence length, limiting their ability to uncover insights at varying scales. While discovering insights across different lengths (i.e., adaptive approaches) could yield richer insights, an exhaustive search over all possible lengths is computationally expensive. To overcome these challenges, we propose ADVisE (ADaptive Visual Exploration), a novel optimization technique that efficiently uncovers interesting visual insights by computing cross-dissimilarities across a range of subsequence lengths. ADVisE achieves substantial computational savings by leveraging shared computations through overlapping visualizations and pruning computations by eliminating unnecessary operations from unpromising candidates early. To further improve result diversity, we introduce AD2VisE (ADaptive Diversification Visual Exploration), which incorporates multi-objective optimization to jointly maximize dissimilarity and promote diversity. Extensive experiments on real-world datasets show that AD2VisE consistently uncovers diverse, non-redundant insights across multiple subsequence lengths while reducing computational costs by a significant margin compared to the exhaustive method. These results demonstrate the potential of our approach for scalable, high-quality time series visual exploration.

16 February 2026 in Big Data and Cognitive Computing
Verified
Journal Article
Open access
PDF file
HHHeba Helal
Heba Helal
MSMohamed Sharaf
Mohamed Sharaf
Visual exploration of time series data is essential for uncovering meaningful insights in domains such as healthcare monitoring and financial analysis, yet it remains computationally challenging due to the combinatorial explosion of potential subsequence comparisons. For long time series, an exhaustive comparison of all possible subsequence pairs becomes prohibitively expensive, limiting interactive exploration. This paper presents the TiVEx (Time Series Visual Exploration) family of algorithms for efficiently discovering the top-k most dissimilar subsequence pairs in comparative time series analysis. TiVEx achieves scalability through three complementary strategies: TiVEx-sharing exploits computational reuse across overlapping subsequence windows, eliminating redundant distance calculations; TiVEx-pruning employs distance-based upper bounds to eliminate unpromising candidates without exhaustive evaluation; and TiVEx-hybrid integrates both mechanisms to maximize efficiency gains. The key observation is that overlapping subsequences share a substantial computational structure, which can be systematically exploited while maintaining result optimality through provably correct pruning bounds. Extensive experiments on six diverse datasets demonstrate that TiVEx-hybrid achieves up to 84% reduction in distance calculations compared to exhaustive search while producing identical top-k results. Compared to state-of-the-art subsequence comparison methods, TiVEx-hybrid achieves 2.3× improvement in computational efficiency. Our effectiveness analysis confirms that TiVEx achieves result quality within 5% of exhaustive search even when exploring only a subset of candidate positions, enabling scalable visual exploration without compromising insight quality.