@inproceedings{heymann2008, title = {Can social bookmarking improve web search?}, address = {New York, NY, USA}, author = {P. Heymann and G. Koutrika and H. Garcia-Molina}, booktitle = {WSDM '08: Proceedings of the international conference on Web search and web data mining}, pages = {195--206}, publisher = {ACM}, year = 2008, url = {http://portal.acm.org/citation.cfm?id=1341531.1341558}, location = {Palo Alto, California, USA}, isbn = {978-1-59593-927-9}, doi = {http://doi.acm.org/10.1145/1341531.1341558}, description = {Can social bookmarking improve web search?}, biburl = {http://www.bibsonomy.org/bibtex/2a5d16ec3e9107c728d1693a4a06d0573/mstrohm}, keywords = {TOREAD search folksonomy} } @misc{choi2006, title = {Faster Algorithms for Constructing a Concept (Galois) Lattice}, author = {V. Choi}, howpublished = {Presented at the SIAM Conference on Discrete Mathematics }, year = 2006, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0602069}, description = {Faster Algorithms for Constructing a Concept (Galois) Lattice}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/20c44a2fcf67f578c0cc2b0235183720f/mstrohm}, keywords = {networks TOREAD graphs} } @book{dennett2001, title = {The Mind's I: Fantasies and Reflections on Self & Soul}, author = {D. C. Dennett}, edition = 0, editor = {D.C. Dennett D.R. Hofstadter}, publisher = {Basic Books}, year = 2001, url = {http://www.amazon.com/Minds-I-Fantasies-Reflections-Self/dp/0465030912%3FSubscriptionId%3D13CT5CVB80YFWJEPWS02%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0465030912}, ean = {9780465030910}, asin = {0465030912}, isbn = {0465030912}, dewey = {126}, biburl = {http://www.bibsonomy.org/bibtex/2d37b0e5dcea298c37407824e048a46aa/mstrohm}, keywords = {TOBUY cognition books philosophy} } @article{karlsson1997, title = {{A cost-value approach for prioritizing requirements}}, author = {J. Karlsson and K. Ryan}, journal = {Software, IEEE}, number = 5, pages = {67--74}, volume = 14, year = 1997, biburl = {http://www.bibsonomy.org/bibtex/288dd34ae835371e2894b5ad27b6092a4/mstrohm}, keywords = {goals TOREAD requirements-engineering} } @article{spyrou1996, title = {{Intention Modelling: Approximating Computer User Intentions for Detection and Prediction of Intrusions}}, author = {T. Spyrou and J. Darzentas}, journal = {Computers and Security}, number = 5, pages = {395--395}, publisher = {Elsevier Science}, volume = 15, year = 1996, biburl = {http://www.bibsonomy.org/bibtex/23f2f053d4386b137f450a1f07ac51cf9/mstrohm}, keywords = {goals MUSTREAD theory} } @book{conte1995, title = {Cognitive and Social Action}, author = {R. Conte and C. Castelfranchi}, publisher = {Routledge}, year = 1995, url = {http://www.amazon.de/gp/redirect.html%3FASIN=1857281861%26tag=ws%26lcode=xm2%26cID=2025%26ccmID=165953%26location=/Cognitive-Social-Action-Rosaria-Conte/dp/1857281861%253FSubscriptionId=13CT5CVB80YFWJEPWS02}, ean = {9781857281866}, asin = {1857281861}, isbn = {1857281861}, dewey = {302.1}, biburl = {http://www.bibsonomy.org/bibtex/2d27f3da232a1ad8a95419dc3fe63dbfe/mstrohm}, keywords = {agents cognition TOBUY social-factors} } @book{alag2008, title = {Collective Intelligence in Action}, author = {S. Alag}, publisher = {Manning Publications}, year = 2008, url = {http://www.amazon.de/gp/redirect.html%3FASIN=1933988312%26tag=ws%26lcode=xm2%26cID=2025%26ccmID=165953%26location=/Collective-Intelligence-Action-Satnam-Alag/dp/1933988312%253FSubscriptionId=13CT5CVB80YFWJEPWS02}, ean = {9781933988313}, asin = {1933988312}, isbn = {1933988312}, dewey = {004}, biburl = {http://www.bibsonomy.org/bibtex/20ee711295a177fe2252f96969682c3b5/mstrohm}, keywords = {TOBUY web-science tools} } @article{dai2006, title = {{Detecting online commercial intention (OCI)}}, author = {H.K. Dai and L. Zhao and Z. Nie and J.R. Wen and L. Wang and Y. Li}, journal = {Proceedings of the 15th international conference on World Wide Web}, pages = {829--837}, publisher = {ACM Press New York, NY, USA}, year = 2006, biburl = {http://www.bibsonomy.org/bibtex/2a9a5d8aba04ef317c471853eaa3db742/mstrohm}, keywords = {goals MUSTREAD query-log-analysis reading-group} } @article{eugenio2004, title = {The kappa statistic: a second look}, address = {Cambridge, MA, USA}, author = {B. Di Eugenio and M. Glass}, journal = {Computational Linguistics}, number = 1, pages = {95--101}, publisher = {MIT Press}, volume = 30, year = 2004, url = {http://portal.acm.org/citation.cfm?id=1005385&dl=#}, issn = {0891-2017}, doi = {http://dx.doi.org/10.1162/089120104773633402}, description = {The kappa statistic}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/27f2f0f656b9fce77906c0857e15fee68/mstrohm}, keywords = {mathematics TOREAD linguistics reading-group} } @article{java2007, title = {Why We Twitter: Understanding Microblogging Usage and Communities}, author = {A. Java and X. Song and T. Finin and B. Tseng}, month = {July}, note = {Simple description of Twitter}, year = 2007, added = {2007-10-10 09:41:33 +0200}, rating = {3}, uri = {papers://C3B117CD-23C4-4854-9426-AC96AFB113DA/Paper/p1012}, url = {file://localhost/Users/bertilhatt/Documents/Papers/Java/2007/Java%202007.pdf}, modified = {2008-02-06 11:27:59 +0100}, description = {contains a set of interesting references to "intent" literature}, biburl = {http://www.bibsonomy.org/bibtex/25c4bc55106b6eed14768ecbbeba2e687/mstrohm}, keywords = {web-science goals TOREAD} } @article{jansen2005, title = {A temporal comparison of AltaVista Web searching}, author = {B. J. Jansen and A. Spink and J. O. Pedersen}, journal = {Journal of the American Society for Information Science and Technology (JASIST)}, number = 6, pages = {559-570}, volume = 56, year = 2005, url = {http://dblp.uni-trier.de/db/journals/jasis/jasis56.html#JansenSP05}, ee = {http://dx.doi.org/10.1002/asi.20145}, date = {2005-06-13}, biburl = {http://www.bibsonomy.org/bibtex/2a16b1fd5d70c48d7d81af4791a658649/mstrohm}, keywords = {TOREAD query-log-analysis} } @article{cattuto2007, title = {Network Properties of Folksonomies}, author = {C. Cattuto and C. Schmitz and A. Baldassarri and V. D. P. Servedio and V. Loreto and A. Hotho and M. Grahl and G. Stumme}, journal = {AI Communications}, number = 4, pages = {245 - 262}, volume = 20, year = 2007, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/aicomm_2007_folksonomy_clustering.pdf}, vgwort = {67}, biburl = {http://www.bibsonomy.org/bibtex/2d87e198a6d564ae8a8fe151e0a96fa0f/mstrohm}, keywords = {reading-group web-science TOREAD networks} } @article{jansen2008, title = {{Determining the informational, navigational, and transactional intent of Web queries}}, author = {B.J. Jansen and D.L. Booth and A. Spink}, journal = {Information Processing and Management}, number = 3, pages = {1251--1266}, publisher = {Elsevier}, volume = 44, year = 2008, biburl = {http://www.bibsonomy.org/bibtex/279b5bcb206425b477e8d940874746088/mstrohm}, keywords = {goals TOREAD search} } @inproceedings{hearst1992, title = {{Automatic acquisition of hyponyms from large text corpora}}, author = {M.A. Hearst}, booktitle = {Proceedings of the 14th conference on Computational linguistics-Volume 2}, pages = {539--545}, publisher = {Association for Computational Linguistics Morristown, NJ, USA}, year = 1992, biburl = {http://www.bibsonomy.org/bibtex/2bbfe026440ee77df22c1d9ef88f8101c/mstrohm}, keywords = {rule-based NLP INFLUENTIAL linguistics reading-group MUSTREAD knowledge-acquisition} } @article{li2006, title = {{CoMiner: An Effective Algorithm for Mining Competitors from the Web}}, author = {R. Li and S. Bao and J. Wang and Y. Yu and Y. Cao}, journal = {Proceedings of the Sixth International Conference on Data Mining}, pages = {948--952}, publisher = {IEEE Computer Society Washington, DC, USA}, year = 2006, biburl = {http://www.bibsonomy.org/bibtex/2a23bde8939f10544eabb1c0d38a0ee6a/mstrohm}, keywords = {TOREAD knowledge-acquisition linguistics NLP rule-based} } @article{smith1990, title = {{The task of the referee}}, author = {A.J. Smith}, journal = {Computer}, number = 4, pages = {65--71}, volume = 23, year = 1990, biburl = {http://www.bibsonomy.org/bibtex/240e44740bbeae570621f668e30822fd2/mstrohm}, keywords = {writing-grants writing-papers organizing-research doing-research TOREAD} } @mastersthesis{espinosa2005a, title = {Reducing complexity of consumer electronics interfaces using commonsense reasoning}, author = {J. Espinosa}, school = {MIT Media Laboratory, Massachusetts Institute of Technology, Cambridge, MA}, year = 2005, description = {describes eventnet/goalnet}, biburl = {http://www.bibsonomy.org/bibtex/2d4d0eaa202f0434386133223f86c9405/mstrohm}, keywords = {goals commonsense TOREAD} } @inproceedings{espinosa2005, title = {EventNet: Inferring Temporal Relations Between Commonsense Events}, author = {J. Espinosa and H. Lieberman}, booktitle = {MICAI: Fourth Mexican International Conference on Artificial Intelligence}, crossref = {conf/micai/2005}, editor = {A. F. Gelbukh and A. de Albornoz and H. Terashima-Marín}, pages = {61-69}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 3789, year = 2005, url = {http://dblp.uni-trier.de/db/conf/micai/micai2005.html#EspinosaL05}, ee = {http://dx.doi.org/10.1007/11579427_7}, isbn = {3-540-29896-7}, date = {2006-05-08}, biburl = {http://www.bibsonomy.org/bibtex/2836390fc1dc8e6186b34caa3a0223e83/mstrohm}, keywords = {goals commonsense TOREAD} } @inproceedings{lieberman2006, title = {A goal-oriented interface to consumer electronics using planning and commonsense reasoning}, address = {New York, NY, USA}, author = {H. Lieberman and J. Espinosa}, booktitle = {IUI '06: Proceedings of the 11th international conference on Intelligent user interfaces}, pages = {226--233}, publisher = {ACM}, year = 2006, url = {http://portal.acm.org/citation.cfm?doid=1111449.1111497}, location = {Sydney, Australia}, isbn = {1-59593-287-9}, doi = {http://doi.acm.org/10.1145/1111449.1111497}, description = {A goal-oriented interface to consumer electronics using planning and commonsense reasoning}, abstract = {We are reaching a crisis with design of user interfaces for consumer electronics. Flashing 12:00 time indicators, push-and-hold buttons, and interminable modes and menus are all symptoms of trying to maintain a one-to-one correspondence between functions and physical controls, which becomes hopeless as the number of capabilities of devices grows. We propose instead to orient interfaces around the goals that users have for the use of devices.We present Roadie, a user interface agent that provides intelligent context-sensitive help and assistance for a network of consumer devices. Roadie uses a Commonsense knowledge base to map between user goals and functions of the devices, and an AI partial-order planner to provide mixed-initiative assistance with executing multi-step procedures and debugging help when things go wrong.}, biburl = {http://www.bibsonomy.org/bibtex/27064f1fd966177bcca11e2396b3d3af0/mstrohm}, keywords = {TOREAD commonsense goals} } @inproceedings{zhuang2006, title = {Re-ranking search results using query logs}, address = {New York, NY, USA}, author = {Z. Zhuang and S. Cucerzan}, booktitle = {CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management}, pages = {860--861}, publisher = {ACM}, year = 2006, url = {http://portal.acm.org/citation.cfm?doid=1183614.1183767}, location = {Arlington, Virginia, USA}, isbn = {1-59593-433-2}, doi = {http://doi.acm.org/10.1145/1183614.1183767}, description = {Re-ranking search results using query logs}, abstract = {This work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevant to the user's search intent, and fresh and relevant pages may not get high ranks for an underspecified query due to their freshness and to the large number of pages that match the query, despite the fact that a large number of users have searched for parts of their content recently. We propose a novel method, Q-Rank, to effectively refine the ranking of search results for any given query by constructing the query context from search query logs. Evaluation results show that Q-Rank gains a considerable advantage over the current ranking system of a large-scale commercial Web search engine, being able to improve the relevance of search results for 82% of the queries.}, biburl = {http://www.bibsonomy.org/bibtex/2da0134a1d82f517f5e3b37450ed52187/mstrohm}, keywords = {query-log-analysis search TOREAD} }