@inproceedings{Cosley:2007:SUI:1216295.1216309,
  abstract = {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.},
  acmid = {1216309},
  added-at = {2011-10-28T15:26:50.000+0200},
  address = {New York, NY, USA},
  author = {Cosley, Dan and Frankowski, Dan and Terveen, Loren and Riedl, John},
  biburl = {http://www.bibsonomy.org/bibtex/2363c25303271d44db22090a5dbf78f83/mstrohm},
  booktitle = {Proceedings of the 12th international conference on Intelligent user interfaces},
  description = {SuggestBot},
  doi = {10.1145/1216295.1216309},
  interhash = {e0411f4b0f0db2cc694f04453673e4e8},
  intrahash = {363c25303271d44db22090a5dbf78f83},
  isbn = {1-59593-481-2},
  keywords = {TOREAD knowledge-production wikis},
  location = {Honolulu, Hawaii, USA},
  numpages = {10},
  pages = {32--41},
  publisher = {ACM},
  series = {IUI '07},
  timestamp = {2011-10-28T15:26:50.000+0200},
  title = {SuggestBot: using intelligent task routing to help people find work in wikipedia},
  url = {http://doi.acm.org/10.1145/1216295.1216309},
  year = 2007
}

@article{jansen2009,
  added-at = {2009-08-28T21:06:48.000+0200},
  author = {Jansen, B.J. and Zhang, M. and Sobel, K. and Chowdury, A.},
  biburl = {http://www.bibsonomy.org/bibtex/2b67cf45d8166b79798b6b77e3a58a585/mstrohm},
  interhash = {21fb6502ec3659e855dc4666b9029584},
  intrahash = {b67cf45d8166b79798b6b77e3a58a585},
  journal = {Journal of the American Society for Information Science and Technology},
  keywords = {TOREAD mining twitter},
  publisher = {Wiley Subscription Services, Inc., A Wiley Company Hoboken},
  timestamp = {2009-08-28T21:06:48.000+0200},
  title = {{Twitter power: Tweets as electronic word of mouth}},
  url = {http://scholar.google.com/scholar.bib?q=info:Dsuhij_9wwMJ:scholar.google.com/&output=citation&hl=en&ct=citation&cd=0},
  year = 2009
}

@article{arakji2009,
  abstract = {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.},
  added-at = {2009-07-05T18:49:22.000+0200},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Arakji, R. and Benbunan-Fich, R. and Koufaris, M.},
  biburl = {http://www.bibsonomy.org/bibtex/2f4ef2faf0808fc615b00355583ba2d3b/mstrohm},
  description = {also see: http://www.informaworld.com/smpp/content~content=a793280929~db=all~jumptype=rss},
  doi = {http://dx.doi.org/10.1016/j.dss.2009.02.007},
  interhash = {32e9b7719c53fbfc74165a6eaeccd210},
  intrahash = {f4ef2faf0808fc615b00355583ba2d3b},
  issn = {0167-9236},
  journal = {Decision Support Systems},
  keywords = {TOREAD goals motivation tagging},
  number = 3,
  pages = {245--253},
  publisher = {Elsevier Science Publishers B. V.},
  timestamp = {2009-07-05T18:49:22.000+0200},
  title = {Exploring contributions of public resources in social bookmarking systems},
  url = {http://portal.acm.org/citation.cfm?id=1542573.1543089&coll=GUIDE&dl=GUIDE},
  volume = 47,
  year = 2009
}

@inproceedings{neubauer2009,
  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. },
  added-at = {2009-07-01T09:24:01.000+0200},
  address = {New York, NY, USA},
  author = {Neubauer, Nicolas and Obermayer, Klaus},
  biburl = {http://www.bibsonomy.org/bibtex/2f696989e22dd4c77c8a6352526e13efe/mstrohm},
  booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia},
  description = {Hypertext 09 best paper},
  interhash = {2686bad7ff1f4d07c0b3302dff08368a},
  intrahash = {f696989e22dd4c77c8a6352526e13efe},
  keywords = {TOREAD networks tagging},
  month = {July},
  paperid = {fp105},
  publisher = {ACM},
  session = {Full Paper},
  timestamp = {2009-07-01T09:24:01.000+0200},
  title = {Hyperincident Connected Components of Tagging Networks},
  year = 2009
}

@article{Bates1979,
  added-at = {2008-11-19T15:42:36.000+0100},
  author = {Bates, M. J.},
  biburl = {http://www.bibsonomy.org/bibtex/2a428390662c7a78d1285106de5be4424/mstrohm},
  classification-codes = {H.3.3; H.5.2},
  description = {search},
  entrydate = {19930416},
  interhash = {23e24457de3b1b8db9737f53be8dbf69},
  intrahash = {a428390662c7a78d1285106de5be4424},
  journal = {Journal of the American Society for Information Science},
  key = {Bates:79},
  keywords = {TOREAD cognition search strategies},
  number = 4,
  pages = {205--214},
  subject-descriptors = {theory and methods; search process},
  timestamp = {2008-11-19T15:42:36.000+0100},
  title = {Information Search tactics},
  volume = 30,
  year = 1979
}

@article{cattuto2008,
  abstract = {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.},
  added-at = {2008-11-02T05:20:31.000+0100},
  author = {Cattuto, C. and Benz, D. and Hotho, A. and Stumme, G.},
  biburl = {http://www.bibsonomy.org/bibtex/24402d218590580c8886fcb1edcaf7f9f/mstrohm},
  description = {SpringerLink - Buchkapitel (not avail electronically)},
  interhash = {b44538648cfd476d6c94e30bc6626c86},
  intrahash = {4402d218590580c8886fcb1edcaf7f9f},
  journal = {The Semantic Web - ISWC 2008},
  keywords = {TOREAD folksonomy semantic taggingsurvey},
  pages = {615--631},
  timestamp = {2008-11-02T05:20:31.000+0100},
  title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems},
  url = {http://dx.doi.org/10.1007/978-3-540-88564-1_39},
  year = 2008
}

@article{kolda2008,
  added-at = {2008-10-26T22:56:30.000+0100},
  author = {Kolda, T. G. and Bader, B. W.},
  biburl = {http://www.bibsonomy.org/bibtex/2ce9f80ee36e382ac6a865d065304e9d0/mstrohm},
  description = {Tamara G. Kolda - Publications},
  interhash = {9fe44420e064ed14342316d92e3258dc},
  intrahash = {ce9f80ee36e382ac6a865d065304e9d0},
  journal = {SIAM Review},
  keywords = {PRELIMINARY-BIBTEX TOREAD mathematics},
  note = {to appear (accepted June 2008)},
  timestamp = {2008-10-26T22:56:30.000+0100},
  title = {Tensor Decompositions and Applications},
  year = 2008
}

@inproceedings{ruthven2003,
  abstract = {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.},
  added-at = {2008-09-21T16:06:56.000+0200},
  address = {Toronto},
  author = {Ruthven, I.},
  biburl = {http://www.bibsonomy.org/bibtex/232dcb61d9bb83440c07ff098904a7ba1/mstrohm},
  booktitle = {SIGIR conference on Research and development in information retrieval},
  description = {Re-examining the potential effectiveness of interactive query expansion},
  interhash = {e48b971615e2ffe2cf31a7697a3bf7ca},
  intrahash = {32dcb61d9bb83440c07ff098904a7ba1},
  keywords = {TOREAD search},
  pages = {213--220},
  publisher = {ACM},
  timestamp = {2008-09-21T16:06:56.000+0200},
  title = {Re-examining the potential effectiveness of interactive query expansion},
  url = {http://doi.acm.org/10.1145/860435.860475},
  year = 2003
}

@article{wang2007a,
  abstract = {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.},
  added-at = {2008-09-15T16:20:18.000+0200},
  address = {Piscataway, NJ, USA},
  author = {Wang, F.Y. and Carley, K. M. and Zeng, D. and Mao, W.},
  biburl = {http://www.bibsonomy.org/bibtex/2f86718d39bc7dc8c57ec507dc291875f/mstrohm},
  description = {Social Computing / Social Computation},
  doi = {http://dx.doi.org/10.1109/MIS.2007.41},
  interhash = {3d3b12ce1507c4c4f098ae455c9b6740},
  intrahash = {f86718d39bc7dc8c57ec507dc291875f},
  issn = {1541-1672},
  journal = {IEEE Intelligent Systems},
  keywords = {TOREAD social-factors web-science},
  number = 2,
  pages = {79--83},
  publisher = {IEEE Educational Activities Department},
  timestamp = {2008-09-15T16:20:18.000+0200},
  title = {Social Computing: From Social Informatics to Social Intelligence},
  url = {http://portal.acm.org/citation.cfm?id=1251571.1251928&coll=GUIDE&dl=},
  volume = 22,
  year = 2007
}

@inproceedings{fabbrini2007,
  abstract = {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.},
  added-at = {2008-07-30T17:00:27.000+0200},
  address = {Washington, DC, USA},
  author = {Fabbrini, F. and Fusani, M. and Gnesi, S. and Lami, G.},
  biburl = {http://www.bibsonomy.org/bibtex/2b7951e512aeef228e32c0e97dc8cb929/mstrohm},
  booktitle = {ICSEA '07: Proceedings of the International Conference on Software Engineering Advances},
  doi = {http://dx.doi.org/10.1109/ICSEA.2007.24},
  interhash = {a706c2f889247c0c17e9ec27d05c4f55},
  intrahash = {b7951e512aeef228e32c0e97dc8cb929},
  isbn = {0-7695-2937-2},
  keywords = {FCA TOREAD evolution requirements-engineering},
  pages = 68,
  publisher = {IEEE Computer Society},
  timestamp = {2008-07-30T17:00:27.000+0200},
  title = {Controlling Requirements Evolution: a Formal Concept Analysis-Based Approach},
  url = {http://portal.acm.org/citation.cfm?id=1304609.1306466&coll=portal&dl=ACM},
  year = 2007
}

@misc{choi2006,
  abstract = { 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.},
  added-at = {2008-07-21T15:36:30.000+0200},
  author = {Choi, V.},
  biburl = {http://www.bibsonomy.org/bibtex/20c44a2fcf67f578c0cc2b0235183720f/mstrohm},
  description = {Faster Algorithms for Constructing a Concept (Galois) Lattice},
  howpublished = {Presented at the SIAM Conference on Discrete Mathematics },
  interhash = {d7004f50d8b5962007b25b341c540776},
  intrahash = {0c44a2fcf67f578c0cc2b0235183720f},
  keywords = {TOREAD graphs networks},
  timestamp = {2008-07-21T15:36:30.000+0200},
  title = {Faster Algorithms for Constructing a Concept (Galois) Lattice},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0602069},
  year = 2006
}

@article{karlsson1997,
  added-at = {2008-06-17T10:18:07.000+0200},
  author = {Karlsson, J. and Ryan, K.},
  biburl = {http://www.bibsonomy.org/bibtex/288dd34ae835371e2894b5ad27b6092a4/mstrohm},
  interhash = {7960e9fe3a1bc3ad6bf3da2fe9ae939b},
  intrahash = {88dd34ae835371e2894b5ad27b6092a4},
  journal = {Software, IEEE},
  keywords = {TOREAD goals requirements-engineering},
  number = 5,
  pages = {67--74},
  timestamp = {2008-06-17T10:18:07.000+0200},
  title = {{A cost-value approach for prioritizing requirements}},
  volume = 14,
  year = 1997
}

@article{eugenio2004,
  abstract = {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.},
  added-at = {2008-06-03T09:56:37.000+0200},
  address = {Cambridge, MA, USA},
  author = {Eugenio, B. Di and Glass, M.},
  biburl = {http://www.bibsonomy.org/bibtex/27f2f0f656b9fce77906c0857e15fee68/mstrohm},
  description = {The kappa statistic},
  doi = {http://dx.doi.org/10.1162/089120104773633402},
  interhash = {d09f376b70a157341f6abd6dbe6c40f1},
  intrahash = {7f2f0f656b9fce77906c0857e15fee68},
  issn = {0891-2017},
  journal = {Computational Linguistics},
  keywords = {TOREAD linguistics mathematics reading-group},
  number = 1,
  pages = {95--101},
  publisher = {MIT Press},
  timestamp = {2008-06-03T09:56:37.000+0200},
  title = {The kappa statistic: a second look},
  url = {http://portal.acm.org/citation.cfm?id=1005385&dl=#},
  volume = 30,
  year = 2004
}

@article{java2007,
  added-at = {2008-06-01T20:01:39.000+0200},
  author = {Java, A. and Song, X. and Finin, T. and Tseng, B.},
  biburl = {http://www.bibsonomy.org/bibtex/25c4bc55106b6eed14768ecbbeba2e687/mstrohm},
  date-added = {2007-10-10 09:41:33 +0200},
  date-modified = {2008-02-06 11:27:59 +0100},
  description = {contains a set of interesting references to "intent" literature},
  interhash = {7181f39eef0983b094570ab03aca0bc2},
  intrahash = {5c4bc55106b6eed14768ecbbeba2e687},
  keywords = {TOREAD goals web-science},
  local-url = {file://localhost/Users/bertilhatt/Documents/Papers/Java/2007/Java%202007.pdf},
  month = {July},
  note = {Simple description of Twitter},
  rating = {3},
  timestamp = {2008-06-01T20:01:39.000+0200},
  title = {Why We Twitter: Understanding Microblogging Usage and Communities},
  uri = {papers://C3B117CD-23C4-4854-9426-AC96AFB113DA/Paper/p1012},
  year = 2007
}

@article{jansen2005,
  added-at = {2008-05-28T21:16:12.000+0200},
  author = {Jansen, B. J. and Spink, A. and Pedersen, J. O.},
  biburl = {http://www.bibsonomy.org/bibtex/2a16b1fd5d70c48d7d81af4791a658649/mstrohm},
  date = {2005-06-13},
  ee = {http://dx.doi.org/10.1002/asi.20145},
  interhash = {f81e729bb0af255d4866c0038d7b1942},
  intrahash = {a16b1fd5d70c48d7d81af4791a658649},
  journal = {Journal of the American Society for Information Science and Technology (JASIST)},
  keywords = {TOREAD query-log-analysis},
  number = 6,
  pages = {559-570},
  timestamp = {2008-05-28T21:16:12.000+0200},
  title = {A temporal comparison of AltaVista Web searching},
  url = {http://dblp.uni-trier.de/db/journals/jasis/jasis56.html#JansenSP05},
  volume = 56,
  year = 2005
}

@article{cattuto2007,
  added-at = {2008-05-21T12:39:46.000+0200},
  author = {Cattuto, C. and Schmitz, C. and Baldassarri, A. and Servedio, V. D. P. and Loreto, V. and Hotho, A. and Grahl, M. and Stumme, G.},
  biburl = {http://www.bibsonomy.org/bibtex/2d87e198a6d564ae8a8fe151e0a96fa0f/mstrohm},
  interhash = {fc5f2df61d28bc99b7e15029da125588},
  intrahash = {d87e198a6d564ae8a8fe151e0a96fa0f},
  journal = {AI Communications},
  keywords = {TOREAD networks reading-group web-science taggingsurvey},
  number = 4,
  pages = {245 - 262},
  timestamp = {2008-05-21T12:39:46.000+0200},
  title = {Network Properties of Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/aicomm_2007_folksonomy_clustering.pdf},
  vgwort = {67},
  volume = 20,
  year = 2007
}

@article{jansen2008,
  added-at = {2008-05-08T14:48:17.000+0200},
  author = {Jansen, B.J. and Booth, D.L. and Spink, A.},
  biburl = {http://www.bibsonomy.org/bibtex/279b5bcb206425b477e8d940874746088/mstrohm},
  interhash = {d9491815a0eef0d2b4cd74edda307f80},
  intrahash = {79b5bcb206425b477e8d940874746088},
  journal = {Information Processing and Management},
  keywords = {TOREAD goals search},
  number = 3,
  pages = {1251--1266},
  publisher = {Elsevier},
  timestamp = {2008-05-08T14:48:17.000+0200},
  title = {{Determining the informational, navigational, and transactional intent of Web queries}},
  volume = 44,
  year = 2008
}

@article{li2006,
  added-at = {2008-05-02T16:14:00.000+0200},
  author = {Li, R. and Bao, S. and Wang, J. and Yu, Y. and Cao, Y.},
  biburl = {http://www.bibsonomy.org/bibtex/2a23bde8939f10544eabb1c0d38a0ee6a/mstrohm},
  interhash = {c1716b687274683f8878b92e600911c2},
  intrahash = {a23bde8939f10544eabb1c0d38a0ee6a},
  journal = {Proceedings of the Sixth International Conference on Data Mining},
  keywords = {NLP TOREAD knowledge-acquisition linguistics rule-based},
  pages = {948--952},
  publisher = {IEEE Computer Society Washington, DC, USA},
  timestamp = {2008-05-02T16:14:00.000+0200},
  title = {{CoMiner: An Effective Algorithm for Mining Competitors from the Web}},
  year = 2006
}

@article{smith1990,
  added-at = {2008-04-25T15:17:34.000+0200},
  author = {Smith, A.J.},
  biburl = {http://www.bibsonomy.org/bibtex/240e44740bbeae570621f668e30822fd2/mstrohm},
  interhash = {937f7117ecd78389c66fc0624de818c4},
  intrahash = {40e44740bbeae570621f668e30822fd2},
  journal = {Computer},
  keywords = {TOREAD doing-research organizing-research writing-grants writing-papers},
  number = 4,
  pages = {65--71},
  timestamp = {2008-04-25T15:17:34.000+0200},
  title = {{The task of the referee}},
  volume = 23,
  year = 1990
}

@mastersthesis{espinosa2005a,
  added-at = {2008-04-23T11:36:29.000+0200},
  author = {Espinosa, J.},
  biburl = {http://www.bibsonomy.org/bibtex/2d4d0eaa202f0434386133223f86c9405/mstrohm},
  description = {describes eventnet/goalnet},
  interhash = {4ee33f3c9261752b36e6ccbe0216333d},
  intrahash = {d4d0eaa202f0434386133223f86c9405},
  keywords = {TOREAD commonsense goals},
  school = {MIT Media Laboratory, Massachusetts Institute of Technology, Cambridge, MA},
  timestamp = {2008-04-23T11:36:29.000+0200},
  title = {Reducing complexity of consumer electronics interfaces using commonsense reasoning},
  year = 2005
}