Ali A. Minai

Ali A. Minai

Auto-generated profile, based on publicly available information

Ali A. Minai

University of Cincinnati

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

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

Representative Publications

View All Publications
21 August 2017 in Frontiers in Neuroscience
Verified
Journal Article
Open access
XGXinyu Guo
Xinyu Guo
KDKelli C. Dominick
Kelli C. Dominick
AMAli A. Minai
Ali A. Minai
HLHailong Li
Hailong Li
CECraig A. Erickson
Craig A. Erickson
LLLong Lu
Long Lu
The whole-brain functional connectivity (FC) pattern obtained from resting-state functional magnetic resonance imaging data are commonly applied to study neuropsychiatric conditions such as autism spectrum disorder (ASD) by using different machine learning models. Recent studies indicate that both hyper- and hypo- aberrant ASD-associated FCs were widely distributed throughout the entire brain rather than only in some specific brain regions. Deep neural networks (DNN) with multiple hidden layers have shown the ability to systematically extract lower-to-higher level information from high dimensional data across a series of neural hidden layers, significantly improving classification accuracy for such data. In this study, a DNN with a novel feature selection method (DNN-FS) is developed for the high dimensional whole-brain resting-state FC pattern classification of ASD patients versus typical development (TD) controls. The feature selection method is able to help the DNN generate low dimensional high-quality representations of the whole-brain FC patterns by selecting features with high discriminating power from multiple trained sparse auto-encoders. For the comparison, a DNN without the feature selection method (DNN-woFS) is developed, and both of them are tested with different architectures (i.e., with different numbers of hidden layers/nodes). Results show that the best classification accuracy of 86.36% is generated by the DNN-FS approach with 3 hidden layers and 150 hidden nodes (3/150). Remarkably, DNN-FS outperforms DNN-woFS for all architectures studied. The most significant accuracy improvement was 9.09% with the 3/150 architecture. The method also outperforms other feature selection methods, e.g., two sample t-test and elastic net. In addition to improving the classification accuracy, a Fisher’s score-based biomarker identification method based on the DNN is also developed, and used to identify 32 FCs related to ASD. These FCs come from or cross different pre-defined brain networks including the default-mode, cingulo-opercular, frontal-parietal and cerebellum. Thirteen of them are statically significant between ASD and TD groups (two sample t test p-value < 0.05) while nineteen of them are not. The relationship between the statically significant FCs and the corresponding ASD behavior symptoms is discussed based on the literature and clinician’s expert knowledge. Meanwhile, the potential reason of obtaining nineteen FCs which are not statistically

1 March 2001 in Annual Review of Neuroscience
Verified
Journal Article
Closed access
PBPhillip J. Best
Phillip J. Best
AWAaron M. White
Aaron M. White
AMAli Minai
Ali Minai
▪ Abstract The startling discovery by O'Keefe & Dostrovsky (Brain Res. 1971 ; 34: 171–75) that hippocampal neurons fire selectively in different regions or “place fields” of an environment and the subsequent development of the comprehensive theory by O'Keefe & Nadel (The Hippocampus as a Cognitive Map. Oxford, UK: Clarendon, 1978 ) that the hippocampus serves as a cognitive map have stimulated a substantial body of literature on the characteristics of hippocampal “place cells” and their relevance for our understanding of the mechanisms by which the brain processes spatial information. This paper reviews the major dimensions of the empirical research on place-cell activity and the development of computational models to explain various characteristics of place fields.

23 September 2010 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
JDJingyuan Deng
Jingyuan Deng
LDLei Deng
Lei Deng
SSShengchang Su
Shengchang Su
MZMinlu Zhang
Minlu Zhang
XLXiaodong Lin
Xiaodong Lin
LLLong Lu
Long Lu
Rapid and accurate identification of new essential genes in under-studied microorganisms will significantly improve our understanding of how a cell works and the ability to re-engineer microorganisms. However, predicting essential genes across distantly related organisms remains a challenge. Here, we present a machine learning-based integrative approach that reliably transfers essential gene annotations between distantly related bacteria. We focused on four bacterial species that have well-characterized essential genes, and tested the transferability between three pairs among them. For each pair, we trained our classifier to learn traits associated with essential genes in one organism, and applied it to make predictions in the other. The predictions were then evaluated by examining the agreements with the known essential genes in the target organism. Ten-fold cross-validation in the same organism yielded AUC scores between 0.86 and 0.93. Cross-organism predictions yielded AUC scores between 0.69 and 0.89. The transferability is likely affected by growth conditions, quality of the training data set and the evolutionary distance. We are thus the first to report that gene essentiality can be reliably predicted using features trained and tested in a distantly related organism. Our approach proves more robust and portable than existing approaches, significantly extending our ability to predict essential genes beyond orthologs.

1 June 2001 in Neurocomputing
Verified
Journal Article
Closed access
JBJason W. Bohland
Jason W. Bohland
AMAli A. Minai
Ali A. Minai

10 January 2007 in Journal of Dynamic Systems, Measurement, and Control
Verified
Journal Article
Closed access
PDF file
YYYanli Yang
Yanli Yang
MPMarios M. Polycarpou
Marios M. Polycarpou
AMAli A. Minai
Ali A. Minai
The control of networked multivehicle systems designed to perform complex coordinated tasks is currently an important and challenging field of research. This paper addresses a cooperative search problem where a team of uninhabited aerial vehicles (UAVs) seeks to find targets of interest in an uncertain environment. We present a practical framework for online planning and control of a group of UAVs for cooperative search based on two interdependent tasks: (i) incrementally updating “cognitive maps” used as the representation of the environment through new sensor readings; (ii) continuously planning the path for each vehicle based on the information obtained through the search. We formulate the cooperative search problem and develop a decentralized strategy based on an opportunistic cooperative learning method, where the emergent coordination among vehicles is enabled by letting each vehicle consider other vehicles’ actions in its path planning procedure. By using the developed strategy, physically feasible paths for the vehicles to follow are generated, where constraints on aerial vehicles, including physical maneuverabilities, are considered and the dynamic nature of the environment is taken into account. We also present some mathematical analysis of the developed search strategy. Our analysis shows that this strategy guarantees a complete search of the environment and is robust to a partial loss of UAVs. A lower bound on the search time for any strategy and a relaxed upper bound for the proposed strategy are given. Simulation results are used to illustrate the effectiveness of the proposed strategy.

18 December 2000 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
SSShyam Sundar
Shyam Sundar
AMAli A. Minai
Ali A. Minai
Synchronized chaotic systems have recently been applied to the area of secure communications in a variety of ways. At the same time, there have also been significant advances in deciphering messages masked by chaotic signals. It is important, therefore, to explore more secure approaches to using chaos in communication. We show that multiple chaotic systems can be synchronized through a scalar coupling which carries a stochastic signal generated by random multiplexing of the source systems. This approach, which is a variant of the active-passive decomposition method, promises enhanced security in chaos-based communication.