%0 Conference Paper %1 das2008efficient %A Das, Gautam %A Koudas, Nick %A Papagelis, Manos %A Puttaswamy, Sushruth %B SSM '08: Proceeding of the 2008 ACM workshop on Search in social media %C New York, NY, USA %D 2008 %I ACM %K analysis network networks sampling sna social %P 67--74 %R http://doi.acm.org/10.1145/1458583.1458594 %T Efficient sampling of information in social networks %U http://portal.acm.org/citation.cfm?id=1458583.1458594 %X As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In this paper, we focus on improving the performance of information collection from the neighborhood of a user in a dynamic social network. To this end, we introduce sampling based algorithms to quickly approximate quantities of interest from the vicinity of a user's social graph. We then introduce and analyze variants of this basic scheme exploring correlations across our samples. Models of centralized and distributed social networks are considered. We show that our algorithms can be utilized to rank items in the neighborhood of a user, assuming that information for each user in the network is available. Using real and synthetic data sets, we validate the results of our analysis and demonstrate the efficiency of our algorithms in approximating quantities of interest. The methods we describe are general and can probably be easily adopted in a variety of strategies aiming to efficiently collect information from a social graph. %@ 978-1-60558-258-0

@inproceedings{das2008efficient, abstract = {As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In this paper, we focus on improving the performance of information collection from the neighborhood of a user in a dynamic social network. To this end, we introduce sampling based algorithms to quickly approximate quantities of interest from the vicinity of a user's social graph. We then introduce and analyze variants of this basic scheme exploring correlations across our samples. Models of centralized and distributed social networks are considered. We show that our algorithms can be utilized to rank items in the neighborhood of a user, assuming that information for each user in the network is available. Using real and synthetic data sets, we validate the results of our analysis and demonstrate the efficiency of our algorithms in approximating quantities of interest. The methods we describe are general and can probably be easily adopted in a variety of strategies aiming to efficiently collect information from a social graph.}, added-at = {2009-11-13T14:51:05.000+0100}, address = {New York, NY, USA}, author = {Das, Gautam and Koudas, Nick and Papagelis, Manos and Puttaswamy, Sushruth}, biburl = {https://www.bibsonomy.org/bibtex/264b5d84df9aacd4c2956d4780ddc98c2/stumme}, booktitle = {SSM '08: Proceeding of the 2008 ACM workshop on Search in social media}, description = {Efficient sampling of information in social networks}, doi = {http://doi.acm.org/10.1145/1458583.1458594}, interhash = {8f5b97910a5d3c0c7ed427309aae9fd7}, intrahash = {64b5d84df9aacd4c2956d4780ddc98c2}, isbn = {978-1-60558-258-0}, keywords = {analysis network networks sampling sna social}, location = {Napa Valley, California, USA}, pages = {67--74}, publisher = {ACM}, timestamp = {2009-11-13T14:51:05.000+0100}, title = {Efficient sampling of information in social networks}, url = {http://portal.acm.org/citation.cfm?id=1458583.1458594}, year = 2008 }