BibSonomy publications for /tag/ht09Thu Mar 03 16:23:32 CET 2011New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy20092009 bibsonomy bookmarks ht09 managing publications social-bookmarking In this demo we present BibSonomy, a social bookmark and publication sharing system.Fri Jan 28 16:26:44 CET 2011New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy2009web20 ht09 2009 social-bookmarking social-software bibsonomy myown itegpub In this demo we present BibSonomy, a social bookmark and publication sharing system.Fri Jan 28 11:33:44 CET 2011New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyTagging Dynamics in Online Communities2009ht09 tagging dynamics Fri Jan 28 11:33:43 CET 2011New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyModularities for Bipartite Networks2009ht09 graph bipartite 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.Mon Nov 08 11:51:13 CET 2010New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy20092009 BibSonomy bookmark ht09 managing publications social-bookmarking In this demo we present BibSonomy, a social bookmark and publication sharing system.Wed Jan 13 10:08:44 CET 2010New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulySocial Search and Discovery Using a Unified Approach2009IBM bookmarking ht09 intranet search social tagging web web2.0 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.Thu Oct 15 15:28:16 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy20092009 bibsonomy demo ht09 myown In this demo we present BibSonomy, a social bookmark and publication sharing system.Sun Sep 27 19:50:19 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy20092009 bibsonomy ht09 myown In this demo we present BibSonomy, a social bookmark and publication sharing system.Fri Sep 25 21:58:12 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermediajun323--324Managing publications and bookmarks with BibSonomy20092009 bibsonomy ht09 l3s myown In this demo we present BibSonomy, a social bookmark and publication sharing system.Thu Aug 06 18:06:32 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyTagging Dynamics in Online Communities2009dynamics ht09 semiotics tagging Thu Aug 06 12:13:30 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyIncentives for Social Annotation2009folksonomy game givealink ht09 incentive tagging Researchers are exploring the use of folksonomies, such as in social bookmarking systems, to build implicit links between online resources. Users create and reinforce links between resources through applying a common tag to those resources. The effectiveness of using such community-driven annotation depends on user participation to provide the critical information. However, the participation of many users is motivated by selfish reasons. An effective way to encourage these users is to create useful or entertaining applications. We demo two such tools -- a browser extension for bookmark management and navigation and a game.Thu Aug 06 12:11:53 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyThe Role of Tag Suggestions in Folksonomies2009folksonomy ht09 powerlaw recommender tag tagging 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.Wed Jul 01 13:32:54 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyHyperincident Connected Components of Tagging Networks2009analysis ht09 network spam tagging 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. Wed Jul 01 11:57:35 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyRelating Web Pages to Enable Information-Gathering Tasks2009authorities ht09 similarity We argue that relationships between Web pages are functions of the user's intent. We identify a class of Web tasks - information-gathering - that can be facilitated by providing links to pages related to the page the user is currently viewing. We define three kinds of intentional relationships that correspond to whether the user is a) seeking sources of information, b) reading pages which provide information, or c) surfing through pages as part of an extended information-gathering process. We show that these three relationships can be mined using a combination of textual and link information and provide three scoring mechanisms that correspond to them: {\em SeekRel}, {\em FactRel} and {\em SurfRel}. These scoring mechanisms incorporate both textual and link information. We build a set of capacitated subnetworks, each corresponding to a particular keyword. Scores are computed by computing flows on these subnetworks. The capacities of the links are derived from the {\em hub} and {\em authority} values of the nodes they connect, following the work of Kleinberg (1998) on assigning authority to pages in hyperlinked environments. We evaluated our scoring mechanism by running experiments on four data sets taken from the Web. We present user evaluations of the relevance of the top results returned by our scoring mechanisms and compare those to the top results returned by Google's Similar Pages feature, and the {\em Companion} algorithm (Dean and Henzinger, 1999).Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia15--24Bringing your dead links back to life: a comprehensive approach and lessons learned2009deal-link ht09 www This paper presents an experimental study of the automatic correction of broken (dead) Web links focusing, in particular, on links broken by the relocation ofWeb 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 movedWeb 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.Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia5--14On hypertext narrative2009ht09 stretchtext Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. In place of a simple chronological list, narrative instead organizes our account in new sequences in order to illuminate the interplay of actors and events. We want hypertext narrative to do things we cannot achieve in print; though we may occasionally use links to introduce variation in presentation or in story ; it is now clear that hypertext will most frequently prove useful in changing (or adapting) plot . After discussing the ways in which plot may be varied, I describe the use of stretchtext as a reaction against the perceived incoherence of classic hypertext narrative, demonstrate the limitations that conventional stretchtext necessarily imposes on hypertext narrative, and describe an implemented generalization of stretchtext that matches the expressive and formal capabilities of classical hypertext systems while appearing to be a mere stretchtext and while running within the confines of a Web browser.Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia25--34The dynamics of personal territories on the web2009empirical-study ht09 www In this paper, we present a long-term study of user-centric Web traffic data collected in 2000-2002 and 2005-2006 from two large representative panels of French Internet users. Our work focuses on the dynamics of personal territories on the Web and their evolution between 2000 and 2006. At the session level, we distinguish four profiles of browsing dynamics in 2005-2006, and point out the growing dichotomy between straight routine sessions and exploratory browsing. At a global level, we observe that although each individual's corpus of visited sites is permanently growing, his browsing practices are structured around routine well-known sites which operate as links providers to new sites. We argue that this tension between the known and the unknown is constitutive of Web practices and is a fundamental property of personal Web territories.Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia51--56Towards a constructivist approach to learning from hypertext2009concept-net e-learning ht09 knowledge-construction knowledge-organization spatial-hypertext superimposed-information How to help learners construct knowledge from hypertext and plan a navigation process on the Web are important issues in Web based learning. To provide solutions to these issues, this paper presents Knowledge Puzzle, a tool for knowledge construction from the Web. Its main contribution to Web-based learning is the personalization of information structure on the Web to cope with the knowledge structure in the learner's mind. Self-directed learners will be able to adapt the path of instruction on the Web to their way of thinking, regardless of how the Web content is delivered. The way to achieve that is to provide learners with a meta-cognitive tool that enables them to bring knowledge gained from the Web to the surface and visualize what they have in mind. Once we get the learner's viewpoint externalized, it will be converted to a hypermedia layer that will be laid over the Web pages visited by the learner. The attached layer adapts the views of Web pages to the learner's information needs by associating information pieces that are not already linked in hyperspace and attaching the learner's notes to the page content. Finally, a hypertext version of the whole constructed knowledge is produced to enable fast and easy reviewing.Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia35--44HyperSea: towards a spatial hypertext environment for web 2.0 content2009ht09 social-web spatial-hypertext In this paper, we present HyperSea, an environment for importing, organizing and interacting with web 2.0 content. The environment is based mainly on previous research on hypertext systems, spatial hypertext and it tries to overcome presentation limitations of today's popular web 2.0 applications. Content is structured as islands and nodes which may be interlinked and characterized by various levels of visual cues, according to its type and origin. As the resulting content is structured, HyperSea may support alternative views and search operations over it. We present an extensive case-study for illustrating functionality and we organize some future work.Wed Jul 01 11:12:30 CEST 2009New York, NY, USAHT '09: Proceedings of the 20th ACM conference on Hypertext and hypermedia199--208Social search and discovery using a unified approach2009ht09 social-search 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.ht09Community for tag(s) ht09