國立高雄大學圖資館 |

Statistical Learning and Modeling With Graphs and Networks /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Statistical Learning and Modeling With Graphs and Networks /Zeyu Wei.
作者:	Wei, Zeyu,
面頁冊數:	1 electronic resource (312 pages)
附註:	Source: Dissertations Abstracts International, Volume: 86-01, Section: B.
附註:	Advisors: Chen, Yen-Chi; McCormick, Tyler H. Committee members: Meila, Marina; Lee, Jack.
Contained By:	Dissertations Abstracts International86-01B.
標題:	Statistics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31328718
ISBN:	9798383220580

Statistical Learning and Modeling With Graphs and Networks /
Wei, Zeyu,

Statistical Learning and Modeling With Graphs and Networks /Zeyu Wei. - 1 electronic resource (312 pages)

Source: Dissertations Abstracts International, Volume: 86-01, Section: B.

Graph, consisting of a set of vertices and a set of edges, is a natural tool to study relations. From a geometric perspective, relations between data points reveal information about the underlying structure, and a graph as a geometric object can not only visualize but also mathematical characterize such geometric structures in the data. From a network perspective, graphs can also model connections between different units and have applications in various fields such as epidemiology, econometrics, sociology, biology, and astronomy. We first take advantage of graphs from a geometric perspective and propose a data analysis framework that constructs weighted graphs, called skeletons, to encode the geometric structures in the data and utilize the learned graphs to assist downstream analysis tasks such as clustering and regression.For clustering, we introduce a density-aided method that can detect clusters in multivariate and even high-dimensional data with irregular shapes. To bypass the curse of dimensionality, we propose surrogate density measures that are less dependent on the dimension and have intuitive geometric interpretations. The clustering framework constructs a concise graph representation of the given data as an intermediate step and can be thought of as a combination of prototype methods, density-based clustering, and hierarchical clustering. We show by theoretical analysis and empirical studies that skeleton clustering leads to reliable clusters in multivariate and high-dimensional scenarios.For regression tasks, we propose a novel framework specialized for covariates concentrated around some low-dimension geometric structures. The proposed framework first learns a graph representation of the covariates which encodes the geometric structures. Then we apply nonparametric regression techniques to estimate the regression function on the skeleton graph, which, notably, bypasses the curse of dimensionality. We derive statistical and computational properties of the proposed regression framework and use simulations and real data examples to illustrate its effectiveness. Our framework has the advantage that predictors for distinct geometric structures can be accounted for and is robust to additive noise and noisy observations.Graphs are widely used to represent networks of connections and serve as a helpful tool in modeling real-world diffusion processes. Network diffusion models are used to study things like disease transmission, information spread, and technology adoption. However, small amounts of mismeasurement are extremely likely in the networks constructed to operationalize these models. We show that estimates of diffusions are highly non-robust to this measurement error. First, we show that even when measurement error is vanishingly small, such that the share of missed links is close to zero, forecasts about the extent of diffusion will greatly underestimate the truth. Second, a small mismeasurement in the identity of the initial seed generates a large shift in the locations of the expected diffusion path. We show that both of these results still hold when the vanishing measurement error is only local in nature. Such non-robustness in forecasting exists even under conditions where the basic reproductive number is consistently estimable. Possible solutions, such as estimating the measurement error or implementing widespread detection efforts, still face difficulties because the number of missed links is so small. Finally, we conduct Monte Carlo simulations on simulated networks, and real networks from three settings: travel data from the COVID-19 pandemic in the western US, a mobile phone marketing campaign in rural India, and an insurance experiment in China.

English

ISBN: 9798383220580Subjects--Topical Terms:

182057
Statistics.
Subjects--Index Terms:

Diffusion

