@book{atzmueller2013ubiquitous, address = {Berlin, Heidelberg}, editor = {Atzmueller, Martin and Chin, Alvin and Helic, Denis and Hotho, Andreas}, interhash = {b0fcec93b875c8b0060087bc07944e89}, intrahash = {1e2d036351662d35ef95719554d37e46}, isbn = {9783642453915 3642453910 9783642453922 3642453929}, publisher = {Imprint: Springer}, refid = {867052137}, title = {Ubiquitous Social Media Analysis Third International Workshops, MUSE 2012, Bristol, UK, September 24, 2012, and MSM 2012, Milwaukee, WI, USA, June 25, 2012, Revised Selected Papers}, url = {http://link.springer.com/book/10.1007/978-3-642-45392-2}, year = 2013 } @article{pham2011development, abstract = {In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.}, address = {Wien}, affiliation = {Information Systems and Database Technology, RWTH Aachen University, Aachen, Ahornstr. 55, 52056 Aachen, Germany}, author = {Pham, Manh and Klamma, Ralf and Jarke, Matthias}, doi = {10.1007/s13278-011-0024-x}, interhash = {193312234ed176aa8be9f35d4d1c4e72}, intrahash = {8ae08cacda75da80bfa5604cfce48449}, issn = {1869-5450}, journal = {Social Network Analysis and Mining}, keyword = {Computer Science}, number = 4, pages = {321--340}, publisher = {Springer}, title = {Development of computer science disciplines: a social network analysis approach}, url = {http://dx.doi.org/10.1007/s13278-011-0024-x}, volume = 1, year = 2011 } @proceedings{conf/ht/2010msmmuse, booktitle = {MSM/MUSE}, editor = {Atzmueller, Martin and Hotho, Andreas and Strohmaier, Markus and Chin, Alvin}, ee = {http://dx.doi.org/10.1007/978-3-642-23599-3}, interhash = {2be9c4f31fd94e24d902520195b653d3}, intrahash = {4cf42ebabd9a670c70bee456affda285}, isbn = {978-3-642-23598-6}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Analysis of Social Media and Ubiquitous Data - International Workshops MSM 2010, Toronto, Canada, June 13, 2010, and MUSE 2010, Barcelona, Spain, September 20, 2010, Revised Selected Papers}, url = {http://dblp.uni-trier.de/db/conf/ht/msmmuse2010.html}, volume = 6904, year = 2011 } @inproceedings{eisterlehner2010visit, address = {Toronto, Canada}, author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas}, booktitle = {Proceedings of the 21st ACM conference on Hypertext and hypermedia}, interhash = {5584c4c57fcd8eb4663df8b114bcf09c}, intrahash = {a97c4f7e80dcb666450acf697002155e}, title = {Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy}, year = 2010 } @misc{Kitsak2010, abstract = { Networks portray a multitude of interactions through which people meet, ideas are spread, and infectious diseases propagate within a society. Identifying the most efficient "spreaders" in a network is an important step to optimize the use of available resources and ensure the more efficient spread of information. Here we show that, in contrast to common belief, the most influential spreaders in a social network do not correspond to the best connected people or to the most central people (high betweenness centrality). Instead, we find: (i) The most efficient spreaders are those located within the core of the network as identified by the k-shell decomposition analysis. (ii) When multiple spreaders are considered simultaneously, the distance between them becomes the crucial parameter that determines the extend of the spreading. Furthermore, we find that-- in the case of infections that do not confer immunity on recovered individuals-- the infection persists in the high k-shell layers of the network under conditions where hubs may not be able to preserve the infection. Our analysis provides a plausible route for an optimal design of efficient dissemination strategies. }, author = {Kitsak, Maksim and Gallos, Lazaros K. and Havlin, Shlomo and Liljeros, Fredrik and Muchnik, Lev and Stanley, H. Eugene and Makse, Hernan A.}, interhash = {9545e268e6074cf2edc21693e7bb1b04}, intrahash = {18a1220e45e38620051a0c9b854d1a28}, note = {cite arxiv:1001.5285 Comment: 31 pages, 12 figures}, title = {Identifying influential spreaders in complex networks}, url = {http://arxiv.org/abs/1001.5285}, year = 2010 }