Compressive Network Analysis

Details Compressive Network Analysis Compressive Network Analysis

2011-04-24

arxiv.org/abs/1104.4605v1

Statistics

Machine Learning

Scientific paper

Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for modeling network data, which connects two seemingly different areas: network data analysis and compressed sensing. From a nonparametric perspective, we model an observed network using a large dictionary. In particular, we consider the network clique detection problem and show connections between our formulation with a new algebraic tool, namely Randon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Though this paper is mainly conceptual, we also develop practical approximation algorithms for solving empirical problems and demonstrate their usefulness on real-world datasets.

Affiliated with

Also associated with

No associations

Rating

Compressive Network Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressive Network Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressive Network Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623797