Skip to Main Content
 

Global Search Box

 
 
 
 

Files

ETD Abstract Container

Abstract Header

A Framework for the Static and Dynamic Analysis of Interaction Graphs

Asur, Sitaram

Abstract Details

2009, Doctor of Philosophy, Ohio State University, Computer Science and Engineering.

Data originating from many different real-world domains can be represented meaningfully as interaction networks. Examples abound, ranging from gene expression networks to social networks, and from the World Wide Web to protein-protein interaction networks. The study of these complex networks can result in the discovery of meaningful patterns and can potentially afford insight into the structure, properties and behavior of these networks. Hence, there is a need to design suitable algorithms to extract or infer meaningful information from these networks. However, the challenges involved are daunting.

First, most of these real-world networks have specific topological constraints that make the task of extracting useful patterns using traditional data mining techniques difficult. Additionally, these networks can be noisy (containing unreliable interactions), which makes the process of knowledge discovery difficult. Second, these networks are usually dynamic in nature. Identifying the portions of the network that are changing, characterizing and modeling the evolution, and inferring or predicting future trends are critical challenges that need to be addressed in the context of understanding the evolutionary behavior of such networks.

To address these challenges, we propose a framework of algorithms designed to detect, analyze and reason about the structure, behavior and evolution of real-world interaction networks. The proposed framework can be divided into three components:

1. A static analysis component where we propose efficient, noise-resistant algorithms taking advantage of specific topological features of these networks to extract useful functional modules and motifs from interaction graphs.

2. An event detection component where we propose algorithms to detect and characterize critical events and behavior for evolving interaction graphs

3. A temporal reasoning component where we propose approaches wherein one can make useful inferences on events, communities, individuals and their interactions over time.

For each component, we propose either new algorithms, or suggest ways to apply existing techniques in a previously-unused manner. Where appropriate, we compare against traditional or accepted standards. We evaluate the proposed framework on real datasets drawn from clinical, biological and social domains.

Srinivasan Parthasarathy, PhD (Advisor)
Gagan Agrawal, PhD (Committee Member)
P Sadayappan, PhD (Committee Member)
213 p.

Recommended Citations

Citations

  • Asur, S. (2009). A Framework for the Static and Dynamic Analysis of Interaction Graphs [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243902523

    APA Style (7th edition)

  • Asur, Sitaram. A Framework for the Static and Dynamic Analysis of Interaction Graphs. 2009. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1243902523.

    MLA Style (8th edition)

  • Asur, Sitaram. "A Framework for the Static and Dynamic Analysis of Interaction Graphs." Doctoral dissertation, Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243902523

    Chicago Manual of Style (17th edition)