@inproceedings{scholz2013people, author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd}, booktitle = {ASONAM}, interhash = {8b6051b794789000c4baa5ab059fab18}, intrahash = {bf958ff2b11df1d9d15d9287ea07a5c9}, title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks}, year = 2013 } @inproceedings{scholz2013people, abstract = {Understanding the process of link creation is rather important for link prediction in social networks. Therefore, this paper analyzes contact structures in networks of face-to-face spatial proximity, and presents new insights on the dynamic and static contact behavior in such real world networks. We focus on face-to-face contact networks collected at different conferences using the social conference guidance system Conferator. Specifically, we investigate the strength of ties and its connection to triadic closures in face-to-face proximity networks. Furthermore, we analyze the predictability of all, new and recurring links at different points of time during the conference. In addition, we consider network dynamics for the prediction of new links.}, address = {Los Alamitos, CA, USA}, author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd}, booktitle = {Advances in Social Networks Analysis and Mining (ASONAM), 2013 International Conference on}, interhash = {8b6051b794789000c4baa5ab059fab18}, intrahash = {15cbb7f4dbbb8bc6ee9b7a2bf666f032}, title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks}, year = 2013 } @inproceedings{christophscholzandmartinatzmuellerandalainbarratandcirocattutoandgerdstumme2013insights, address = {Palo Alto, CA, USA}, author = {{Christoph Scholz and Martin Atzmueller and Alain Barrat and Ciro Cattuto and Gerd Stumme}}, booktitle = {Proc. 7th Intl. AAAI Conference on Weblogs and Social Media}, interhash = {18e166abcc948c86d6d4e9de9b204760}, intrahash = {3dce3522e260238f2a8e802b52096cb7}, optpages = {To appear}, publisher = {AAAI Press}, title = {{New Insights and Methods For Predicting Face-To-Face Contacts}}, year = 2013 } @inproceedings{takahashi2011evaluating, abstract = {We propose a method to evaluate the significance of historical entities (people, events, and so on.). Here, the significance of a historical entity means how it affected other historical entities. Our proposed method first calculates the tempo-spacial impact of historical entities. The impact of a historical entity varies according to time and location. Historical entities are collected from Wikipedia. We assume that a Wikipedia link between historical entities represents an impact propagation. That is, when an entity has a link to another entity, we regard the former is influenced by the latter. Historical entities in Wikipedia usually have the date and location of their occurrence. Our proposed iteration algorithm propagates such initial tempo-spacial information through links in the similar manner as PageRank, so the tempo-spacial impact scores of all the historical entities can be calculated. We assume that a historical entity is significant if it influences many other entities that are far from it temporally or geographically. We demonstrate a prototype system and show the results of experiments that prove the effectiveness of our method.}, acmid = {1995980}, address = {New York, NY, USA}, author = {Takahashi, Yuku and Ohshima, Hiroaki and Yamamoto, Mitsuo and Iwasaki, Hirotoshi and Oyama, Satoshi and Tanaka, Katsumi}, booktitle = {Proceedings of the 22nd ACM conference on Hypertext and hypermedia}, doi = {10.1145/1995966.1995980}, interhash = {6665836546bedb1ee5d56a4d16a0848e}, intrahash = {e4769d86e71c9e7ba77d5d4af6f21e0c}, isbn = {978-1-4503-0256-2}, location = {Eindhoven, The Netherlands}, numpages = {10}, pages = {83--92}, publisher = {ACM}, title = {Evaluating significance of historical entities based on tempo-spatial impacts analysis using Wikipedia link structure}, url = {http://doi.acm.org/10.1145/1995966.1995980}, year = 2011 } @inproceedings{ollivier2007finding, abstract = {We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, adjustment-free and easy to implement. We test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. We present an extensive comparative study of the performance of our method versus several other classical methods in the case of Wikipedia. The Green method is found to have both the best average results and the best robustness.}, acmid = {1619874}, author = {Ollivier, Yann and Senellart, Pierre}, booktitle = {Proceedings of the 22nd national conference on Artificial intelligence}, interhash = {a291b1b4e195dd09a11c8ffe329fc0e5}, intrahash = {76e219fe6e8a257b30c6665af8b273da}, isbn = {978-1-57735-323-2}, location = {Vancouver, British Columbia, Canada}, numpages = {7}, pages = {1427--1433}, publisher = {AAAI Press}, title = {Finding related pages using Green measures: an illustration with Wikipedia}, url = {http://dl.acm.org/citation.cfm?id=1619797.1619874}, volume = 2, year = 2007 } @inproceedings{chung2009study, abstract = {In this paper, we study the overall link-based spam structure and its evolution which would be helpful for the development of robust analysis tools and research for Web spamming as a social activity in the cyber space. First, we use strongly connected component (SCC) decomposition to separate many link farms from the largest SCC, so called the core. We show that denser link farms in the core can be extracted by node filtering and recursive application of SCC decomposition to the core. Surprisingly, we can find new large link farms during each iteration and this trend continues until at least 10 iterations. In addition, we measure the spamicity of such link farms. Next, the evolution of link farms is examined over two years. Results show that almost all large link farms do not grow anymore while some of them shrink, and many large link farms are created in one year.}, acmid = {1531917}, address = {New York, NY, USA}, author = {Chung, Young-joo and Toyoda, Masashi and Kitsuregawa, Masaru}, booktitle = {Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web}, doi = {10.1145/1531914.1531917}, interhash = {1a0eff19d17ebb60bcbc4f7c6ccc460a}, intrahash = {d36b62eab48a830b4ac9da825a4929a5}, isbn = {978-1-60558-438-6}, location = {Madrid, Spain}, numpages = {8}, pages = {9--16}, publisher = {ACM}, title = {A study of link farm distribution and evolution using a time series of web snapshots}, url = {http://doi.acm.org/10.1145/1531914.1531917}, year = 2009 } @inproceedings{milne2008learning, abstract = {This paper describes how to automatically cross-reference documents with Wikipedia: the largest knowledge base ever known. It explains how machine learning can be used to identify significant terms within unstructured text, and enrich it with links to the appropriate Wikipedia articles. The resulting link detector and disambiguator performs very well, with recall and precision of almost 75%. This performance is constant whether the system is evaluated on Wikipedia articles or "real world" documents.

This work has implications far beyond enriching documents with explanatory links. It can provide structured knowledge about any unstructured fragment of text. Any task that is currently addressed with bags of words - indexing, clustering, retrieval, and summarization to name a few - could use the techniques described here to draw on a vast network of concepts and semantics.}, address = {New York, NY, USA}, author = {Milne, David and Witten, Ian H.}, booktitle = {Proceedings of the 17th ACM conference on Information and knowledge management}, doi = {10.1145/1458082.1458150}, interhash = {44159e289485110212602792e72bbd74}, intrahash = {fd9cd6bbf302731d5af3f6e748cdb359}, isbn = {978-1-59593-991-3}, location = {Napa Valley, California, USA}, pages = {509--518}, publisher = {ACM}, title = {Learning to link with wikipedia}, url = {http://doi.acm.org/10.1145/1458082.1458150}, year = 2008 } @article{yong2001lattices, abstract = {The main purposes of this article are to uncover interesting features in real-world citationnetworks, and to highlight important substructures. In particular, it applies lattice theory tocitation analysis. On the applied side, it shows that lattice substructures exist in real-word citationnetworks. It is further shown that, through its relations with co-citations and bibliographiccoupling, the diamond (a four-element lattice) is a basic structural element in citation analysis.Finally, citation compactness is calculated for the four- and five element lattices. }, author = {Yong, Fang and Rousseau, Ronald}, doi = {10.1023/A:1010573723540}, interhash = {e9391bc849fa1c37c94f123a42cce4f3}, intrahash = {3e02f4c97f1e075cb05e13c235cfd875}, issn = {0138-9130}, journal = {Scientometrics}, month = feb, number = 2, pages = {273--287}, title = {Lattices in citation networks: An investigation into the structure of citation graphs}, url = {http://dx.doi.org/10.1023/A:1010573723540}, volume = 50, year = 2001 } @article{balaban2006chemistry, abstract = {According to a widely used introductory chemistry text by T. E. Brown et al., 1 chemistry is 'The Central Science'. But scientometric co-citation analyses indicate that biochemistry seems presently to be more interconnected to other sciences. On the other hand, mathematics is considered by many to permeate all sciences and hence might compete as the choice for centrality. A critical commentary and argument leads to a proposal for an alternative partially ordered hierarchical “framework” map of sciences. This argument is supplemented by a scientometric approach based on university course requirements for different curricula, so as to support our partially ordered map. This alternative “framework” mapping then is seen to indicate a special position for chemistry, as where significant branching begins.}, author = {Balaban, Alexandru T. and Klein, Douglas J.}, doi = {10.1007/s11192-006-0173-2}, interhash = {ca0839eeff9767f2b83c40ad5e8b7cd5}, intrahash = {8fbca6d9ffbe8cbc646089b423c0c84c}, issn = {0138-9130}, journal = {Scientometrics}, month = dec, number = 3, pages = {615--637}, title = {Is chemistry 'The Central Science'? How are different sciences related? Co-citations, reductionism, emergence, and posets}, url = {http://dx.doi.org/10.1007/s11192-006-0173-2}, volume = 69, year = 2006 } @article{trofimenko1987scientometric, abstract = {A new method for author groups formation and decay processes is proposed. With the help of a special mathematical model time distribution of authors and their publications was established and group productivity, composition and stability, annual change of the total number of short-term and long-term authors, their renovation etc. as well as the time dependence of these quantities was determined. Particularities of activity of authors working in nuclear physics are investigated. It is shown that the most rapid development in this field took place in the pre-war years, it was at high level up to 1960 and then began to decrease. The method used permits to forecast the development of science and to analyse the activity of author units in particular scientific centers.}, author = {Trofimenko, A.}, doi = {10.1007/BF02016594}, interhash = {70ef7d29ceb3d0e9d7f83107562ea71e}, intrahash = {e9202505e95c9bb8ff47838b55a28db4}, issn = {0138-9130}, journal = {Scientometrics}, month = mar, number = 3, pages = {231--250}, title = {Scientometric analysis of the development of nuclear physics during the last 50 years}, url = {http://dx.doi.org/10.1007/BF02016594}, volume = 11, year = 1987 } @article{schifanella2010folks, author = {Schifanella, R. and Barrat, A. and Cattuto, C. and Markines, B. and Menczer, F.}, interhash = {4af819bc8d669b827b8e50017fcb1744}, intrahash = {5fd8eceb8d057d1379f862613937a2d7}, title = {{Folks in folksonomies: Social link prediction from shared metadata}}, url = {http://scholar.google.de/scholar.bib?q=info:5fwGHbzyqVgJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, year = 2010 } @article{lerman2006social, author = {Lerman, K. and Jones, L.}, interhash = {ca87d38a2278011eea5cd7faefd0f2df}, intrahash = {31208c29afdd24b49b0dd290821b0fa0}, journal = {Arxiv preprint cs/0612047}, title = {{Social browsing on flickr}}, url = {http://scholar.google.de/scholar.bib?q=info:4ZJ0zK6yr5wJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, year = 2006 } @article{van2007flickr, author = {Zwol, R. Van}, booktitle = {Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence}, interhash = {89958ed878553631a54fe0b6a1955d16}, intrahash = {5aa097876f3069019e4ea74380b42ed8}, organization = {IEEE Computer Society}, pages = {184--190}, title = {{Flickr: Who is Looking?}}, url = {http://scholar.google.de/scholar.bib?q=info:YMoA8DCZLoMJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=5}, year = 2007 } @article{prieur2007strength, author = {Prieur, C. and Cardon, D. and Beuscart, J.S. and Pissard, N. and Pons, P.}, interhash = {486a4d487adaaef47526fac1d2348398}, intrahash = {df8ea0dfb666d1580a58e0ae2e90ea14}, journal = {h http://arxiv. org/ftp/arxiv/papers/0802/0802.2317. pdf}, title = {{The strength of weak cooperation: A case study on Flickr}}, url = {http://scholar.google.de/scholar.bib?q=info:2JNrrjb49XMJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=1}, year = 2007 } @article{santos2009individual, author = {Santos-Neto, E. and Condon, D. and Andrade, N. and Iamnitchi, A. and Ripeanu, M.}, booktitle = {Proceedings of the 20th ACM conference on Hypertext and hypermedia}, interhash = {07a2f583edf181046a997bc59e7e56be}, intrahash = {75da6d18a60db6c69d4f3cd2328abd58}, organization = {ACM}, pages = {183--192}, title = {{Individual and social behavior in tagging systems}}, url = {http://scholar.google.de/scholar.bib?q=info:78ozoF5AkegJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, year = 2009 } @article{mislove2007measurement, author = {Mislove, A. and Marcon, M. and Gummadi, K.P. and Druschel, P. and Bhattacharjee, B.}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, interhash = {cb29c839ea0b125778ae58934f35082f}, intrahash = {aa568938d581a2885e7898e4852ee62f}, organization = {ACM}, pages = 42, title = {{Measurement and analysis of online social networks}}, url = {http://scholar.google.de/scholar.bib?q=info:HmucgVkM3hQJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, year = 2007 } @article{menczer2004lexical, author = {Menczer, F.}, interhash = {fc9deff63fcbfcf113e880fad70d58a1}, intrahash = {4c5ee73ae6eceab49b040bb63deae554}, journal = {Journal of the American Society for Information Science and Technology}, number = 14, pages = {1261--1269}, publisher = {Citeseer}, title = {{Lexical and semantic clustering by web links}}, url = {http://scholar.google.de/scholar.bib?q=info:qmPuziT0_h0J:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, volume = 55, year = 2004 } @inproceedings{1150476, abstract = {In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess of five million people and ten million friendship links, annotated with metadata capturing the time of every event in the life of the network. Our measurements expose a surprising segmentation of these networks into three regions: singletons who do not participate in the network; isolated communities which overwhelmingly display star structure; and a giant component anchored by a well-connected core region which persists even in the absence of stars.We present a simple model of network growth which captures these aspects of component structure. The model follows our experimental results, characterizing users as either passive members of the network; inviters who encourage offline friends and acquaintances to migrate online; and linkers who fully participate in the social evolution of the network.}, address = {New York, NY, USA}, author = {Kumar, Ravi and Novak, Jasmine and Tomkins, Andrew}, booktitle = {KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining}, doi = {http://doi.acm.org/10.1145/1150402.1150476}, interhash = {d3729a29d377e03b31c80bcc58843681}, intrahash = {03874e666c56f22bce1b7db254420d77}, isbn = {1-59593-339-5}, location = {Philadelphia, PA, USA}, pages = {611--617}, publisher = {ACM}, title = {Structure and evolution of online social networks}, url = {http://portal.acm.org/citation.cfm?id=1150402.1150476}, year = 2006 } @article{vázquez2002large, author = {V{\'a}zquez, A. and Pastor-Satorras, R. and Vespignani, A.}, interhash = {dbdca844dcfdba3b38f5474ffd35c501}, intrahash = {021f68af4cda4f9ec4abe10b75e93616}, journal = {Physical Review E}, number = 6, pages = 66130, publisher = {APS}, title = {{Large-scale topological and dynamical properties of the Internet}}, url = {http://scholar.google.de/scholar.bib?q=info:sEuhI6oKjFoJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}, volume = 65, year = 2002 } @inproceedings{morishima2009bringing, abstract = {This paper presents an experimental study of the automatic correction of broken (dead) Web links focusing, in particular, on links broken by the relocation of Web pages. Our first contribution is that we developed an algorithm that incorporates a comprehensive set of heuristics, some of which are novel, in a single unified framework. The second contribution is that we conducted a relatively large-scale experiment, and analysis of our results revealed the characteristics of the problem of finding moved Web pages. We demonstrated empirically that the problem of searching for moved pages is different from typical information retrieval problems. First, it is impossible to identify the final destination until the page is moved, so the index-server approach is not necessarily effective. Secondly, there is a large bias about where the new address is likely to be and crawler-based solutions can be effectively implemented, avoiding the need to search the entire Web. We analyzed the experimental results in detail to show how important each heuristic is in real Web settings, and conducted statistical analyses to show that our algorithm succeeds in correctly finding new links for more than 70% of broken links at 95% confidence level.}, address = {New York, NY, USA}, author = {Morishima, Atsuyuki and Nakamizo, Akiyoshi and Iida, Toshinari and Sugimoto, Shigeo and Kitagawa, Hiroyuki}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {4ee86291d78698b239edee7c54f967fe}, intrahash = {73faf07a4750d730ce0455e5613b8687}, month = {July}, paperid = {fp038}, publisher = {ACM}, session = {Full Paper}, title = {Bringing Your Dead Links Back to Life: A Comprehensive Approach and Lessons Learned}, year = 2009 }