Search

Background: The detection of Alzheimer's Disease (AD) in its formative stages, especially in Mild Cognitive Impairments (MCI), has the potential of helping the clinicians in understanding the condition. The literature review shows that the classification of MCI-converts and MCI-non-converts has not been explored profusely and the maximum classification accuracy reported is rather low. Thus, this paper proposes a Machine Learning approach for classifying patients of MCI into two groups one who converted to AD and the others who are not diagnosed with any signs of AD. The proposed algorithm is also used to distinguish MCI patients from controls (CN). This work uses the Structural Magnetic Resonance Imaging data.Methods: This work proposes a 3-D variant of Local Binary Pattern (LBP), called LBP-20 for extracting features. The method has been compared with 3D-Discrete Wavelet Transform (3D-DWT). Subsequently, a combination of 3D-DWT and LBP-20 has been used for extracting features. The relevant features are selected using the Fisher Discriminant Ratio (FDR) and finally the classification has been carried out using the Support Vector Machine.Results: The combination of 3D-DWT with LBP-20 results in a maximum accuracy of 88.77. Similarly, the proposed combination of methods is also applied to distinguish MCI from CN. The proposed method results in the classification accuracy of 90.31 in this data.Conclusion: The proposed combination is able to extract relevant distribution of microstructures from each component, obtained with the use of DWT and thereby improving the classification accuracy. Moreover, the number of features used for classification is significantly less as compared to those obtained by 3D-DWT. The performance of the proposed method is measured in terms of accuracy, specificity and sensitivity and is found superior in comparison to the existing methods. Thus, the proposed method may contribute to effective diagnosis of MCI and may prove advantageous in clinical settings. [ABSTRACT FROM AUTHOR]

The Internet is a place where a vast amount of information is flowing. With the deeper penetration of social media, everybody is participating in spreading information. Often we find ourselves confused with competing information on the same topic. In this work, we present a novel model for competitive information diffusion on the scale-free network. The proposed model is an extension of the classical DK model of rumour spreading. Most of previous competitive information diffusion models consider a different type of stiflers to be similar. In our model we have two separate compartments for different types of stiflers. We present a detailed analysis about the effect of infection rate on the prevalence of rumour in the network. To capture the large chunk of population one requires relatively higher spreading rate. Relative impact of spreading rate and stifler rate on the final population in different compartments is also presented. In our analysis, we find that if stifler rate is higher than the spreading rate, a large portion of population remains unaware of rumours. We also find that if the information source is a popular person than people have a bias towards that information and information coming from less popular persons lose its grip on the network and lose the competition. This analysis illustrates that why big companies hire famous celebrities to promote their products. We also demonstrate rumour spreading analysis with numerical solution, network simulation and real network topology of Facebook. [ABSTRACT FROM AUTHOR]

Nonparametric Discriminant Analysis (NDA) possesses inherent advantages over Linear Discriminant Analysis (LDA) such as capturing the boundary structure of samples and avoiding matrix inversion. In this paper, we present a novel method for constructing an updated Nonparametric Discriminant Analysis (NDA) model for face recognition. The proposed method is applicable to scenarios where bursts of data samples are added to the existing model in random chunks. Also, the samples which degrade the performance of the model need to be removed. For both of these problems, we propose incremental NDA (INDA) and decremental NDA (DNDA) respectively. Experimental results on four publicly available datasets viz. AR, PIE, ORL and Yale show the efficacy of the proposed method. Also, the proposed method requires less computation time in comparison to batch NDA which makes it suitable for real time applications. [ABSTRACT FROM AUTHOR]

With the advent of microarray technology, it is possible to measure gene expression levels of thousands of genes simultaneously. This helps us diagnose and classify some particular cancers directly using DNA microarray. Highdimensionality and small sample size of microarray datasets has made the task of classification difficult. These datasets contain a large number of redundant and irrelevant genes. For efficient classification of samples there is a need of selecting a smaller set of relevant and non-redundant genes. In this paper, we have proposed a two stage algorithm for finding a set of discriminatory genes responsible for classification of high dimensional microarray datasets. In the first stage redundancy is reduced by grouping correlated genes into clusters and selecting a representative gene from each cluster. Maximal information compression index is used to measure similarity between genes. In the second stage a wrapper based forward feature selection method is used to obtain a set of discriminatory genes for a given classifier. We have investigated three different techniques for clustering and four classifiers in our experiments. The proposed algorithm is tested on six well known publicly available datasets. Comparison with the other state-of-the-art methods show that our proposed algorithm is able to achieve better classification accuracy with less number of genes. [ABSTRACT FROM AUTHOR]