Information Gathering in Networks via Active Exploration
暂无分享,去创建一个
Andreas Krause | Ryen W. White | Eric Horvitz | Pushmeet Kohli | Adish Singla | E. Horvitz | Andreas Krause | Pushmeet Kohli | A. Singla
[1] Zahy Bnaya. Social Network Search as a Volatile Multi-armed Bandit Problem , 2013 .
[2] Victor O. K. Li,et al. Locating Experts via Online Social Networks , 2010, 2010 IEEE International Conference on Communications.
[3] Sanjeev Khanna,et al. The Power of Local Information in Social Networks , 2012, WINE.
[4] Lada A. Adamic,et al. How to search a social network , 2005, Soc. Networks.
[5] Ryen W. White,et al. Finding our way on the web: exploring the role of waypoints in search interaction , 2011, WWW.
[6] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[7] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[8] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[9] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[10] Federico Boccardi,et al. Load & backhaul aware decoupled downlink/uplink access in 5G systems , 2014, 2015 IEEE International Conference on Communications (ICC).
[11] Ryen W. White,et al. Supporting synchronous social q&a throughout the question lifecycle , 2011, WWW.
[12] Elsevier Sdol,et al. Advances in Applied Mathematics , 2009 .
[13] Federico Boccardi,et al. IEEE International Conference on Communications , 2015, ICC 2015.
[14] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.
[15] Andreas Krause,et al. Submodularity and its applications in optimized information gathering , 2011, TIST.
[16] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.
[17] Jure Leskovec,et al. Geospatial Structure of a Planetary-Scale Social Network , 2014, IEEE Transactions on Computational Social Systems.
[18] Pushmeet Kohli,et al. Tractability: Practical Approaches to Hard Problems , 2013 .
[19] Dacheng Tao,et al. Networked bandits with disjoint linear payoffs , 2014, KDD.
[20] S. Guha,et al. Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.
[21] H. Robbins,et al. Asymptotically efficient adaptive allocation rules , 1985 .
[22] Arindam Banerjee,et al. A Social Query Model for Decentralized Search , 2008 .
[23] Dafna Shahaf,et al. Turning down the noise in the blogosphere , 2009, KDD.
[24] Jin-Woo Jeong,et al. A Crowd-Powered Socially Embedded Search Engine , 2013, ICWSM.
[25] Damon Horowitz,et al. The anatomy of a large-scale social search engine , 2010, WWW '10.
[26] Lada A. Adamic,et al. Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[27] Jon M. Kleinberg,et al. Small-World Phenomena and the Dynamics of Information , 2001, NIPS.
[28] Béla Bollobás,et al. The Diameter of a Scale-Free Random Graph , 2004, Comb..
[29] Martin Hentschel,et al. CrowdSTAR: A Social Task Routing Framework for Online Communities , 2014, ICWE.
[30] Ulrik Brandes,et al. Social Networks , 2013, Handbook of Graph Drawing and Visualization.
[31] Y. Narahari,et al. Threshold behavior of incentives in social networks , 2010, CIKM.
[32] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[33] Eric Horvitz,et al. Task routing for prediction tasks , 2012, AAMAS.
[34] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .
[35] A. Banerjee. A Social Query Model for Distributed Search , 2008 .
[36] Béla Bollobás,et al. Mathematical results on scale‐free random graphs , 2005 .
[37] Jon M. Kleinberg,et al. Query incentive networks , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).