BibSonomy publications for /user/mstrohm/TOREADFri Oct 28 15:26:50 CEST 2011New York, NY, USAProceedings of the 12th international conference on Intelligent user interfaces32--41IUI '07SuggestBot: using intelligent task routing to help people find work in wikipedia2007TOREAD knowledge-production wikis Member-maintained communities ask their users to perform tasks the community needs. From Slashdot, to IMDb, to Wikipedia, groups with diverse interests create community-maintained artifacts of lasting value (CALV) that support the group's main purpose and provide value to others. Said communities don't help members find work to do, or do so without regard to individual preferences, such as Slashdot assigning meta-moderation randomly. Yet social science theory suggests that reducing the cost and increasing the personal value of contribution would motivate members to participate more.We present SuggestBot, software that performs intelligent task routing (matching people with tasks) in Wikipedia. SuggestBot uses broadly applicable strategies of text analysis, collaborative filtering, and hyperlink following to recommend tasks. SuggestBot's intelligent task routing increases the number of edits by roughly four times compared to suggesting random articles. Our contributions are: 1) demonstrating the value of intelligent task routing in a real deployment; 2) showing how to do intelligent task routing; and 3) sharing our experience of deploying a tool in Wikipedia, which offered both challenges and opportunities for research.Fri Aug 28 21:06:48 CEST 2009Journal of the American Society for Information Science and Technology{Twitter power: Tweets as electronic word of mouth}2009TOREAD mining twitter Sun Jul 05 18:49:22 CEST 2009Amsterdam, The Netherlands, The NetherlandsDecision Support Systems3245--253Exploring contributions of public resources in social bookmarking systems472009TOREAD goals motivation tagging Our study examines whether users' contributions of public resources to social bookmarking sites are circumstantial (a side effect of bookmarking for oneself), or motivational (intentional bookmarking for others). We develop a research model based on these two explanations and test it using survey data from users of two bookmarking sites. Our results suggest that public contributions are mainly driven by intentional bookmarking of resources for other users. In addition, we found that users deliberately bookmark resources for others when they believe that their bookmarks are valuable to other users and when they perceive that other users are contributing as well.Wed Jul 01 09:24:01 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyHyperincident Connected Components of Tagging Networks2009TOREAD networks 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 Nov 19 15:42:36 CET 2008Journal of the American Society for Information ScienceBates:794205--214Information Search tactics301979TOREAD cognition search strategies Sun Nov 02 05:20:31 CET 2008The Semantic Web - ISWC 2008615--631Semantic Grounding of Tag Relatedness in Social Bookmarking Systems2008TOREAD folksonomy semantic taggingsurvey Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.Sun Oct 26 22:56:30 CET 2008SIAM Reviewto appear (accepted June 2008)Tensor Decompositions and Applications2008PRELIMINARY-BIBTEX TOREAD mathematics Sun Sep 21 16:06:56 CEST 2008TorontoSIGIR conference on Research and development in information retrieval213--220Re-examining the potential effectiveness of interactive query expansion2003TOREAD search Much attention has been paid to the relative effectiveness of interactive query expansion versus automatic query expansion. Although interactive query expansion has the potential to be an effective means of improving a search, in this paper we show that, on average, human searchers are less likely than systems to make good expansion decisions. To enable good expansion decisions, searchers must have adequate instructions on how to use interactive query expansion functionalities. We show that simple instructions on using interactive query expansion do not necessarily help searchers make good expansion decisions and discuss difficulties found in making query expansion decisions.Mon Sep 15 16:20:18 CEST 2008Piscataway, NJ, USAIEEE Intelligent Systems279--83Social Computing: From Social Informatics to Social Intelligence222007TOREAD social-factors web-science Social computing has become a hot topic attracting broad interest from not only researchers but also technologists, software and online game vendors, Web entrepreneurs, business strategists, political analysts, and digital government practitioners, to name a few. This article discusses social computing's theoretical, methodological, and technological underpinnings; reviews major application areas; and raises key research issues.Wed Jul 30 17:00:27 CEST 2008Washington, DC, USAICSEA '07: Proceedings of the International Conference on Software Engineering Advances68Controlling Requirements Evolution: a Formal Concept Analysis-Based Approach2007FCA TOREAD evolution requirements-engineering Requirements evolve during the software development process. Requirements specification evolution determines changes both in terms of level of details and style of representation and it brings the requirements from the initial statement of the customer needs towards more detailed documents able to drive the software design, construction and verification. Controlling the evolution of requirements, usually written in natural language, is very important for the success of the whole software project because every step in the evolutionary path of requirements can introduce undesired changes or lacks of information. This paper describes an approach based on the Formal Concepts Analysis that allows a systematic and precise verification of the consistency among different stages of natural language requirements evolution.Mon Jul 21 15:36:30 CEST 2008Presented at the SIAM Conference on Discrete Mathematics Faster Algorithms for Constructing a Concept (Galois) Lattice2006TOREAD graphs networks In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is faster than all other existing algorithms for these problems.Tue Jun 17 10:18:07 CEST 2008Software, IEEE567--74{A cost-value approach for prioritizing requirements}141997TOREAD goals requirements-engineering Tue Jun 03 09:56:37 CEST 2008Cambridge, MA, USAComputational Linguistics195--101The kappa statistic: a second look302004TOREAD linguistics mathematics reading-group In recent years, the kappa coefficient of agreement has become the de facto standard for evaluating intercoder agreement for tagging tasks. In this squib, we highlight issues that affect κ and that the community has largely neglected. First, we discuss the assumptions underlying different computations of the expected agreement component of κ. Second, we discuss how prevalence and bias affect the κ measure.Sun Jun 01 20:01:39 CEST 2008JulySimple description of TwitterWhy We Twitter: Understanding Microblogging Usage and Communities2007TOREAD goals web-science Wed May 28 21:16:12 CEST 2008Journal of the American Society for Information Science and Technology (JASIST)6559-570A temporal comparison of AltaVista Web searching562005TOREAD query-log-analysis Wed May 21 12:39:46 CEST 2008AI Communications4245 - 262Network Properties of Folksonomies202007TOREAD networks reading-group web-science taggingsurvey Thu May 08 14:48:17 CEST 2008Information Processing and Management31251--1266{Determining the informational, navigational, and transactional intent of Web queries}442008TOREAD goals search Fri May 02 16:14:00 CEST 2008Proceedings of the Sixth International Conference on Data Mining948--952{CoMiner: An Effective Algorithm for Mining Competitors from the Web}2006NLP TOREAD knowledge-acquisition linguistics rule-based Fri Apr 25 15:17:34 CEST 2008Computer465--71{The task of the referee}231990TOREAD doing-research organizing-research writing-grants writing-papers Wed Apr 23 11:36:29 CEST 2008Reducing complexity of consumer electronics interfaces using commonsense reasoning2005TOREAD commonsense goals