Kernel-based Reconstruction of Dynamic Functions over Dynamic Graphs
2017-08
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Kernel-based Reconstruction of Dynamic Functions over Dynamic Graphs
Authors
Published Date
2017-08
Publisher
Type
Thesis or Dissertation
Abstract
Graph-based methods pervade the inference toolkits of numerous disciplines including sociology, biology, neuroscience, physics, chemistry, and engineering. A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly dierent time instants. Leveraging spatiotemporal dynamics and prior information can drastically reduce the number of observed vertices, and hence the cost of sampling. Alleviating the limited exibility of existing approaches, this thesis broadens the kernel-based graph function estimation framework to reconstruct time-evolving functions over possibly time-evolving topologies. This encompassing approach inherits the versatility and generality of kernel-based methods, for which no knowledge on distributions or second-order statistics is required. Ecient inference algorithms are derived that operate in an online and even data-adaptive fashion. Moreover, semi-parametric approaches capable of incorporating the structure of known graph functions without sacri- cing the exibility of the overall model are advocated. Numerical tests with real data sets corroborate the merits of the proposed methods relative to competing alternatives.
Description
University of Minnesota M.S. thesis. August 2017. Major: Electrical/Computer Engineering. Advisor: Georgios Giannakis. 1 computer file (PDF); vii, 82 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.