Publication

A Model of Computation for MapReduce

Source:

Symposium on Discrete Algorithms (SODA) (2010)

Download:

Publication

Location Cache for Web Queries

Source:

ACM Conference on Information and Knowledge Management (2009)

Publication

Building decision trees to identify the intent of a user query

Source:

Knowledge-Based and Intelligent Information and Engineering Systems, p.285-292 (2009)

Publication

A Last-Resort Semantic Cache for Web Queries

Source:

String Processing and Information Retrieval, Springer, Volume 5721, p.310-321 (2009)

Publication

Identifying the intent of a user query using support vector machines

Source:

String Processing and Information Retrieval, Springer, Volume 5721, Saariselka, Finlandia, p.131-142 (2009)

Publication

Research automation as technomethodological pixie dust

Source:

interactions, ACM, Volume 16, Issue 5, p.40-43 (2009)

Abstract:

In this article, I address the ways in which 'discount' qualitative methods can fail to deliver results. I advocate for well-conducted, carefully designed research with qualitative and quantitative data collection. I argue that there is no hard and fast distinction between qualitative and quantitative methods, but there are different ‘ways of looking’ that are appropriate for different projects and different questions. Carefully designed and executed research that delivers both academic and business value inevitably involves numbers, descriptions, stories and qualitative judgment-calls on the part of analysts.

Download:

ACM COPYRIGHT NOTICE. Copyright © 2009 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Publication

Of Candied Herbs and Happy Babies: Seeking and Searching on Your Own Terms

Source:

interactions, ACM, Volume 15, Issue 6, p.46-49 (2008)

Abstract:

In this article, I address challenges for Internet-based information seeking and searching. Using everyday examples of seeking locations and products online, I illustrate how language differences make keyword selection and therefore search very difficult, and also at the ways in which social search through applications and services like Flickr, Twitter and Facebook are combined with traditional keyword search to create a temporally extended set of actions that are all part of the ecology of information seeking, searching, finding, noting, bookmarking and sharing.

Download:

ACM COPYRIGHT NOTICE. Copyright © 2009 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Publication

Voting in Social Networks

Source:

Conference on Information and Knowledge Management (CIKM), ACM Press, Hong Kong (2009)

Abstract:

A voting system is a set of rules that a community adopts to take collective decisions. In this paper we study voting systems for a particular kind of community: electronically mediated social networks. In particular, we focus on delegative democracy (a.k.a. proxy voting) that has recently received increased interest for its ability to combine the benefits of direct and representative systems, and that seems also perfectly suited for electronically mediated social networks. In such a context, we consider a voting system in which users can only express their preference for one among the people they are explicitly connected with, and this preference can be propagated transitively, using an attenuation factor. We present this system and we study its properties. We also take into consideration the problem of missing votes, which is particularly relevant in online networks, as some recent case shows. Our experiments on real-world networks provide interesting insight into the significance and stability of the results obtained with the suggested voting system.

Download:

ACM COPYRIGHT NOTICE. Copyright © 2009 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Publication

Aging effects on Query Flow Graph for Query Suggestion

Source:

Conference on Information and Knowledge Management (CIKM), ACM Press, Hong Kong (2009)

Abstract:

A recent query-log mining approach for query recommendation is based on Query Flow Graphs (QFG). In this paper we propose an evaluation of the effects of time on this query recommendation model. As users interests change over time, the knowledge extracted from query logs may suffer an aging effect as new interesting topics appear. In order to validate experimentally this hypothesis, we build different query flow graphs from the queries belonging to a large query log of a real-world search engine. Each query flow graph is built on distinct query log segments. Then, we generate recommendations on different sets of queries. Results are assessed both by means of human judgments and by using an automatic evaluator showing that the models inexorably age.

News

Yahoo! Leads CIKM Program with 30 Accepted Papers



With 30 accepted papers Yahoo! leads the program of full and short papers being presented at The 18th ACM Conference on Information and Knowledge Management on November 2-6, 2009 in Hong Kong.

Full Papers