東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in spectral learning with a...

Dhillon, Paramveer Singh.

FindBook

Google Book

Amazon

博客來

Advances in spectral learning with applications to text analysis and brain imaging.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Advances in spectral learning with applications to text analysis and brain imaging./
作者:	Dhillon, Paramveer Singh.
面頁冊數:	164 p.
附註:	Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.
Contained By:	Dissertation Abstracts International76-01B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3634131
ISBN:	9781321143614

Advances in spectral learning with applications to text analysis and brain imaging.
Dhillon, Paramveer Singh.

Advances in spectral learning with applications to text analysis and brain imaging. - 164 p.

Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.

Thesis (Ph.D.)--University of Pennsylvania, 2014.

Spectral learning algorithms are becoming increasingly popular in data-rich domains, driven in part by recent advances in large scale randomized SVD, and in spectral estimation of Hidden Markov Models. Extensions of these methods lead to statistical estimation algorithms which are not only fast, scalable, and useful on real data sets, but are also provably correct. Following this line of research, we make two contributions. First, we propose a set of spectral algorithms for text analysis and natural language processing. In particular, we propose fast and scalable spectral algorithms for learning word embeddings -- low dimensional real vectors (called Eigenwords) that capture the "meaning" of words from their context. Second, we show how similar spectral methods can be applied to analyzing brain images.

ISBN: 9781321143614Subjects--Topical Terms:

626642
Computer Science.

Advances in spectral learning with applications to text analysis and brain imaging.
LDR:04449nam a2200373 4500 001 1967363
005 20141111083119.5
008 150210s2014 ||||||||||||||||| ||eng d
020 $a 9781321143614
035 $a (MiAaPQ)AAI3634131
035 $a AAI3634131
040 $a MiAaPQ $c MiAaPQ
100 1 $a Dhillon, Paramveer Singh. $3 2104344
245 1 0 $a Advances in spectral learning with applications to text analysis and brain imaging.
300 $a 164 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-01(E), Section: B.
500 $a Advisers: Lyle H. Ungar; James C. Gee.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2014.
520 $a Spectral learning algorithms are becoming increasingly popular in data-rich domains, driven in part by recent advances in large scale randomized SVD, and in spectral estimation of Hidden Markov Models. Extensions of these methods lead to statistical estimation algorithms which are not only fast, scalable, and useful on real data sets, but are also provably correct. Following this line of research, we make two contributions. First, we propose a set of spectral algorithms for text analysis and natural language processing. In particular, we propose fast and scalable spectral algorithms for learning word embeddings -- low dimensional real vectors (called Eigenwords) that capture the "meaning" of words from their context. Second, we show how similar spectral methods can be applied to analyzing brain images.
520 $a State-of-the-art approaches to learning word embeddings are slow to train or lack theoretical grounding; We propose three spectral algorithms that overcome these limitations. All three algorithms harness the multi-view nature of text data i.e. the left and right context of each word, and share three characteristics:
520 $a 1). They are fast to train and are scalable. 2). They have strong theoretical properties. 3). They can induce context-specific embeddings i.e. different embedding for "river bank" or "Bank of America".
520 $a They also have lower sample complexity and hence higher statistical power for rare words. We provide theory which establishes relationships between these algorithms and optimality criteria for the estimates they provide. We also perform thorough qualitative and quantitative evaluation of Eigenwords and demonstrate their superior performance over state-of-the-art approaches.
520 $a Next, we turn to the task of using spectral learning methods for brain imaging data.
520 $a Methods like Sparse Principal Component Analysis (SPCA), Non-negative Matrix Factorization (NMF) and Independent Component Analysis (ICA) have been used to obtain state-of-the-art accuracies in a variety of problems in machine learning. However, their usage in brain imaging, though increasing, is limited by the fact that they are used as out-of-the-box techniques and are seldom tailored to the domain specific constraints and knowledge pertaining to medical imaging, which leads to difficulties in interpretation of results.
520 $a In order to address the above shortcomings, we propose Eigenanatomy (EANAT), a general framework for sparse matrix factorization. Its goal is to statistically learn the boundaries of and connections between brain regions by weighing both the data and prior neuroanatomical knowledge.
520 $a Although EANAT incorporates some neuroanatomical prior knowledge in the form of connectedness and smoothness constraints, it can still be difficult for clinicians to interpret the results in specific domains where network-specific hypotheses exist. We thus extend EANAT and present a novel framework for prior-constrained sparse decomposition of matrices derived from brain imaging data, called Prior Based Eigenanatomy (p-Eigen). We formulate our solution in terms of a prior-constrained &ell;1 penalized (sparse) principal component analysis. Experimental evaluation confirms that p-Eigen extracts biologically-relevant, patient-specific functional parcels and that it significantly aids classification of Mild Cognitive Impairment when compared to state-of-the-art competing approaches.
590 $a School code: 0175.
650 4 $a Computer Science. $3 626642
650 4 $a Statistics. $3 517247
650 4 $a Health Sciences, Radiology. $3 1019076
690 $a 0984
690 $a 0463
690 $a 0574
710 2 $a University of Pennsylvania. $b Computer and Information Science. $3 2092564
773 0 $t Dissertation Abstracts International $g 76-01B(E).
790 $a 0175
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3634131