Search

Alzheimer’s disease (AD) is a serious neurodegenerative condition that affects millions of individuals across the world. As the average age of individuals in the United States and the world increases, the prevalence of AD will continue to grow. To address this public health problem, the research community has developed computational approaches to sift through various aspects of clinical data and uncover their insights, among which one of the most challenging problem is to determine the biological mechanisms that cause AD to develop. To study this problem, in this paper we present a novel Joint Multi-Modal Longitudinal Regression and Classification method and show how it can be used to identify the cognitive status of the participants in the Alzheimer’s Disease Neuroimaging Initiative (ADNI) cohort and the underlying biological mechanisms. By intelligently combining clinical data of various modalities (i.e., genetic information and brain scans) using a variety of regularizations that can identify AD-relevant biomarkers, we perform the regression and classification tasks simultaneously. Because the proposed objective is a non-smooth optimization problem that is difficult to solve in general, we derive an efficient iterative algorithm and rigorously prove its convergence. To validate our new method in predicting the cognitive scores of patients and their clinical diagnosis, we conduct comprehensive experiments on the ADNI cohort. Our promising results demonstrate the benefits and flexibility of the proposed method. We anticipate that our new method is of interest to clinical communities beyond AD research and have open-sourced the code of our method online. 1 The code package for the proposed Joint Multi-Modal Longitudinal Regression and Classification model have been made publicly available online at https://github.com/minds-mines/jmmlrc. [ABSTRACT FROM AUTHOR]

Spoken language recognition refers to the automatic process through which we determine or verify the identity of the language spoken in a speech sample. We study a computational framework that allows such a decision to be made in a quantitative manner. In recent decades, we have made tremendous progress in spoken language recognition, which benefited from technological breakthroughs in related areas, such as signal processing, pattern recognition, cognitive science, and machine learning. In this paper, we attempt to provide an introductory tutorial on the fundamentals of the theory and the state-of-the-art solutions, from both phonological and computational aspects. We also give a comprehensive review of current trends and future research directions using the language recognition evaluation (LRE) formulated by the National Institute of Standards and Technology (NIST) as the case studies. [ABSTRACT FROM PUBLISHER]

Relational databases are the most popular repository for structured data, and is thus one of the richest sources of knowledge in the world. In a relational database, multiple relations are linked together via entity-relationship links. Multirelational classification is the procedure of building a classifier based on information stored in multiple relations and making predictions with it. Existing approaches of Inductive Logic Programming (recently, also known as Relational Mining) have proven effective with high accuracy in multirelational classification. Unfortunately, most of them suffer from scalability problems with regard to the number of relations in databases. In this paper, we propose a new approach, called CrossMine, which includes a set of novel and powerful methods for multirelational classification, including 1) tuple ID propagation, an efficient and flexible method for virtually joining relations, which enables convenient search among different relations, 2) new definitions for predicates and decision-tree nodes, which involve aggregated information to provide essential statistics for classification, and 3) a selective sampling method for improving scalability with regard to the number of tuples. Based on these techniques, we propose two scalable and accurate methods for multirelational classification: CrossMine-Rule, a rule-based method and CrossMine-Tree, a decision-tree-based method. Our comprehensive experiments on both real and synthetic data sets demonstrate the high scalability and accuracy of the CrossMine approach. [ABSTRACT FROM AUTHOR]

We present a parametric framework for the joint processing of heterogeneous data, specifically for a binary classification problem. Processing such a data set is not straightforward as heterogeneous data may not be commensurate. In addition, the signals may also exhibit statistical dependence due to overlapping fields of view. We propose a copula-based solution to incorporate statistical dependence between disparate sources of information. The important problem of identifying the best copula for binary classification problems is also addressed. Computer simulation results are presented to demonstrate the feasibility of our approach. The method is also tested on real-data provided by the National Institute of Standards and Technology (NIST) for a multibiometric face recognition application. Finally, performance limits are derived to study the influence of statistical dependence on classification performance. [ABSTRACT FROM AUTHOR]

A credit assignment approach to decision-based classifier fusion is developed and applied to the problem-of land-cover classification from multiseason airborne hyperspectral imagery. For each input sample, the new method uses a smoothed estimated reliability measure (SERM) in the output domain of the classifiers. SERM requires no additional training beyond that needed to optimize the constituent classifiers in the pool, and its generalization (test) accuracy exceeds that of a number of other extant methods for classifier fusion. Hyperspectral imagery from HyMAP and PROBE2 acquired at three points in the growing season over Smith Island, VA, a barrier island in the Nature Conservancy's Virginia Coast Reserve, serves as the basis for comparing SERM with other approaches. [ABSTRACT FROM AUTHOR]