Ahmed Shamsul Arefin
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
Ahmed Shamsul Arefin has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Pablo Moscato
University of Newcastle
9 shared publications - Regina Berretta
The University of Newcastle
7 shared publications - Carlos Riveros
Hunter Medical Research Institute
4 shared publications - Luke Mathieson
University of Technology Sydney
2 shared publications - Michaela D. Filiou
Laboratory of Biochemistry, Department of Biological Applications and Technology, School of Health Sciences University of Ioannina Ioannina Greece
2 shared publications Abul Kashem Mia
Institute of Information and Communication Technology, BUET, Dhaka, Bangladesh
1 shared publication
Latest Publications
- 3 September 2015
- Published by Georg Thieme Verlag KG in Pharmacopsychiatry
- Vol. 48 (06) , A15
Alzheimerʼs disease, Parkinsonʼs disease and schizophrenia are not inflammatory diseases while inflammation is recognizable beyond organ borders
‘Neuroinflammation’, a widely applied term in neuroscience, has no generally accepted neuropathological tissue correlates. ‘Inflammation’, characterized by the presence of perivascular infiltrates of cells of the adaptive immune system, is indeed observed in the CNS under certain conditions. Authors who refer to microglial activation as neuroinflammation confuse this issue because autoimmune neuroinflammation serves as a synonym for multiple sclerosis, the prototypical inflammatory disease of the CNS [1]. In this study, we have performed a data-driven, hypothesis-free in silico analysis to address this nomenclatorial confusion. Using two different data analysis methods, we have examined whether unsupervised analysis microarray data obtained from human cerebral cortex of Alzheimerʼs, Parkinsonʼs and schizophrenia patients show similar molecular signatures with recognized inflammatory conditions including multiple sclerosis. We report that very different sets of genes with altered expression profiles are involved in the two disease groups, namely neurodegenerative/neurodevelopmental and inflammatory disorders [2]. Our results show that the designations ‘inflammation’ and ‘neuroinflammation’ are not interchangeable and represent different categories both at the histophenotypic and transcriptomic level. Therefore, the term ‘non-autoimmune neuroinflammation’ still needs to be clarified. This study was supported by DFG, ARC [1] Graeber Brain Pathol 2014; 24:620–2 [2] Filiou et al. Neurogenetics 2014; 15:201–12
- 3 September 2015
- Published by Georg Thieme Verlag KG in Pharmacopsychiatry
- Vol. 48 (06) , A15
Alzheimerʼs disease, Parkinsonʼs disease and schizophrenia are not inflammatory diseases while inflammation is recognizable beyond organ borders
‘Neuroinflammation’, a widely applied term in neuroscience, has no generally accepted neuropathological tissue correlates. ‘Inflammation’, characterized by the presence of perivascular infiltrates of cells of the adaptive immune system, is indeed observed in the CNS under certain conditions. Authors who refer to microglial activation as neuroinflammation confuse this issue because autoimmune neuroinflammation serves as a synonym for multiple sclerosis, the prototypical inflammatory disease of the CNS [1]. In this study, we have performed a data-driven, hypothesis-free in silico analysis to address this nomenclatorial confusion. Using two different data analysis methods, we have examined whether unsupervised analysis microarray data obtained from human cerebral cortex of Alzheimerʼs, Parkinsonʼs and schizophrenia patients show similar molecular signatures with recognized inflammatory conditions including multiple sclerosis. We report that very different sets of genes with altered expression profiles are involved in the two disease groups, namely neurodegenerative/neurodevelopmental and inflammatory disorders [2]. Our results show that the designations ‘inflammation’ and ‘neuroinflammation’ are not interchangeable and represent different categories both at the histophenotypic and transcriptomic level. Therefore, the term ‘non-autoimmune neuroinflammation’ still needs to be clarified. This study was supported by DFG, ARC [1] Graeber Brain Pathol 2014; 24:620–2 [2] Filiou et al. Neurogenetics 2014; 15:201–12
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 500-507
Identifying Communities of Trust and Confidence in the Charity and Not-for-Profit Sector: A Memetic Algorithm Approach
In this study we analyse complete networks derived from field survey and market research through proposing an efficient methodology based on proximity graphs and clustering techniques enhanced with a new community detection algorithm. The specific context is the charity and Not-For-Profit sector in Australia and consumer behaviours within this context. To investigate the performance of this methodology we conduct experiments on the network extracted from a dataset that contains responses of 1,550 individual Australians to 43 questions in a quantitative survey conducted on behalf of the Australian Charities and Not-for-Profits Commission to study the public trust and confidence in Australian charities. Here, we generate the distance matrix by computing the Spearman correlation coefficient as a similarity metric among individuals. Then, several types of k-Nearest Neighbour (kNN) graphs were calculated from the distance matrix and the new community detection algorithm detected groups of consumers by optimizing a quality function called "modularity". Comparison of obtained results with the results of the BGLL algorithm, a heuristic given by the publicly available package Gephi and the MST-kNN algorithm, a graph-based approach to compute clusters that has several applications in bioinformatics and finance, reveals that our methodology is effective in partitioning of complete graphs and detecting communities. The combined results indicate that behavioural models that investigate trust in charities may need to be aware of intrinsic differences among subgroups as revealed by our analysis.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 500-507
Identifying Communities of Trust and Confidence in the Charity and Not-for-Profit Sector: A Memetic Algorithm Approach
In this study we analyse complete networks derived from field survey and market research through proposing an efficient methodology based on proximity graphs and clustering techniques enhanced with a new community detection algorithm. The specific context is the charity and Not-For-Profit sector in Australia and consumer behaviours within this context. To investigate the performance of this methodology we conduct experiments on the network extracted from a dataset that contains responses of 1,550 individual Australians to 43 questions in a quantitative survey conducted on behalf of the Australian Charities and Not-for-Profits Commission to study the public trust and confidence in Australian charities. Here, we generate the distance matrix by computing the Spearman correlation coefficient as a similarity metric among individuals. Then, several types of k-Nearest Neighbour (kNN) graphs were calculated from the distance matrix and the new community detection algorithm detected groups of consumers by optimizing a quality function called "modularity". Comparison of obtained results with the results of the BGLL algorithm, a heuristic given by the publicly available package Gephi and the MST-kNN algorithm, a graph-based approach to compute clusters that has several applications in bioinformatics and finance, reveals that our methodology is effective in partitioning of complete graphs and detecting communities. The combined results indicate that behavioural models that investigate trust in charities may need to be aware of intrinsic differences among subgroups as revealed by our analysis.
- Open Access
- 27 October 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (10) , e111445
An Information Theoretic Clustering Approach for Unveiling Authorship Affinities in Shakespearean Era Plays and Poems
In this paper we analyse the word frequency profiles of a set of works from the Shakespearean era to uncover patterns of relationship between them, highlighting the connections within authorial canons. We used a text corpus comprising 256 plays and poems from the 16th and 17th centuries, with 17 works of uncertain authorship. Our clustering approach is based on the Jensen-Shannon divergence and a graph partitioning algorithm, and our results show that authors' characteristic styles are very powerful factors in explaining the variation of word use, frequently transcending cross-cutting factors like the differences between tragedy and comedy, early and late works, and plays and poems. Our method also provides an empirical guide to the authorship of plays and poems where this is unknown or disputed.
- 27 October 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (10) , e111445
Open AccessAn Information Theoretic Clustering Approach for Unveiling Authorship Affinities in Shakespearean Era Plays and Poems
In this paper we analyse the word frequency profiles of a set of works from the Shakespearean era to uncover patterns of relationship between them, highlighting the connections within authorial canons. We used a text corpus comprising 256 plays and poems from the 16th and 17th centuries, with 17 works of uncertain authorship. Our clustering approach is based on the Jensen-Shannon divergence and a graph partitioning algorithm, and our results show that authors' characteristic styles are very powerful factors in explaining the variation of word use, frequently transcending cross-cutting factors like the differences between tragedy and comedy, early and late works, and plays and poems. Our method also provides an empirical guide to the authorship of plays and poems where this is unknown or disputed.
- 15 June 2014
- Published by Springer Nature in neurogenetics
- Vol. 15 (3) , 201-212
‘Neuroinflammation’ differs categorically from inflammation: transcriptomes of Alzheimer's disease, Parkinson's disease, schizophrenia and inflammatory diseases compared
‘Neuroinflammation’ has become a widely applied term in the basic and clinical neurosciences but there is no generally accepted neuropathological tissue correlate. Inflammation, which is characterized by the presence of perivascular infiltrates of cells of the adaptive immune system, is indeed seen in the central nervous system (CNS) under certain conditions. Authors who refer to microglial activation as neuroinflammation confuse this issue because autoimmune neuroinflammation serves as a synonym for multiple sclerosis, the prototypical inflammatory disease of the CNS. We have asked the question whether a data-driven, unbiased in silico approach may help to clarify the nomenclatorial confusion. Specifically, we have examined whether unsupervised analysis of microarray data obtained from human cerebral cortex of Alzheimer's, Parkinson's and schizophrenia patients would reveal a degree of relatedness between these diseases and recognized inflammatory conditions including multiple sclerosis. Our results using two different data analysis methods provide strong evidence against this hypothesis demonstrating that very different sets of genes are involved. Consequently, the designations inflammation and neuroinflammation are not interchangeable. They represent different categories not only at the histophenotypic but also at the transcriptomic level. Therefore, non-autoimmune neuroinflammation remains a term in need of definition.
- 15 June 2014
- Published by Springer Nature in neurogenetics
- Vol. 15 (3) , 201-212
‘Neuroinflammation’ differs categorically from inflammation: transcriptomes of Alzheimer's disease, Parkinson's disease, schizophrenia and inflammatory diseases compared
‘Neuroinflammation’ has become a widely applied term in the basic and clinical neurosciences but there is no generally accepted neuropathological tissue correlate. Inflammation, which is characterized by the presence of perivascular infiltrates of cells of the adaptive immune system, is indeed seen in the central nervous system (CNS) under certain conditions. Authors who refer to microglial activation as neuroinflammation confuse this issue because autoimmune neuroinflammation serves as a synonym for multiple sclerosis, the prototypical inflammatory disease of the CNS. We have asked the question whether a data-driven, unbiased in silico approach may help to clarify the nomenclatorial confusion. Specifically, we have examined whether unsupervised analysis of microarray data obtained from human cerebral cortex of Alzheimer's, Parkinson's and schizophrenia patients would reveal a degree of relatedness between these diseases and recognized inflammatory conditions including multiple sclerosis. Our results using two different data analysis methods provide strong evidence against this hypothesis demonstrating that very different sets of genes are involved. Consequently, the designations inflammation and neuroinflammation are not interchangeable. They represent different categories not only at the histophenotypic but also at the transcriptomic level. Therefore, non-autoimmune neuroinflammation remains a term in need of definition.
- Open Access
- 21 September 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (9) , e45535
Unveiling Clusters of RNA Transcript Pairs Associated with Markers of Alzheimer’s Disease Progression
One primary goal of transcriptomic studies is identifying gene expression patterns correlating with disease progression. This is usually achieved by considering transcripts that independently pass an arbitrary threshold (e.g. p<0.05). In diseases involving severe perturbations of multiple molecular systems, such as Alzheimer’s disease (AD), this univariate approach often results in a large list of seemingly unrelated transcripts. We utilised a powerful multivariate clustering approach to identify clusters of RNA biomarkers strongly associated with markers of AD progression. We discuss the value of considering pairs of transcripts which, in contrast to individual transcripts, helps avoid natural human transcriptome variation that can overshadow disease-related changes. We re-analysed a dataset of hippocampal transcript levels in nine controls and 22 patients with varying degrees of AD. A large-scale clustering approach determined groups of transcript probe sets that correlate strongly with measures of AD progression, including both clinical and neuropathological measures and quantifiers of the characteristic transcriptome shift from control to severe AD. This enabled identification of restricted groups of highly correlated probe sets from an initial list of 1,372 previously published by our group. We repeated this analysis on an expanded dataset that included all pair-wise combinations of the 1,372 probe sets. As clustering of this massive dataset is unfeasible using standard computational tools, we adapted and re-implemented a clustering algorithm that uses external memory algorithmic approach. This identified various pairs that strongly correlated with markers of AD progression and highlighted important biological pathways potentially involved in AD pathogenesis. Our analyses demonstrate that, although there exists a relatively large molecular signature of AD progression, only a small number of transcripts recurrently cluster with different markers of AD progression. Furthermore, considering the relationship between two transcripts can highlight important biological relationships that are missed when considering either transcript in isolation.
- 21 September 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (9) , e45535
Open AccessUnveiling Clusters of RNA Transcript Pairs Associated with Markers of Alzheimer’s Disease Progression
One primary goal of transcriptomic studies is identifying gene expression patterns correlating with disease progression. This is usually achieved by considering transcripts that independently pass an arbitrary threshold (e.g. p<0.05). In diseases involving severe perturbations of multiple molecular systems, such as Alzheimer’s disease (AD), this univariate approach often results in a large list of seemingly unrelated transcripts. We utilised a powerful multivariate clustering approach to identify clusters of RNA biomarkers strongly associated with markers of AD progression. We discuss the value of considering pairs of transcripts which, in contrast to individual transcripts, helps avoid natural human transcriptome variation that can overshadow disease-related changes. We re-analysed a dataset of hippocampal transcript levels in nine controls and 22 patients with varying degrees of AD. A large-scale clustering approach determined groups of transcript probe sets that correlate strongly with measures of AD progression, including both clinical and neuropathological measures and quantifiers of the characteristic transcriptome shift from control to severe AD. This enabled identification of restricted groups of highly correlated probe sets from an initial list of 1,372 previously published by our group. We repeated this analysis on an expanded dataset that included all pair-wise combinations of the 1,372 probe sets. As clustering of this massive dataset is unfeasible using standard computational tools, we adapted and re-implemented a clustering algorithm that uses external memory algorithmic approach. This identified various pairs that strongly correlated with markers of AD progression and highlighted important biological pathways potentially involved in AD pathogenesis. Our analyses demonstrate that, although there exists a relatively large molecular signature of AD progression, only a small number of transcripts recurrently cluster with different markers of AD progression. Furthermore, considering the relationship between two transcripts can highlight important biological relationships that are missed when considering either transcript in isolation.
- Open Access
- 28 August 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (8) , e44000
GPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs
The analysis of biological networks has become a major challenge due to the recent development of high-throughput techniques that are rapidly producing very large data sets. The exploding volumes of biological data are craving for extreme computational power and special computing facilities (i.e. super-computers). An inexpensive solution, such as General Purpose computation based on Graphics Processing Units (GPGPU), can be adapted to tackle this challenge, but the limitation of the device internal memory can pose a new problem of scalability. An efficient data and computational parallelism with partitioning is required to provide a fast and scalable solution to this problem. We propose an efficient parallel formulation of the k-Nearest Neighbour (kNN) search problem, which is a popular method for classifying objects in several fields of research, such as pattern recognition, machine learning and bioinformatics. Being very simple and straightforward, the performance of the kNN search degrades dramatically for large data sets, since the task is computationally intensive. The proposed approach is not only fast but also scalable to large-scale instances. Based on our approach, we implemented a software tool GPU-FS-kNN (GPU-based Fast and Scalable k-Nearest Neighbour) for CUDA enabled GPUs. The basic approach is simple and adaptable to other available GPU architectures. We observed speed-ups of 50–60 times compared with CPU implementation on a well-known breast microarray study and its associated data sets. Our GPU-based Fast and Scalable k-Nearest Neighbour search technique (GPU-FS-kNN) provides a significant performance improvement for nearest neighbour computation in large-scale networks. Source code and the software tool is available under GNU Public License (GPL) at https://sourceforge.net/p/gpufsknn/.
- 28 August 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (8) , e44000
Open AccessGPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs
The analysis of biological networks has become a major challenge due to the recent development of high-throughput techniques that are rapidly producing very large data sets. The exploding volumes of biological data are craving for extreme computational power and special computing facilities (i.e. super-computers). An inexpensive solution, such as General Purpose computation based on Graphics Processing Units (GPGPU), can be adapted to tackle this challenge, but the limitation of the device internal memory can pose a new problem of scalability. An efficient data and computational parallelism with partitioning is required to provide a fast and scalable solution to this problem. We propose an efficient parallel formulation of the k-Nearest Neighbour (kNN) search problem, which is a popular method for classifying objects in several fields of research, such as pattern recognition, machine learning and bioinformatics. Being very simple and straightforward, the performance of the kNN search degrades dramatically for large data sets, since the task is computationally intensive. The proposed approach is not only fast but also scalable to large-scale instances. Based on our approach, we implemented a software tool GPU-FS-kNN (GPU-based Fast and Scalable k-Nearest Neighbour) for CUDA enabled GPUs. The basic approach is simple and adaptable to other available GPU architectures. We observed speed-ups of 50–60 times compared with CPU implementation on a well-known breast microarray study and its associated data sets. Our GPU-based Fast and Scalable k-Nearest Neighbour search technique (GPU-FS-kNN) provides a significant performance improvement for nearest neighbour computation in large-scale networks. Source code and the software tool is available under GNU Public License (GPL) at https://sourceforge.net/p/gpufsknn/.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 576-580
Computing large-scale distance matrices on GPU
A distance matrix is simply an n×n two-dimensional array that contains pairwise distances of a set of n points in a metric space. It has a wide range of usage in several fields of scientific research e.g., data clustering, machine learning, pattern recognition, image analysis, information retrieval, signal processing, bioinformatics etc. However, as the size of n increases, the computation of distance matrix becomes very slow or incomputable on traditional general purpose computers. In this paper, we propose an inexpensive and scalable data-parallel solution to this problem by dividing the computational tasks and data on GPUs. We demonstrate the performance of our method on a set of real-world biological networks constructed from a renowned breast cancer study.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 576-580
Computing large-scale distance matrices on GPU
A distance matrix is simply an n×n two-dimensional array that contains pairwise distances of a set of n points in a metric space. It has a wide range of usage in several fields of scientific research e.g., data clustering, machine learning, pattern recognition, image analysis, information retrieval, signal processing, bioinformatics etc. However, as the size of n increases, the computation of distance matrix becomes very slow or incomputable on traditional general purpose computers. In this paper, we propose an inexpensive and scalable data-parallel solution to this problem by dividing the computational tasks and data on GPUs. We demonstrate the performance of our method on a set of real-world biological networks constructed from a renowned breast cancer study.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 585-590
kNN-MST-Agglomerative: A fast and scalable graph-based data clustering approach on GPU
Data clustering is a distinctive method for analyzing complex networks in terms of functional relationships of the comprising elements. A number of graph-based algorithms have been proposed so far to tackle the complexity of the problem and many of them are based on the representation of data in the form of a minimum spanning tree (MST). In this work, we propose a graph-based agglomerative clustering method that is based the k-Nearest Neighbor (kNN) graphs and the Borůvka's-MST Algorithm, (termed as, kNN-MST-Agglomerative). The proposed method is inherently parallel and in addition it is applicable to a wide class of practical problems involving large datasets. We demonstrate the performance of our method on a set of real-world biological networks constructed from a renowned breast cancer study.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 585-590
kNN-MST-Agglomerative: A fast and scalable graph-based data clustering approach on GPU
Data clustering is a distinctive method for analyzing complex networks in terms of functional relationships of the comprising elements. A number of graph-based algorithms have been proposed so far to tackle the complexity of the problem and many of them are based on the representation of data in the form of a minimum spanning tree (MST). In this work, we propose a graph-based agglomerative clustering method that is based the k-Nearest Neighbor (kNN) graphs and the Borůvka's-MST Algorithm, (termed as, kNN-MST-Agglomerative). The proposed method is inherently parallel and in addition it is applicable to a wide class of practical problems involving large datasets. We demonstrate the performance of our method on a set of real-world biological networks constructed from a renowned breast cancer study.
- 1 January 2012
- Published by Springer Nature
- p. 71-86
kNN-Borůvka-GPU: A Fast and Scalable MST Construction from kNN Graphs on GPU
- 1 January 2012
- Published by Springer Nature
- p. 71-86
kNN-Borůvka-GPU: A Fast and Scalable MST Construction from kNN Graphs on GPU
- 1 January 2011
- Published by Springer Nature
- p. 375-386
Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms
- 1 January 2011
- Published by Springer Nature
- p. 375-386
Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms