Shaikh Arifuzzaman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shaikh Arifuzzaman has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Naw Safrin Sattar
Department of Computer Science and Data Science SACS Meharry Medical College Nashville USA
3 shared publications Costain Nachuma
University of New Orleans
2 shared publicationsJoseph Imseis
University of New Orleans
2 shared publicationsMinhaz Zibran
Computer Science Department at the University of New Orleans
2 shared publicationsZakirul Alam Bhuiyan
Fordham University
2 shared publicationsElias Ioup
US Naval Research Laboratory, Stennis Space Center
1 shared publication
Latest Publications
- 22 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (7) , 10275-10309
Scalable distributed Louvain algorithm for community detection in large graphs
- 22 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (7) , 10275-10309
Scalable distributed Louvain algorithm for community detection in large graphs
- Open Access
- 30 June 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (13) , 6128
COVID-19 Vaccination Awareness and Aftermath: Public Sentiment Analysis on Twitter Data and Vaccinated Population Prediction in the USA
Social media, such as Twitter, is a source of exchanging information and opinion on global issues such as COVID-19 pandemic. In this study, we work with a database of around million tweets collected across five weeks of April–May 2021 to draw conclusions about public sentiments towards the vaccination outlook when vaccinations become widely available to the population during the COVID-19 pandemic. We deploy natural language processing and sentiment analysis techniques to reveal insights about COVID-19 vaccination awareness among the public. Our results show that people have positive sentiments towards taking COVID-19 vaccines instead of some adverse effects of some of the vaccines. We also analyze people’s attitude towards the safety measures of COVID-19 after receiving the vaccines. Again, the positive sentiment is higher than that of negative in terms of maintaining safety measures against COVID-19 among the vaccinated population. We also project that around and of the US population will get at least one dose of vaccine and be fully vaccinated, respectively, by the end of July 2021 according to our forecast model. This study will help to understand public reaction and aid the policymakers to project the vaccination campaign as well as health and safety measures in the ongoing global health crisis.- 30 June 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (13) , 6128
Open AccessCOVID-19 Vaccination Awareness and Aftermath: Public Sentiment Analysis on Twitter Data and Vaccinated Population Prediction in the USA
Social media, such as Twitter, is a source of exchanging information and opinion on global issues such as COVID-19 pandemic. In this study, we work with a database of around million tweets collected across five weeks of April–May 2021 to draw conclusions about public sentiments towards the vaccination outlook when vaccinations become widely available to the population during the COVID-19 pandemic. We deploy natural language processing and sentiment analysis techniques to reveal insights about COVID-19 vaccination awareness among the public. Our results show that people have positive sentiments towards taking COVID-19 vaccines instead of some adverse effects of some of the vaccines. We also analyze people’s attitude towards the safety measures of COVID-19 after receiving the vaccines. Again, the positive sentiment is higher than that of negative in terms of maintaining safety measures against COVID-19 among the vaccinated population. We also project that around and of the US population will get at least one dose of vaccine and be fully vaccinated, respectively, by the end of July 2021 according to our forecast model. This study will help to understand public reaction and aid the policymakers to project the vaccination campaign as well as health and safety measures in the ongoing global health crisis. - 5 November 2019
- Published by Springer Nature
- p. C1
Correction to: On the Assessment of Security and Performance Bugs in Chromium Open-Source Project
- 5 November 2019
- Published by Springer Nature
- p. C1
Correction to: On the Assessment of Security and Performance Bugs in Chromium Open-Source Project
- 5 November 2019
- Published by Springer Nature
- p. 131-144
Assessing the Dependability of Apache Spark System: Streaming Analytics on Large-Scale Ocean Data
- 5 November 2019
- Published by Springer Nature
- p. 131-144
Assessing the Dependability of Apache Spark System: Streaming Analytics on Large-Scale Ocean Data
- 5 November 2019
- Published by Springer Nature
- p. 145-157
On the Assessment of Security and Performance Bugs in Chromium Open-Source Project
- 5 November 2019
- Published by Springer Nature
- p. 145-157
On the Assessment of Security and Performance Bugs in Chromium Open-Source Project
- 10 April 2019
- Published by Springer Nature
- p. 77-90
Overcoming MPI Communication Overhead for Distributed Community Detection
- 10 April 2019
- Published by Springer Nature
- p. 77-90
Overcoming MPI Communication Overhead for Distributed Community Detection
- Open Access
Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs
Big graphs (networks) arising in numerous application areas pose significant challenges for graph analysts as these graphs grow to billions of nodes and edges and are prohibitively large to fit in the main memory. Finding the number of triangles in a graph is an important problem in the mining and analysis of graphs. In this paper, we present two efficient MPI-based distributed memory parallel algorithms for counting triangles in big graphs. The first algorithm employs overlapping partitioning and efficient load balancing schemes to provide a very fast parallel algorithm. The algorithm scales well to networks with billions of nodes and can compute the exact number of triangles in a network with 10 billion edges in 16 minutes. The second algorithm divides the network into non-overlapping partitions leading to a space-efficient algorithm. Our results on both artificial and real-world networks demonstrate a significant space saving with this algorithm. We also present a novel approach that reduces communication cost drastically leading the algorithm to both a space- and runtime-efficient algorithm. Further, we demonstrate how our algorithms can be used to list all triangles in a graph and compute clustering coefficients of nodes. Our algorithm can also be adapted to a parallel approximation algorithm using an edge sparsification method.
Open AccessDistributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs
Big graphs (networks) arising in numerous application areas pose significant challenges for graph analysts as these graphs grow to billions of nodes and edges and are prohibitively large to fit in the main memory. Finding the number of triangles in a graph is an important problem in the mining and analysis of graphs. In this paper, we present two efficient MPI-based distributed memory parallel algorithms for counting triangles in big graphs. The first algorithm employs overlapping partitioning and efficient load balancing schemes to provide a very fast parallel algorithm. The algorithm scales well to networks with billions of nodes and can compute the exact number of triangles in a network with 10 billion edges in 16 minutes. The second algorithm divides the network into non-overlapping partitions leading to a space-efficient algorithm. Our results on both artificial and real-world networks demonstrate a significant space saving with this algorithm. We also present a novel approach that reduces communication cost drastically leading the algorithm to both a space- and runtime-efficient algorithm. Further, we demonstrate how our algorithms can be used to list all triangles in a graph and compute clustering coefficients of nodes. Our algorithm can also be adapted to a parallel approximation algorithm using an edge sparsification method.