Fuad Jamour

Fuad Jamour

Auto-generated profile, based on publicly available information

Fuad Jamour

King Abdullah University of Science and Technology

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
12 March 2015 in International Journal on Document Analysis and Recognition (IJDAR)
Verified
Journal Article
Closed access
PDF file
GAGheith Ali Abandah
Gheith Ali Abandah
AGAlex Graves
Alex Graves
BABalkees Al-Shagoor
Balkees Al-Shagoor
AAAlaa Arabiyat
Alaa Arabiyat
FJFuad Jamour
Fuad Jamour
MAMajid Al-Taee
Majid Al-Taee

1 November 2016
Verified
Conference Paper
Closed access
EAEhab Abdelhamid
Ehab Abdelhamid
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
PKPanos Kalnis
Panos Kalnis
ZKZuhair Khayyat
Zuhair Khayyat
FJFuad Jamour
Fuad Jamour
Frequent Subgraph Mining is an essential operation for graph analytics and knowledge extraction. Due to its high computational cost, parallel solutions are necessary. Existing approaches either suffer from load imbalance, or high communication and synchronization overheads. In this paper we propose ScaleMine; a novel parallel frequent subgraph mining system for a single large graph. ScaleMine introduces a novel two-phase approach. The first phase is approximate; it quickly identifies subgraphs that are frequent with high probability, while collecting various statistics. The second phase computes the exact solution by employing the results of the approximation to achieve good load balance; prune the search space; generate efficient execution plans; and guide intra-task parallelism. Our experiments show that ScaleMine scales to 8,192 cores on a Cray XC40 (12× more than competitors); supports graphs with one billion edges (10× larger than competitors), and is at least an order of magnitude faster than existing solutions.

17 October 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
FJFuad Jamour
Fuad Jamour
Skiadopoulos SpirosSkiadopoulos Spiros
Skiadopoulos Spiros
PKPanos Kalnis
Panos Kalnis
Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large graphs: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving graphs. We decompose the graph into biconnected components and prove that processing can be localized within the affected components. iCentral is the first algorithm to support incremental betweeness centrality computation within a graph component. This is done efficiently, in linear space; consequently, iCentral scales to large graphs. We demonstrate with real datasets that the serial implementation of iCentral is up to 3.7 times faster than existing serial methods. Our parallel implementation that scales to large graphs, is an order of magnitude faster than the state-of-the-art parallel algorithm, while using an order of magnitude less computational resources.

1 March 2014 in International Journal on Document Analysis and Recognition (IJDAR)
Verified
Journal Article
Closed access
PDF file
GAGheith Ali Abandah
Gheith Ali Abandah
FJFuad T. Jamour
Fuad T. Jamour
EAEsam Atallah AlQaralleh
Esam Atallah AlQaralleh

27 June 2017
Verified
Conference Paper
Open access
PDF file
ZAZiyad AlGhamdi
Ziyad AlGhamdi
FJFuad Jamour
Fuad Jamour
SSSpiros Skiadopoulos
Spiros Skiadopoulos
PKPanos Kalnis
Panos Kalnis
Betweenness centrality quantifies the importance of graph nodes in a variety of applications including social, biological and communication networks. Its computation is very costly for large graphs; therefore, many approximate methods have been proposed. Given the lack of a golden standard, the accuracy of most approximate methods is evaluated on tiny graphs and is not guaranteed to be representative of realistic datasets that are orders of magnitude larger. In this paper, we develop BeBeCA, a benchmark for betweenness centrality approximation methods on large graphs. Specifically: (i) We generate a golden standard by deploying a parallel implementation of Brandes algorithm using 96,000 CPU cores on a supercomputer to compute exact betweenness centrality values for several large graphs with up to 126M edges. (ii) We propose an evaluation methodology to assess various aspects of approximation accuracy, such as average error and quality of node ranking. (iii) We survey a large number of existing approximation methods and compare their performance and accuracy using our benchmark. (iv) We publicly share our benchmark, which includes the golden standard exact betweenness centrality values together with the scripts that implement our evaluation methodology; for researchers to compare their own algorithms and practitioners to select the appropriate algorithm for their application and data.

25 March 2019
Verified
Conference Paper
Open access
PDF file
FJFuad Jamour
Fuad Jamour
IAIbrahim Abdelaziz
Ibrahim Abdelaziz
YCYuanzhao Chen
Yuanzhao Chen
PKPanos Kalnis
Panos Kalnis