Statistical Learning and Modeling With Graphs and Networks /
LDR:05246nmm a22004453i 4500 001 676337
005 20250420214345.5
006 m o d
007 cr|nu||||||||
008 250901s2024 miu||||||m |||||||eng d
020 $a 9798383220580
035 $a (MiAaPQD)AAI31328718
035 $a AAI31328718
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Wei, Zeyu, $e author. $3 990117
245 1 0 $a Statistical Learning and Modeling With Graphs and Networks / $c Zeyu Wei.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2024
300 $a 1 electronic resource (312 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: Dissertations Abstracts International, Volume: 86-01, Section: B.
500 $a Advisors: Chen, Yen-Chi; McCormick, Tyler H. Committee members: Meila, Marina; Lee, Jack.
502 $b Ph.D. $c University of Washington $d 2024.
520 $a Graph, consisting of a set of vertices and a set of edges, is a natural tool to study relations. From a geometric perspective, relations between data points reveal information about the underlying structure, and a graph as a geometric object can not only visualize but also mathematical characterize such geometric structures in the data. From a network perspective, graphs can also model connections between different units and have applications in various fields such as epidemiology, econometrics, sociology, biology, and astronomy. We first take advantage of graphs from a geometric perspective and propose a data analysis framework that constructs weighted graphs, called skeletons, to encode the geometric structures in the data and utilize the learned graphs to assist downstream analysis tasks such as clustering and regression.For clustering, we introduce a density-aided method that can detect clusters in multivariate and even high-dimensional data with irregular shapes. To bypass the curse of dimensionality, we propose surrogate density measures that are less dependent on the dimension and have intuitive geometric interpretations. The clustering framework constructs a concise graph representation of the given data as an intermediate step and can be thought of as a combination of prototype methods, density-based clustering, and hierarchical clustering. We show by theoretical analysis and empirical studies that skeleton clustering leads to reliable clusters in multivariate and high-dimensional scenarios.For regression tasks, we propose a novel framework specialized for covariates concentrated around some low-dimension geometric structures. The proposed framework first learns a graph representation of the covariates which encodes the geometric structures. Then we apply nonparametric regression techniques to estimate the regression function on the skeleton graph, which, notably, bypasses the curse of dimensionality. We derive statistical and computational properties of the proposed regression framework and use simulations and real data examples to illustrate its effectiveness. Our framework has the advantage that predictors for distinct geometric structures can be accounted for and is robust to additive noise and noisy observations.Graphs are widely used to represent networks of connections and serve as a helpful tool in modeling real-world diffusion processes. Network diffusion models are used to study things like disease transmission, information spread, and technology adoption. However, small amounts of mismeasurement are extremely likely in the networks constructed to operationalize these models. We show that estimates of diffusions are highly non-robust to this measurement error. First, we show that even when measurement error is vanishingly small, such that the share of missed links is close to zero, forecasts about the extent of diffusion will greatly underestimate the truth. Second, a small mismeasurement in the identity of the initial seed generates a large shift in the locations of the expected diffusion path. We show that both of these results still hold when the vanishing measurement error is only local in nature. Such non-robustness in forecasting exists even under conditions where the basic reproductive number is consistently estimable. Possible solutions, such as estimating the measurement error or implementing widespread detection efforts, still face difficulties because the number of missed links is so small. Finally, we conduct Monte Carlo simulations on simulated networks, and real networks from three settings: travel data from the COVID-19 pandemic in the western US, a mobile phone marketing campaign in rural India, and an insurance experiment in China.
546 $a English
590 $a School code: 0250
650 4 $a Statistics. $3 182057
650 4 $a Computer science. $3 199325
653 $a Diffusion
653 $a Networks
653 $a Nonparametric statistics
653 $a Regression analysis
653 $a Topological data analysis
690 $a 0463
690 $a 0800
690 $a 0984
710 2 $a University of Washington. $b Statistics. $3 826839
720 1 $a Chen, Yen-Chi $e degree supervisor.
720 1 $a McCormick, Tyler H. $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-01B.
790 $a 0250
791 $a Ph.D.
792 $a 2024
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31328718