國立高雄大學圖資館 |

Language: English

Back

Problems in the analysis of complex,...

Hughes, Shannon Maureen.

Problems in the analysis of complex, high-dimensional datasets .

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Problems in the analysis of complex, high-dimensional datasets .
Author:	Hughes, Shannon Maureen.
Description:	125 p.
Notes:	Advisers: Ingrid Daubechies; Peter Ramadge.
Notes:	Source: Dissertation Abstracts International, Volume: 69-10, Section: B, page: .
Contained By:	Dissertation Abstracts International69-10B.
Subject:	Engineering, Electronics and Electrical.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3333852
ISBN:	9780549863113

Problems in the analysis of complex, high-dimensional datasets .
Hughes, Shannon Maureen.

Problems in the analysis of complex, high-dimensional datasets . - 125 p.

Advisers: Ingrid Daubechies; Peter Ramadge.

Thesis (Ph.D.)--Princeton University, 2008.

Finally, we look at the problem of trying to characterize an unknown or poorly understood underlying process that has generated our dataset. For this, we look to a dataset of high-resolution scans of paintings by Vincent Van Gogh and contemporaries, and we ask what distinguishes a painting generated by Van Gogh's artistic process from one by another artist. In this vein, we develop methods that allow at least 80% classification accuracy of Van Gogh paintings from those of other artists. We also develop further methods that seem to detect the hesitation of a forger or a copyist in a painting's digital image.

ISBN: 9780549863113Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Problems in the analysis of complex, high-dimensional datasets .
LDR:03514nam _2200325 _450 001 206970
005 20090413130349.5
008 090730s2008 ||||||||||||||||| ||eng d
020 $a 9780549863113
035 $a 00372182
040 $a UMI $c UMI
100 $a Hughes, Shannon Maureen. $3 321908
245 1 0 $a Problems in the analysis of complex, high-dimensional datasets .
300 $a 125 p.
500 $a Advisers: Ingrid Daubechies; Peter Ramadge.
500 $a Source: Dissertation Abstracts International, Volume: 69-10, Section: B, page: .
502 $a Thesis (Ph.D.)--Princeton University, 2008.
520 $a Finally, we look at the problem of trying to characterize an unknown or poorly understood underlying process that has generated our dataset. For this, we look to a dataset of high-resolution scans of paintings by Vincent Van Gogh and contemporaries, and we ask what distinguishes a painting generated by Van Gogh's artistic process from one by another artist. In this vein, we develop methods that allow at least 80% classification accuracy of Van Gogh paintings from those of other artists. We also develop further methods that seem to detect the hesitation of a forger or a copyist in a painting's digital image.
520 $a In recent years, technological advances have rapidly expanded our data acquisition capabilities. As a result of this greater ease of acquisition, the typical modern scientific dataset has increased exponentially in both size and complexity, and the difficulties of effectively analyzing such datasets have multiplied. This thesis considers a few of the most prominent analysis challenges posed by this new wealth of data.
520 $a We also use these methods on fMRI datasets to attempt to characterize the brain's representation of spatial location. However, our experiments reveal that there are several challenges posed by fMRI datasets, which we detail and discuss, that current manifold learning methods can not yet handle.
520 $a We start by considering the problem of reconciling and fusing information from multiple acquisition modalities. We study current methods that have shown great experimental success in order to identify their most critical properties. We then propose a new, larger class of metrics, which share these previously identified properties, for this purpose. We verify that these new methods capture the experimental success of the methods we've studied, but can also incorporate additional desirable properties, such as greater computational simplicity.
520 $a We then move to the problem of automatically finding underlying structure in very large datasets. In particular, we focus on the problem of finding underlying manifold structure in high-dimensional data that can be effectively parameterized by a small number of latent variables. We draw a previously unnoticed connection between a recent wave of new spectral methods for this problem and earlier criteria motivated by more physical concerns. Using this connection, we demonstrate the source of a number of typical shortcomings in the output of spectral methods and show how to correct these shortcomings.
590 $a School code: 0181.
650 $a Engineering, Electronics and Electrical. $3 226981
650 $a Computer Science. $3 212513
690 $a 0544
690 $a 0984
710 $a Princeton University. $3 212488
773 0 $g 69-10B. $t Dissertation Abstracts International
790 $a 0181
790 1 0 $a Daubechies, Ingrid, $e advisor
790 1 0 $a Ramadge, Peter, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3333852 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3333852