Locality preserving non-negative basis learning with graph embedding

1Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The high dimensionality of connectivity networks necessitates the development of methods identifying the connectivity building blocks that not only characterize the patterns of brain pathology but also reveal representative population patterns. In this paper, we present a non-negative component analysis framework for learning localized and sparse sub-network patterns of connectivity matrices by decomposing them into two sets of discriminative and reconstructive bases. In order to obtain components that are designed towards extracting population differences, we exploit the geometry of the population by using a graph-theoretical scheme that imposes locality-preserving properties as well as maintaining the underlying distance between distant nodes in the original and the projected space. The effectiveness of the proposed framework is demonstrated by applying it to two clinical studies using connectivity matrices derived from DTI to study a population of subjects with ASD, as well as a developmental study of structural brain connectivity that extracts gender differences. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Ghanbari, Y., Herrington, J., Gur, R. C., Schultz, R. T., & Verma, R. (2013). Locality preserving non-negative basis learning with graph embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7917 LNCS, pp. 316–327). https://doi.org/10.1007/978-3-642-38868-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free