http://www.bibsonomy.org/burst/user/mmcglohoBibSonomy BuRST Feed for /user/mmcgloho2008-10-16T06:41:35+02:00http://www.bibsonomy.org/bibtex/25e5cc221d7da719909f3bf8c507b0afc/mmcglohommcgloho2008-04-24T05:51:58+02:00r-mat <span style="color:#555555;">D. <a href="http://www.bibsonomy.org/author/Chakrabarti">Chakrabarti</a> und Y. <a href="http://www.bibsonomy.org/author/Zhan">Zhan</a> und C. <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> </span><em>SIAM International Conference on Data Mining, </em>(<em>2004</em>)Thu Apr 24 05:51:58 CEST 2008SIAM International Conference on Data MiningR-MAT: A Recursive Model for Graph Mining2004r-mat dblphttp://www.bibsonomy.org/bibtex/2bdc632d54a6dff030d0124436bb1b008/mmcglohommcgloho2008-04-24T05:47:14+02:00kronecker <span style="color:#555555;">Jure <a href="http://www.bibsonomy.org/author/Leskovec">Leskovec</a> und Deepayan <a href="http://www.bibsonomy.org/author/Chakrabarti">Chakrabarti</a> und Jon M. <a href="http://www.bibsonomy.org/author/Kleinberg">Kleinberg</a> und Christos <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> </span><em>PKDD, </em><em>Volume3721vonLecture Notes in Computer Science, </em><em>Seite133-145. </em><em>Springer, </em>(<em>2005</em>)Thu Apr 24 05:47:14 CEST 2008PKDDconf/pkdd/2005133-145Lecture Notes in Computer ScienceRealistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication.37212005kronecker dblphttp://www.bibsonomy.org/bibtex/2b73f19a10731c42064eb34b54ac0513b/mmcglohommcgloho2008-04-21T04:23:56+02:00diffusion influence <span style="color:#555555;">Elchanan <a href="http://www.bibsonomy.org/author/Mossel">Mossel</a> und S&#233;bastien <a href="http://www.bibsonomy.org/author/Roch">Roch</a> </span><em>STOC, </em><em>Seite128-134. </em><em>ACM, </em>(<em>2007</em>)Mon Apr 21 04:23:56 CEST 2008STOCconf/stoc/2007128-134On the submodularity of influence in social networks.2007diffusion influence http://www.bibsonomy.org/bibtex/24e42da72517e538914e3c8d859d2d4e5/mmcglohommcgloho2008-04-21T04:19:54+02:00imported <span style="color:#555555;">Romualdo <a href="http://www.bibsonomy.org/author/Pastor-Satorras">Pastor-Satorras</a> und Alessandro <a href="http://www.bibsonomy.org/author/Vespignani">Vespignani</a> </span><em>Phys. Rev. Lett.</em><em>86(14):3200--3203</em><em>Apr2001. </em>Mon Apr 21 04:19:54 CEST 2008Phys. Rev. Lett.Apr143200--3203Epidemic Spreading in Scale-Free Networks862001imported http://www.bibsonomy.org/bibtex/2f427d5a77a7caa9c7549361984170cec/mmcglohommcgloho2008-04-21T04:19:09+02:00imported <span style="color:#555555;">Romualdo <a href="http://www.bibsonomy.org/author/Pastor-Satorras">Pastor-Satorras</a> und Alessandro <a href="http://www.bibsonomy.org/author/Vespignani">Vespignani</a> </span><em>Phys. Rev. E</em><em>63(6):066117</em><em>May2001. </em>Mon Apr 21 04:19:09 CEST 2008Phys. Rev. EMay6066117Epidemic dynamics and endemic states in complex networks632001imported Main paper DBhttp://www.bibsonomy.org/bibtex/2ca49699eca518f3c600ee919d89af5de/mmcglohommcgloho2008-04-21T04:09:54+02:00diffusion <span style="color:#555555;">James <a href="http://www.bibsonomy.org/author/Coleman">Coleman</a> und Elihu <a href="http://www.bibsonomy.org/author/Katz">Katz</a> und Herbert <a href="http://www.bibsonomy.org/author/Menzel">Menzel</a> </span><em>Sociometry</em><em>20(4):253-270</em>(<em>1957</em>)Mon Apr 21 04:09:54 CEST 2008Sociometry4253-270The diffusion of innovation among physicians201957diffusion Main paper DBhttp://www.bibsonomy.org/bibtex/2944b3f20940ed25da669ba8260c45c15/mmcglohommcgloho2008-04-21T04:09:20+02:00diffusion <span style="color:#555555;">Thomas W. <a href="http://www.bibsonomy.org/author/Valente">Valente</a> und Everett M. <a href="http://www.bibsonomy.org/author/Rogers">Rogers</a> </span><em>Science Communications</em><em>16(3):242-273</em><em>March1995. </em>Mon Apr 21 04:09:20 CEST 2008Science CommunicationsMarch3242-273The origins and development of the diffusion of innovations paradigm as an example of scientific growth161995diffusion Main paper DBhttp://www.bibsonomy.org/bibtex/22693d44c12801c94cf6af3fd21c86d7e/mmcglohommcgloho2008-04-21T04:06:39+02:00epidemiology <span style="color:#555555;">Norman T. J. <a href="http://www.bibsonomy.org/author/Baily">Baily</a> </span><em>Charles Griffen, </em><em>London, </em>(<em>1957</em>)Mon Apr 21 04:06:39 CEST 2008LondonThe mathematical theory of epidemics1957epidemiology Main paper DBhttp://www.bibsonomy.org/bibtex/2479de6530a14a7aff4469f21678e8027/mmcglohommcgloho2008-04-21T04:06:15+02:00social-networks <span style="color:#555555;">Stanley <a href="http://www.bibsonomy.org/author/Milgram">Milgram</a> </span><em>Psychology Today</em>(<em>1967</em>)Mon Apr 21 04:06:15 CEST 2008Psychology Today60-67The Small World Problem21967social-networks Main paper DBhttp://www.bibsonomy.org/bibtex/2ec6bf630f13bd2a37d11c391fec39003/mmcglohommcgloho2008-04-21T04:06:03+02:00diffusion evolution <span style="color:#555555;">Richard <a href="http://www.bibsonomy.org/author/Dawkins">Dawkins</a> </span><em>Oxford University Press, </em><em>Oxford New York, </em><em>New Edition, </em>(<em>1989</em>)Mon Apr 21 04:06:03 CEST 2008Oxford New YorkNewThe selfish gene1989diffusion evolution Main paper DBhttp://www.bibsonomy.org/bibtex/2063aa3077882dbcf5ea1c96d3e89f062/mmcglohommcgloho2008-04-21T04:05:15+02:00book <span style="color:#555555;">Malcolm <a href="http://www.bibsonomy.org/author/Gladwell">Gladwell</a> </span><em>Little Brown, </em><em>Boston, </em><em>1st Edition, </em>(<em>2000</em>)Mon Apr 21 04:05:15 CEST 2008Boston1stThe tipping point: how little things can make a big difference2000book Main paper DBhttp://www.bibsonomy.org/bibtex/2131d84ad09c429014b67930104db8b77/mmcglohommcgloho2008-04-21T04:04:45+02:00social-networks epidemiology <span style="color:#555555;">Fredrick <a href="http://www.bibsonomy.org/author/Lilijeros">Lilijeros</a> und Cristofer <a href="http://www.bibsonomy.org/author/Edling">Edling</a> und Lu'is <a href="http://www.bibsonomy.org/author/Amaral">Amaral</a> und Eugene <a href="http://www.bibsonomy.org/author/Stanley">Stanley</a> und Yvonne <a href="http://www.bibsonomy.org/author/{\AA}berg">AAberg</a> </span><em>Nature</em>(<em>2001</em>)Mon Apr 21 04:04:45 CEST 2008Nature907-908The web of human sexual contacts4112001social-networks epidemiology Main paper DBhttp://www.bibsonomy.org/bibtex/25977f13eeeefe4933030f369914f24eb/mmcglohommcgloho2008-04-21T04:03:24+02:00social-networks <span style="color:#555555;">Mark <a href="http://www.bibsonomy.org/author/Granovetter">Granovetter</a> </span><em>American Journal of Sociology</em><em>83(6):1420-1443</em>(<em>1978</em>)Mon Apr 21 04:03:24 CEST 2008American Journal of Sociology61420-1443Threshold Models of Collective Behavior831978social-networks Center-piece subgraphshttp://www.bibsonomy.org/bibtex/25b9a7663680b57d6e4c7bdbcb5af591e/mmcglohommcgloho2008-04-17T22:29:50+02:00imported <span style="color:#555555;">Hanghang <a href="http://www.bibsonomy.org/author/Tong">Tong</a> und Christos <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> </span><em>KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, </em><em>Seite404--413. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2006</em>)Thu Apr 17 22:29:50 CEST 2008New York, NY, USAKDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining404--413Center-piece subgraphs: problem definition and fast solutions2006imported Given Q nodes in a social network (say, authorship network), how can we find the node/author that is the center-piece, and has direct or indirect connections to all, or most of them? For example, this node could be the common advisor, or someone who started the research area that the Q nodes belong to. Isomorphic scenarios appear in law enforcement (find the master-mind criminal, connected to all current suspects), gene regulatory networks (find the protein that participates in pathways with all or most of the given Q proteins), viral marketing and many more.Connection subgraphs is an important first step, handling the case of Q=2 query nodes. Then, the connection subgraph algorithm finds the b intermediate nodes, that provide a good connection between the two original query nodes.Here we generalize the challenge in multiple dimensions: First, we allow more than two query nodes. Second, we allow a whole family of queries, ranging from 'OR' to 'AND', with 'softAND' in-between. Finally, we design and compare a fast approximation, and study the quality/speed trade-off.We also present experiments on the DBLP dataset. The experiments confirm that our proposed method naturally deals with multi-source queries and that the resulting subgraphs agree with our intuition. Wall-clock timing results on the DBLP dataset show that our proposed approximation achieve good accuracy for about 6:1 speedup.Propagation of trust and distrusthttp://www.bibsonomy.org/bibtex/28377d56455a2a57ad2802ed4c4e36fbe/mmcglohommcgloho2008-04-17T22:19:13+02:00imported <span style="color:#555555;">R. <a href="http://www.bibsonomy.org/author/Guha">Guha</a> und Ravi <a href="http://www.bibsonomy.org/author/Kumar">Kumar</a> und Prabhakar <a href="http://www.bibsonomy.org/author/Raghavan">Raghavan</a> und Andrew <a href="http://www.bibsonomy.org/author/Tomkins">Tomkins</a> </span><em>WWW '04: Proceedings of the 13th international conference on World Wide Web, </em><em>Seite403--412. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2004</em>)Thu Apr 17 22:19:13 CEST 2008New York, NY, USAWWW '04: Proceedings of the 13th international conference on World Wide Web403--412Propagation of trust and distrust2004imported A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most successful e-commerce and recommendation systems. We develop a framework of trust propagation schemes, each of which may be appropriate in certain circumstances, and evaluate the schemes on a large trust network consisting of 800K trust scores expressed among 130K people. We show that a small number of expressed trusts/distrust per individual allows us to predict trust between any two people in the system with high accuracy. Our work appears to be the first to incorporate distrust in a computational trust propagation setting.Graph structure in the Web, bowtie modelhttp://www.bibsonomy.org/bibtex/24d293a2a2fd3a1de5daf9c6304ed1aae/mmcglohommcgloho2008-04-17T22:14:43+02:00imported <span style="color:#555555;">Andrei <a href="http://www.bibsonomy.org/author/Broder">Broder</a> und Ravi <a href="http://www.bibsonomy.org/author/Kumar">Kumar</a> und Farzin <a href="http://www.bibsonomy.org/author/Maghoul">Maghoul</a> und Prabhakar <a href="http://www.bibsonomy.org/author/Raghavan">Raghavan</a> und Sridhar <a href="http://www.bibsonomy.org/author/Rajagopalan">Rajagopalan</a> und Raymie <a href="http://www.bibsonomy.org/author/Stata">Stata</a> und Andrew <a href="http://www.bibsonomy.org/author/Tomkins">Tomkins</a> und Janet <a href="http://www.bibsonomy.org/author/Wiener">Wiener</a> </span><em>Comput. Netw.</em><em>33(1-6):309--320</em>(<em>2000</em>)Thu Apr 17 22:14:43 CEST 2008New York, NY, USAComput. Netw.1-6309--320Graph structure in the Web332000imported Propagation Models for Trust and Distrust in Social Networkshttp://www.bibsonomy.org/bibtex/2dacd24132be507ae6aed87e778584f2a/mmcglohommcgloho2008-04-17T22:12:32+02:00imported <span style="color:#555555;">Cai-Nicolas <a href="http://www.bibsonomy.org/author/Ziegler">Ziegler</a> und Georg <a href="http://www.bibsonomy.org/author/Lausen">Lausen</a> </span><em>Information Systems Frontiers</em><em>7(4-5):337--358</em>(<em>2005</em>)Thu Apr 17 22:12:32 CEST 2008Hingham, MA, USAInformation Systems Frontiers4-5337--358Propagation Models for Trust and Distrust in Social Networks72005imported connected components, bipartitehttp://www.bibsonomy.org/bibtex/25090526b8f22cc041a047634c6a33e4d/mmcglohommcgloho2008-04-17T22:04:22+02:00imported <span style="color:#555555;">Ravi <a href="http://www.bibsonomy.org/author/Kumar">Kumar</a> und Andrew <a href="http://www.bibsonomy.org/author/Tomkins">Tomkins</a> und Erik <a href="http://www.bibsonomy.org/author/Vee">Vee</a> </span><em>WSDM '08: Proceedings of the international conference on Web search and web data mining, </em><em>Seite129--138. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2008</em>)Thu Apr 17 22:04:22 CEST 2008New York, NY, USAWSDM '08: Proceedings of the international conference on Web search and web data mining129--138Connectivity structure of bipartite graphs via the KNC-plot2008imported defines "thriving", "engagment", others.http://www.bibsonomy.org/bibtex/2d39662a0456998fc722be889fd1cfda4/mmcglohommcgloho2008-04-17T21:23:10+02:00imported <span style="color:#555555;">Lars <a href="http://www.bibsonomy.org/author/Backstrom">Backstrom</a> und Ravi <a href="http://www.bibsonomy.org/author/Kumar">Kumar</a> und Cameron <a href="http://www.bibsonomy.org/author/Marlow">Marlow</a> und Jasmine <a href="http://www.bibsonomy.org/author/Novak">Novak</a> und Andrew <a href="http://www.bibsonomy.org/author/Tomkins">Tomkins</a> </span><em>WSDM '08: Proceedings of the international conference on Web search and web data mining, </em><em>Seite117--128. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2008</em>)Thu Apr 17 21:23:10 CEST 2008New York, NY, USAWSDM '08: Proceedings of the international conference on Web search and web data mining117--128Preferential behavior in online groups2008imported dblp,defines "influence strength" of a tiehttp://www.bibsonomy.org/bibtex/2359bc1ca48bf24290985aca88d9a21d3/mmcglohommcgloho2008-04-17T21:21:37+02:00privacy influence <span style="color:#555555;">Jianming <a href="http://www.bibsonomy.org/author/He">He</a> und Wesley W. <a href="http://www.bibsonomy.org/author/Chu">Chu</a> und Zhenyu <a href="http://www.bibsonomy.org/author/Liu">Liu</a> </span><em>ISI, </em><em>Volume3975vonLecture Notes in Computer Science, </em><em>Seite154-165. </em><em>Springer, </em>(<em>2006</em>)Thu Apr 17 21:21:37 CEST 2008ISIconf/isi/2006154-165Lecture Notes in Computer ScienceInferring Privacy Information from Social Networks.39752006privacy influence