國立虎尾科技大學 |

Combinatorial Inference for Large-Scale Data Analysis.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Combinatorial Inference for Large-Scale Data Analysis./
Author:	Lu, Junwei.
Description:	1 online resource (237 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Contained By:	Dissertation Abstracts International79-10B(E).
Subject:	Statistics. -
Online resource:	click for full text (PQDT)
ISBN:	9780438047709

Combinatorial Inference for Large-Scale Data Analysis.
Lu, Junwei.

Combinatorial Inference for Large-Scale Data Analysis. - 1 online resource (237 pages)

Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.

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

Includes bibliographical references

Problems of inferring the combinatorial structures of networks arise in many real applications ranging from genomic regulatory networks, brain networks to social networks. This poses new and challenging problems on the uncertainty assessment and replicability analysis for statistical methods inferring these network topological structures. This thesis develops combinatorial inference, a new inferential framework for networks, to conduct hypothesis tests and variable selection for combinatorial structures in large-scale graphs.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438047709Subjects--Topical Terms:

556824
Statistics.
Index Terms--Genre/Form:

554714
Electronic books.

Combinatorial Inference for Large-Scale Data Analysis.
LDR:03258ntm a2200373Ki 4500 001 916908
005 20180928111503.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438047709
035 $a (MiAaPQ)AAI10813738
035 $a (MiAaPQ)princeton:12511
035 $a AAI10813738
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Lu, Junwei. $3 1123632
245 1 0 $a Combinatorial Inference for Large-Scale Data Analysis.
264 0 $c 2018
300 $a 1 online resource (237 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 $a Advisers: Han Liu; Jianqing Fan.
502 $a Thesis (Ph.D.)--Princeton University, 2018.
504 $a Includes bibliographical references
520 $a Problems of inferring the combinatorial structures of networks arise in many real applications ranging from genomic regulatory networks, brain networks to social networks. This poses new and challenging problems on the uncertainty assessment and replicability analysis for statistical methods inferring these network topological structures. This thesis develops combinatorial inference, a new inferential framework for networks, to conduct hypothesis tests and variable selection for combinatorial structures in large-scale graphs.
520 $a In the first part of the thesis, we propose a unified inferential method to test hypotheses on the global combinatorial properties of graphical models. We showed that my method works for general monotone graph properties that can be preserved under edge deletion including bipartite, planar, k-colorable, etc. We develop a new combinatorial minimax theory to justify the optimality of the skip-down algorithm. We introduce a new notion of graph packing entropy to sharply characterize the complexity of combinatorial inference problems for graphical models. It can be viewed as the combinatorial counterpart of the famous metric entropy theory on parametric minimax lower bounds.
520 $a In the second part of the thesis, we generalize the combinatorial inference for larger family of graphical models. We propose a novel class of dynamic nonparanormal graphical models, which allows us to model high dimensional heavy-tailed systems and the evolution of their latent network structures. Under this model we develop statistical tests for presence of edges both locally at a fixed index value and globally over a range of values. The tests are developed for a high-dimensional regime, are robust to model selection mistakes and do not require commonly assumed minimum signal strength. The testing procedures are based on a high dimensional, debiasing-free moment estimator, which uses a novel kernel smoothed Kendall's tau correlation matrix as an input statistic.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Statistics. $3 556824
650 4 $a Operations research. $3 573517
650 4 $a Artificial intelligence. $3 559380
655 7 $a Electronic books. $2 local $3 554714
690 $a 0463
690 $a 0796
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Princeton University. $b Operations Research and Financial Engineering. $3 1182940
773 0 $t Dissertation Abstracts International $g 79-10B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10813738 $z click for full text (PQDT)