Network Clustering Approximation Algorithm Using One Pass Black Box Sampling

Details Network Clustering Approximation Algorithm Using One Pass Black Box Sampling Network Clustering Approximation Algorithm Using One Pass Black Box Sampling

2011-10-17

arxiv.org/abs/1110.3563v1

Computer Science

Social and Information Networks

Scientific paper

Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this surprisingly simple algorithm gives a solution that is within an expected factor of two or three of optimal with either of two natural distance functions. In fact, this approximation guarantee works for any problem where there is a probability distribution on clusterings. We then examine the behavior of this algorithm in the context of social network trust inference.

Affiliated with

Also associated with

No associations

Rating

Network Clustering Approximation Algorithm Using One Pass Black Box Sampling 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 Network Clustering Approximation Algorithm Using One Pass Black Box Sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network Clustering Approximation Algorithm Using One Pass Black Box Sampling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317199