Representing Big Data as Networks: New Methods and Insights

Abstract

Our world produces massive data every day; they exist in diverse forms, from pairwise data and matrix to time series and trajectories. Meanwhile, we have access to the versatile toolkit of network analysis. Networks also have different forms; from simple networks to higher-order network, each representation has different capabilities in carrying information. For researchers who want to leverage the power of the network toolkit, and apply it beyond networks data to sequential data, diffusion data, and many more, the question is: how to represent big data and networks? This dissertation makes a first step to answering the question. It proposes the higher-order network, which is a critical piece for representing higher-order interaction data; it introduces a scalable algorithm for building the network, and visualization tools for interactive exploration. Finally, it presents broad applications of the higher-order network in the real-world.

PhD thesis, Univ Indiana (Jul 2017). Committee: Nitesh Chawla (chair), David Lodge, Tijana Milenkovec, Zoltan Toroczkai. Initial deposit at CurateND: https://curate.nd.edu/show/q524jm2466t

References in corpus (9)

• Emergence of scaling in random networks
• Fast unfolding of communities in large networks
• The architecture of complex weighted networks
• Higher-order organization of complex networks
• Analysis of the Airport Network of India as a complex weighted network
• Scaling laws for the movement of people between locations in a large city
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Using Triangles to Improve Community Detection in Directed Networks
• It Doesn't Break Just on Twitter. Characterizing Facebook content During Real World Events