東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Separating features from noise with ...

Wang, Bei.

Linked to FindBook

Google Book

Amazon

博客來

Separating features from noise with persistence and statistics.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Separating features from noise with persistence and statistics./
Author:	Wang, Bei.
Description:	201 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5592.
Contained By:	Dissertation Abstracts International71-09B.
Subject:	Statistics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3413880
ISBN:	9781124154756

Separating features from noise with persistence and statistics.
Wang, Bei.

Separating features from noise with persistence and statistics. - 201 p.

Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5592.

Thesis (Ph.D.)--Duke University, 2010.

In this thesis, we explore techniques in statistics and persistent homology, which detect features among data sets such as graphs, triangulations and point cloud. We accompany our theorems with algorithms and experiments, to demonstrate their effectiveness in practice.

ISBN: 9781124154756Subjects--Topical Terms:

517247
Statistics.

Separating features from noise with persistence and statistics.
LDR:03167nam 2200373 4500 001 1399899
005 20110930095903.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124154756
035 $a (UMI)AAI3413880
035 $a AAI3413880
040 $a UMI $c UMI
100 1 $a Wang, Bei. $3 1678907
245 1 0 $a Separating features from noise with persistence and statistics.
300 $a 201 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5592.
500 $a Adviser: Herbert Edelsbrunner.
502 $a Thesis (Ph.D.)--Duke University, 2010.
520 $a In this thesis, we explore techniques in statistics and persistent homology, which detect features among data sets such as graphs, triangulations and point cloud. We accompany our theorems with algorithms and experiments, to demonstrate their effectiveness in practice.
520 $a We start with the derivation of graph scan statistics, a measure useful to assess the statistical significance of a subgraph in terms of edge density. We cluster graphs into densely-connected subgraphs based on this measure. We give algorithms for finding such clusterings and experiment on real-world data.
520 $a We next study statistics on persistence, for piecewise-linear functions defined on the triangulations of topological spaces. We derive persistence pairing probabilities among vertices in the triangulation. We also provide upper bounds for total persistence in expectation.
520 $a We continue by examining the elevation function defined on the triangulation of a surface. Its local maxima obtained by persistence pairing are useful in describing features of the triangulations of protein surfaces. We describe an algorithm to compute these local maxima, with a run-time ten-thousand times faster in practice than previous method. We connect such improvement with the total Gaussian curvature of the surfaces.
520 $a Finally, we study a stratification learning problem: given a point cloud sampled from a stratified space, which points belong to the same strata, at a given scale level? We assess the local structure of a point in relation to its neighbors using kernel and cokernel persistent homology. We prove the effectiveness of such assessment through several inference theorems, under the assumption of dense sample. The topological inference theorem relates the sample density with the homological feature size. The probabilistic inference theorem provides sample estimates to assess the local structure with confidence. We describe an algorithm that computes the kernel and cokernel persistence diagrams and prove its correctness. We further experiment on simple synthetic data.
590 $a School code: 0066.
650 4 $a Statistics. $3 517247
650 4 $a Theoretical Mathematics. $3 1672766
650 4 $a Computer Science. $3 626642
690 $a 0463
690 $a 0642
690 $a 0984
710 2 $a Duke University. $b Computer Science. $3 1019283
773 0 $t Dissertation Abstracts International $g 71-09B.
790 1 0 $a Edelsbrunner, Herbert, $e advisor
790 1 0 $a Agarwal, Pankaj K. $e committee member
790 1 0 $a Munagala, Kamesh $e committee member
790 1 0 $a Mukherjee, Sayan $e committee member
790 $a 0066
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3413880