Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.creator | Xiang, Ruoxi | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/7775 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Complex network analysis of time series | en_US |
| dcterms.abstract | Data in the form of time series are ubiquitous that they can be found everywhere and the analysis of time series has long been important for extracting meaningful statistics and valuable information of systems in a variety of research fields. Although time series and complex networks share many relevant applications, the bridge between time series and complex network did not appear until 2006 when a method of transforming pseudoperiodic time series into the so-called cycle networks was introduced. Transforming time series into complex networks enables understanding of the correlation structure and dynamical properties of the time series by using the graph and network theory. This thesis presents a novel framework by using complex networks to represent phase space dynamics from time series. The construction of recurrence networks by the ε-networks method and the k-nearest neighbor networks method is studied. Although a complete study for ε recurrence networks has been reported previously, no complete study of the theoretical foundation underlying the k-nearest neighbor approach has been provided. This thesis specifically addresses this deficiency. The key contributions of this thesis include: 1. a critical review of the network-based time series analysis methods; 2. an extension of the study of the k-nearest neighbor networks from the motif patterns to the full gamut of statistics which describe the time series at different scales; 3. an exposition of the origin of motif properties for k-nearest neighbor networks and links from the network properties to the topology of the time series; and 4. a detailed comparison between the k-nearest neighbor network method and the ε-recurrence network method, the result from which would provide insights to proper parameter selection when using these two methods. The results from this work offer new theoretical insights into the application of complex network theory in time series analysis, and provide novel analytical perspectives of time series problems from a complex network viewpoint. | en_US |
| dcterms.extent | xii, 104 pages : color illustrations ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2014 | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.LCSH | Time-series analysis | en_US |
| dcterms.LCSH | Mathematical statistics -- Data processing | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b27629971.pdf | For All Users | 9.83 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/7775