Computer Science – Data Structures and Algorithms
Scientific paper
2012-03-02
Computer Science
Data Structures and Algorithms
arXiv admin note: substantial text overlap with arXiv:1108.3048
Scientific paper
The growing amount of applications that generate vast amount of data in short time scales render the problem of partial monitoring, coupled with prediction, a rather fundamental one. We study the aforementioned canonical problem under the context of large-scale monitoring of communication networks. We consider the problem of selecting the "best" subset of links so as to optimally predict the quantity of interest at the remaining ones. This is a well know NP-hard problem, and algorithms seeking the exact solution are prohibitively expensive. We present a number of approximation algorithms that: 1) their computational complexity gains a significant improvement over existing greedy algorithms; 2) exploit the geometry of principal component analysis, which also helps us establish theoretical bounds on the prediction error; 3) are amenable for randomized implementation and execution in parallel or distributed fashion, a process that often yields the exact solution. The new algorithms are demonstrated and evaluated using real-world network data.
Kallitsis Michalis
Michailidis George
Stoev Stilian
No associations
LandOfFree
Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring 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 Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-167239