Fardina Fathmiul Alam
Fardina Fathmiul Alam has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Amarda Shehu
George Mason University
3 shared publications - Riya Kanani
Department of Computer Science, University of Maryland, College Park, MD, USA
2 shared publications - Shraddha Patre
Department of Computer Science, University of Maryland, College Park, MD, USA
2 shared publications - Taseef Rahman
Bellini College of Artificial Intelligence, Cybersecurity and Computing University of South Florida Tampa Florida USA
2 shared publications - Aarnav Tare
Department of Computer Science, University of Maryland, College Park, MD, USA
1 shared publication - Aarnav Tare
University of Maryland
1 shared publication
Latest Publications
- 8 September 2026
- Published by Springer Nature
- p. 199-216
STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction
- 8 September 2026
- Published by Springer Nature
- p. 199-216
STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction
- 29 May 2026
- Published by Springer Nature
- p. 101-118
Decoding the Latent Space: A Comparative Analysis of Autoencoder Representations for Protein Fold Recognition
- 29 May 2026
- Published by Springer Nature
- p. 101-118
Decoding the Latent Space: A Comparative Analysis of Autoencoder Representations for Protein Fold Recognition
- Open Access
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-7
ConSOLAE: Learning Smooth and Generalizable Representations for Protein Fold Recognition
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessConSOLAE: Learning Smooth and Generalizable Representations for Protein Fold Recognition
- 26 March 2025
- Published by Springer Nature
- p. 1-15
SuperFoldAE: Enhancing Protein Fold Classification with Autoencoders
- 26 March 2025
- Published by Springer Nature
- p. 1-15
SuperFoldAE: Enhancing Protein Fold Classification with Autoencoders
- Open Access
- 29 June 2022
- Published by MDPI AG in Biomolecules
- Vol. 12 (7) , 908
Data Size and Quality Matter: Generating Physically-Realistic Distance Maps of Protein Tertiary Structures
With the debut of AlphaFold2, we now can get a highly-accurate view of a reasonable equilibrium tertiary structure of a protein molecule. Yet, a single-structure view is insufficient and does not account for the high structural plasticity of protein molecules. Obtaining a multi-structure view of a protein molecule continues to be an outstanding challenge in computational structural biology. In tandem with methods formulated under the umbrella of stochastic optimization, we are now seeing rapid advances in the capabilities of methods based on deep learning. In recent work, we advance the capability of these models to learn from experimentally-available tertiary structures of protein molecules of varying lengths. In this work, we elucidate the important role of the composition of the training dataset on the neural network’s ability to learn key local and distal patterns in tertiary structures. To make such patterns visible to the network, we utilize a contact map-based representation of protein tertiary structure. We show interesting relationships between data size, quality, and composition on the ability of latent variable models to learn key patterns of tertiary structure. In addition, we present a disentangled latent variable model which improves upon the state-of-the-art variable autoencoder-based model in key, physically-realistic structural patterns. We believe this work opens up further avenues of research on deep learning-based models for computing multi-structure views of protein molecules.
- 29 June 2022
- Published by MDPI AG in Biomolecules
- Vol. 12 (7) , 908
Open AccessData Size and Quality Matter: Generating Physically-Realistic Distance Maps of Protein Tertiary Structures
With the debut of AlphaFold2, we now can get a highly-accurate view of a reasonable equilibrium tertiary structure of a protein molecule. Yet, a single-structure view is insufficient and does not account for the high structural plasticity of protein molecules. Obtaining a multi-structure view of a protein molecule continues to be an outstanding challenge in computational structural biology. In tandem with methods formulated under the umbrella of stochastic optimization, we are now seeing rapid advances in the capabilities of methods based on deep learning. In recent work, we advance the capability of these models to learn from experimentally-available tertiary structures of protein molecules of varying lengths. In this work, we elucidate the important role of the composition of the training dataset on the neural network’s ability to learn key local and distal patterns in tertiary structures. To make such patterns visible to the network, we utilize a contact map-based representation of protein tertiary structure. We show interesting relationships between data size, quality, and composition on the ability of latent variable models to learn key patterns of tertiary structure. In addition, we present a disentangled latent variable model which improves upon the state-of-the-art variable autoencoder-based model in key, physically-realistic structural patterns. We believe this work opens up further avenues of research on deep learning-based models for computing multi-structure views of protein molecules.
- 10 February 2021
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 19 (01) , 2140002
Unsupervised multi-instance learning for protein structure determination
Many regions of the protein universe remain inaccessible by wet-laboratory or computational structure determination methods. A significant challenge in elucidating these dark regions in silico relates to the ability to discriminate relevant structure(s) among many structures/decoys computed for a protein of interest, a problem known as decoy selection. Clustering decoys based on geometric similarity remains popular. However, it is unclear how exactly to exploit the groups of decoys revealed via clustering to select individual structures for prediction. In this paper, we provide an intuitive formulation of the decoy selection problem as an instance of unsupervised multi-instance learning. We address the problem in three stages, first organizing given decoys of a protein molecule into bags, then identifying relevant bags, and finally drawing individual instances from these bags to offer as prediction. We propose both non-parametric and parametric algorithms for drawing individual instances. Our evaluation utilizes two datasets, one benchmark dataset of ensembles of decoys for a varied list of protein molecules, and a dataset of decoy ensembles for targets drawn from recent CASP competitions. A comparative analysis with state-of-the-art methods reveals that the proposed approach outperforms existing methods, thus warranting further investigation of multi-instance learning to advance our treatment of decoy selection.
- 10 February 2021
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 19 (01) , 2140002
Unsupervised multi-instance learning for protein structure determination
Many regions of the protein universe remain inaccessible by wet-laboratory or computational structure determination methods. A significant challenge in elucidating these dark regions in silico relates to the ability to discriminate relevant structure(s) among many structures/decoys computed for a protein of interest, a problem known as decoy selection. Clustering decoys based on geometric similarity remains popular. However, it is unclear how exactly to exploit the groups of decoys revealed via clustering to select individual structures for prediction. In this paper, we provide an intuitive formulation of the decoy selection problem as an instance of unsupervised multi-instance learning. We address the problem in three stages, first organizing given decoys of a protein molecule into bags, then identifying relevant bags, and finally drawing individual instances from these bags to offer as prediction. We propose both non-parametric and parametric algorithms for drawing individual instances. Our evaluation utilizes two datasets, one benchmark dataset of ensembles of decoys for a varied list of protein molecules, and a dataset of decoy ensembles for targets drawn from recent CASP competitions. A comparative analysis with state-of-the-art methods reveals that the proposed approach outperforms existing methods, thus warranting further investigation of multi-instance learning to advance our treatment of decoy selection.
- Open Access
Evaluating Autoencoder-Based Featurization and Supervised Learning for Protein Decoy Selection
Rapid growth in molecular structure data is renewing interest in featurizing structure. Featurizations that retain information on biological activity are particularly sought for protein molecules, where decades of research have shown that indeed structure encodes function. Research on featurization of protein structure is active, but here we assess the promise of autoencoders. Motivated by rapid progress in neural network research, we investigate and evaluate autoencoders on yielding linear and nonlinear featurizations of protein tertiary structures. An additional reason we focus on autoencoders as the engine to obtain featurizations is the versatility of their architectures and the ease with which changes to architecture yield linear versus nonlinear features. While open-source neural network libraries, such as Keras, which we employ here, greatly facilitate constructing, training, and evaluating autoencoder architectures and conducting model search, autoencoders have not yet gained popularity in the structure biology community. Here we demonstrate their utility in a practical context. Employing autoencoder-based featurizations, we address the classic problem of decoy selection in protein structure prediction. Utilizing off-the-shelf supervised learning methods, we demonstrate that the featurizations are indeed meaningful and allow detecting active tertiary structures, thus opening the way for further avenues of research.
Open AccessEvaluating Autoencoder-Based Featurization and Supervised Learning for Protein Decoy Selection
Rapid growth in molecular structure data is renewing interest in featurizing structure. Featurizations that retain information on biological activity are particularly sought for protein molecules, where decades of research have shown that indeed structure encodes function. Research on featurization of protein structure is active, but here we assess the promise of autoencoders. Motivated by rapid progress in neural network research, we investigate and evaluate autoencoders on yielding linear and nonlinear featurizations of protein tertiary structures. An additional reason we focus on autoencoders as the engine to obtain featurizations is the versatility of their architectures and the ease with which changes to architecture yield linear versus nonlinear features. While open-source neural network libraries, such as Keras, which we employ here, greatly facilitate constructing, training, and evaluating autoencoder architectures and conducting model search, autoencoders have not yet gained popularity in the structure biology community. Here we demonstrate their utility in a practical context. Employing autoencoder-based featurizations, we address the classic problem of decoy selection in protein structure prediction. Utilizing off-the-shelf supervised learning methods, we demonstrate that the featurizations are indeed meaningful and allow detecting active tertiary structures, thus opening the way for further avenues of research.
- 27 October 2019
- Published by Springer Nature
- p. 303-312
Word Embeddings for Semantic Resemblance of Substantial Text Data: A Comparative Study
- 27 October 2019
- Published by Springer Nature
- p. 303-312
Word Embeddings for Semantic Resemblance of Substantial Text Data: A Comparative Study
- Open Access
- 4 September 2019
- Published by Association for Computing Machinery (ACM)
- p. 592-597
Learning Reduced Latent Representations of Protein Structure Data
The protein modeling community has long been interested in dimensionality reduction of structure data. Motivated by rapid progress in neural network research, we investigate autoencoders of various architectures on reducing the dimensionality of protein structure data generated by template-free protein structure prediction methods. We show that autoencoders that model nonlinear relationships among variables outperform linear dimensionality reduction. We evaluate various architectures and propose a better-performing one. We further show that the learned, low-dimensional latent representations capture inherent information useful for structure prediction. Given the ease with which open-source neural network libraries, such as Keras, which we employ here, allow constructing, training, and evaluating neural networks, we believe that autoencoders will gain in popularity in the structure biology community and open up further avenues of research.
- 4 September 2019
- Published by Association for Computing Machinery (ACM)
- p. 592-597
Open AccessLearning Reduced Latent Representations of Protein Structure Data
The protein modeling community has long been interested in dimensionality reduction of structure data. Motivated by rapid progress in neural network research, we investigate autoencoders of various architectures on reducing the dimensionality of protein structure data generated by template-free protein structure prediction methods. We show that autoencoders that model nonlinear relationships among variables outperform linear dimensionality reduction. We evaluate various architectures and propose a better-performing one. We further show that the learned, low-dimensional latent representations capture inherent information useful for structure prediction. Given the ease with which open-source neural network libraries, such as Keras, which we employ here, allow constructing, training, and evaluating neural networks, we believe that autoencoders will gain in popularity in the structure biology community and open up further avenues of research.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 103-106
Introducing spatial orientation sensitive cellphone messaging system for blind people
It could be difficult and challenging for any person (especially blind people) to inform in an unusual situation for instant help. Falling in any critical situation for blind people is very common. One way to assist them in their unexpected situation by using an app of cell phone is proposed and described in this paper. Every smartphone consists of a good number of sensors. We have utilized accelerometer sensor's event and have introduced spatial orientation sensitive messaging system. According to our proposed system, A blind people will shake the cell phone in a specific axis so that message from cellphone will go to nearest helping hand destination. Here we have fixed a threshold and time limit so that we can avoid false messages for usual cellphone movements. Our last effort was to track the person using geodata of received message. Qualitative and quantitative performance of this system is evaluated. Moreover the entire messaging system is tested in various constraints and factors.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 103-106
Introducing spatial orientation sensitive cellphone messaging system for blind people
It could be difficult and challenging for any person (especially blind people) to inform in an unusual situation for instant help. Falling in any critical situation for blind people is very common. One way to assist them in their unexpected situation by using an app of cell phone is proposed and described in this paper. Every smartphone consists of a good number of sensors. We have utilized accelerometer sensor's event and have introduced spatial orientation sensitive messaging system. According to our proposed system, A blind people will shake the cell phone in a specific axis so that message from cellphone will go to nearest helping hand destination. Here we have fixed a threshold and time limit so that we can avoid false messages for usual cellphone movements. Our last effort was to track the person using geodata of received message. Qualitative and quantitative performance of this system is evaluated. Moreover the entire messaging system is tested in various constraints and factors.