@inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, file = {benz2009managing.pdf:benz2009managing.pdf:PDF}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/benz2009managing.pdf}, year = 2009 } @inproceedings{murata2009modularities, abstract = {Real-world relations are often represented as bipartite networks, such as paper-author networks and event-attendee networks. Extracting dense subnetworks (communities) from bipartite networks and evaluating their qualities are practically important research topics. As the attempts for evaluating divisions of bipartite networks, Guimera and Barber propose bipartite modularities. This paper discusses the properties of these bipartite modularities and proposes another bipartite modularity that allows one-to-many correspondence of communities of different vertex types. Preliminary experimental results for the bipartite modularities are also described.}, address = {New York, NY, USA}, author = {Murata, Tsuyoshi}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {bddb9e340acd0bac21db3e4e9b682c40}, intrahash = {97afe0650338d114c45a8b7f33eeeda3}, month = {July}, paperid = {sp25}, publisher = {ACM}, session = {Short Paper}, title = {Modularities for Bipartite Networks}, year = 2009 } @inproceedings{loreto2009tagging, address = {New York, NY, USA}, author = {Loreto, Vittorio and Capocci, Andrea}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {6f2ba9f38788a3b544fb5620813329a0}, intrahash = {1ec9c6b266af3bd0ce0c67f6f38983dd}, month = {July}, paperid = {w4tag}, publisher = {ACM}, session = {Workshop}, title = {Tagging Dynamics in Online Communities}, year = 2009 } @inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, file = {benz2009managing.pdf:benz2009managing.pdf:PDF}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/benz2009managing.pdf}, year = 2009 } @inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://portal.acm.org/citation.cfm?doid=1557914.1557969#}, year = 2009 } @inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://portal.acm.org/citation.cfm?doid=1557914.1557969#}, year = 2009 } @inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://portal.acm.org/citation.cfm?doid=1557914.1557969#}, year = 2009 } @inproceedings{benz2009managing, abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.}, address = {New York, NY, USA}, author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia}, doi = {10.1145/1557914.1557969}, editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo}, interhash = {aa341801cf9a31d963fccb8a331043dc}, intrahash = {99cafad8ce2afb5879c6c85c14cc5259}, isbn = {978-1-60558-486-7}, month = jun, pages = {323--324}, publisher = {ACM}, title = {Managing publications and bookmarks with BibSonomy}, url = {http://portal.acm.org/citation.cfm?doid=1557914.1557969#}, year = 2009 } @inproceedings{amitay2009social, abstract = {This research explores new ways to augment the search and discovery of relations between Web 2.0 entities using multiple types and sources of social information. Our goal is to allow the search for all object types such as documents, persons and tags, while retrieving related objects of all types. We implemented a social-search engine using a unified approach, where the search space is expanded to represent heterogeneous information objects that are interrelated by several relation types. Our solution is based on multifaceted search, which provides an efficient update mechanism for relations between objects, as well as efficient search over the heterogeneous data. We describe a social search engine positioned within a large enterprise, applied over social data gathered from several Web 2.0 applications. We conducted a large user study with over 600 people to evaluate the contribution of social data for search. Our results demonstrate the high precision of social search results and confirm the strong relationship of users and tags to the topics retrieved.}, address = {New York, NY, USA}, author = {Amitay, Einat and Carmel, David and Hare'l, Nadav and Ofek-Koifman, Shila and Soffer, Aya and Yogev, Sivan and Golbandi, Nadav}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {281a60dff0722e89bd0de3abe2e44545}, intrahash = {5f616365d0576f71e6e9225628acf57b}, month = {July}, paperid = {fp020}, publisher = {ACM}, session = {Full Paper}, title = {Social Search and Discovery Using a Unified Approach}, year = 2009 } @inproceedings{abel2009contextbased, abstract = {With the advent of Web 2.0 tagging became a popular feature. People tag diverse kinds of content, e.g. products at Amazon, music at Last.fm, images at Flickr, etc. Clicking on a tag enables the users to explore related content. In this paper we investigate how such tag-based queries, initialized by the clicking activity, can be enhanced with automatically produced contextual information so that the search result better fits to the actual aims of the user. We introduce the SocialHITS algorithm and present an experiment where we compare different algorithms for ranking users, tags, and resources in a contextualized way.}, address = {New York, NY, USA}, author = {Abel, Fabian and Baldoni, Matteo and Baroglio, Cristina and Henze, Nicola and Krause, Daniel and Patti, Viviana}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {0e0dff0c21fd77d2d1f0224317c4974f}, intrahash = {17d5c35426963e20875ec1dc42913855}, month = {July}, paperid = {fp060}, publisher = {ACM}, session = {Full Paper}, title = {Context-based Ranking in Folksonomies}, year = 2009 } @inproceedings{mahmood2009improving, abstract = {Conversational recommender systems (CRSs) assist online users in their information-seeking and decision making tasks by supporting an interactive process. Although these processes could be rather diverse, CRSs typically follow a fixed strategy, e.g., based on critiquing or on iterative query reformulation. In a previous paper, we proposed a novel recommendation model that allows conversational systems to autonomously improve a fixed strategy and eventually learn a better one using reinforcement learning techniques. This strategy is optimal for the given model of the interaction and it is adapted to the users' behaviors. In this paper we validate our approach in an online CRS by means of a user study involving several hundreds of testers. We show that the optimal strategy is different from the fixed one, and supports more effective and efficient interaction sessions. }, address = {New York, NY, USA}, author = {Mahmood, Tariq and Ricci, Francesco}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {8b66c6c4995ed720d1b6b0029cbb36c9}, intrahash = {bb62dd3f330240a0f0adc4c12d5c5699}, month = {July}, paperid = {fp021}, publisher = {ACM}, session = {Full Paper}, title = {Improving Recommender Systems with Adaptive Conversational Strategies}, year = 2009 } @inproceedings{1557916, address = {New York, NY, USA}, author = {Adamic, Lada A.}, booktitle = {HT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia}, doi = {http://doi.acm.org/10.1145/1557914.1557916}, interhash = {8a2fa27419889ca79b1bc7c1812031d2}, intrahash = {e0f0c03d5420b30d4cb9673b6b7b288d}, isbn = {978-1-60558-486-7}, location = {Torino, Italy}, pages = {1--2}, publisher = {ACM}, title = {The social hyperlink}, url = {http://portal.acm.org/citation.cfm?id=1557914.1557916&coll=portal&dl=acm&type=series&idx=SERIES399&part=series&WantType=Proceedings&title=HT&CFID=://www.bibsonomy.org/user/hotho/ht09&CFTOKEN=www.bibsonomy.org/user/hotho/ht09}, year = 2009 } @inproceedings{siersdorfer2009social, abstract = {The rapidly increasing popularity of Web 2.0 knowledge and content sharing systems and growing amount of shared data make discovering relevant content and finding contacts a difficult enterprize. Typically, folksonomies provide a rich set of structures and social relationships that can be mined for a variety of recommendation purposes. In this paper we propose a formal model to characterize users, items, and annotations in Web 2.0 environments. Our objective is to construct social recommender systems that predict the utility of items, users, or groups based on the multi-dimensional social environment of a given user. Based on this model we introduce recommendation mechanisms for content sharing frameworks. Our comprehensive evaluation shows the viability of our approach and emphasizes the key role of social meta knowledge for constructing effective recommendations in Web 2.0 applications.}, address = {New York, NY, USA}, author = {Siersdorfer, Stefan and Sizov, Sergej}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {9245d0a556113aa107ba8171f3897156}, intrahash = {bbf0c98e0ab32612109e6688de81c432}, month = {July}, paperid = {fp091}, publisher = {ACM}, session = {Full Paper}, title = {Social Recommender Systems for Web 2.0 Folksonomies}, year = 2009 } @inproceedings{bollen2009suggestions, abstract = {Most tagging systems support the user in the tag selection process by providing tag suggestions, or recommendations, based on a popularity measurement of tags other users provided when tagging the same resource. The majority of theories and mathematical models of tagging found in the literature assume that the emergence of power laws in tagging systems is mainly driven by the imitation behavior of users when observing tag suggestions provided by the user interface of the tagging system. We present experimental results that show that the power law distribution forms regardless of whether or not tag suggestions are presented to the users.}, address = {New York, NY, USA}, author = {Bollen, Dirk and Halpin, Harry}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {280a97ee745f4e0409cf031a1b7ea247}, intrahash = {d7b14a0eb7fabb3cee8846802de069fe}, month = {July}, paperid = {pp161}, publisher = {ACM}, session = {Poster}, title = {The Role of Tag Suggestions in Folksonomies}, year = 2009 } @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 } @inproceedings{bollen2009suggestions, abstract = {Most tagging systems support the user in the tag selection process by providing tag suggestions, or recommendations, based on a popularity measurement of tags other users provided when tagging the same resource. The majority of theories and mathematical models of tagging found in the literature assume that the emergence of power laws in tagging systems is mainly driven by the imitation behavior of users when observing tag suggestions provided by the user interface of the tagging system. We present experimental results that show that the power law distribution forms regardless of whether or not tag suggestions are presented to the users.}, address = {New York, NY, USA}, author = {Bollen, Dirk and Halpin, Harry}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {280a97ee745f4e0409cf031a1b7ea247}, intrahash = {d7b14a0eb7fabb3cee8846802de069fe}, month = {July}, paperid = {pp161}, publisher = {ACM}, session = {Poster}, title = {The Role of Tag Suggestions in Folksonomies}, year = 2009 } @inproceedings{loreto2009tagging, address = {New York, NY, USA}, author = {Loreto, Vittorio and Capocci, Andrea}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {6f2ba9f38788a3b544fb5620813329a0}, intrahash = {1ec9c6b266af3bd0ce0c67f6f38983dd}, month = {July}, paperid = {w4tag}, publisher = {ACM}, session = {Workshop}, title = {Tagging Dynamics in Online Communities}, year = 2009 } @inproceedings{neubauer2009hyperincident, abstract = {Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components, m-hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection. }, address = {New York, NY, USA}, author = {Neubauer, Nicolas and Obermayer, Klaus}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {2686bad7ff1f4d07c0b3302dff08368a}, intrahash = {f696989e22dd4c77c8a6352526e13efe}, month = {July}, paperid = {fp105}, publisher = {ACM}, session = {Full Paper}, title = {Hyperincident Connected Components of Tagging Networks}, year = 2009 } @inproceedings{neubauer2009hyperincident, abstract = {Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components, m-hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection. }, address = {New York, NY, USA}, author = {Neubauer, Nicolas and Obermayer, Klaus}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {2686bad7ff1f4d07c0b3302dff08368a}, intrahash = {f696989e22dd4c77c8a6352526e13efe}, month = {July}, paperid = {fp105}, publisher = {ACM}, session = {Full Paper}, title = {Hyperincident Connected Components of Tagging Networks}, year = 2009 }