{"id":306518,"date":"2009-07-20T09:00:12","date_gmt":"2009-07-20T16:00:12","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?p=306518"},"modified":"2016-10-17T13:46:41","modified_gmt":"2016-10-17T20:46:41","slug":"sigir-2009-seeking-better-search","status":"publish","type":"post","link":"https:\/\/www.microsoft.com\/en-us\/research\/blog\/sigir-2009-seeking-better-search\/","title":{"rendered":"SIGIR 2009: Seeking Better Search"},"content":{"rendered":"
By Rob Knies, Managing Editor, Microsoft Research<\/em><\/p>\n Organizing threaded discussions. Using reasoning to rank answers on community sites. Predicting click-through rates for news queries. Assessing how crawl policies affect the effectiveness of Web search. Taking context into consideration when classifying queries and predicting user interests.<\/p>\n Much remains to be solved in the field of information retrieval. That becomes obvious just by scanning the list of papers to be presented by Microsoft Research during SIGIR 2009<\/a>, the 32nd annual conference sponsored by the Association for Computing Machinery\u2019s Special Interest Group on Information Retrieval<\/a>.<\/p>\n The event, to be held in Boston from July 19-23 at the Sheraton Boston Hotel and Northeastern University, will feature 74 accepted papers, in addition to a busy schedule packed with tutorials, workshops, posters, demonstrations, and talks. And of those accepted papers, no fewer than 21\u201528 percent\u2015come from Microsoft Research.<\/p>\n That should come as little surprise. Microsoft Research has a history of strong participation in SIGIR. Over the past four years, 58 papers from the organization\u2019s labs have been accepted for presentation during this prestigious conference, an indication of how seriously Microsoft is taking its goals of refining and advancing the state of the art in information retrieval.<\/p>\n Microsoft Research\u2019s support for SIGIR is hardly limited to papers, either. Five workshops to be conducted July 23 feature Microsoft Research personnel. Four of the paper sessions will be chaired by researchers from the organization. Of 104 posters to be displayed during the gathering, 12 will be from Microsoft Research, which is also contributing one demonstration and a talk during the industry track of the conference. Microsoft Research is a gold sponsor for SIGIR 2009.<\/p>\n Three of Microsoft Research\u2019s six labs worldwide are well represented in the paper presentations, with Microsoft Research Asia<\/a> contributing eight, and both Microsoft Research Redmond<\/a> and Microsoft Research Cambridge<\/a> being responsible for six. Another is a joint effort between the latter lab and Microsoft Research Silicon Valley. In addition, two other papers have been submitted by authors from elsewhere in Microsoft.<\/p>\n Meng Wang and Xian-Sheng Hua of Microsoft Research Asia, along with Bo Liu of the University of Science and Technology of China, will conduct a demonstration on July 20 entitled Accommodating Colorblind Users in Image Search.<\/p>\n Two days later, danah boyd<\/a> of Microsoft Research New England<\/a> is to deliver an industry-track discussion called The Searchable Nature of Acts in Networked Publics.<\/p>\n Natasa Milic-Frayling of Microsoft Research Cambridge acts as session chair for a July 20 collection of papers called Recommenders I. Tie-Yan Liu<\/a> of Microsoft Research Asia chairs the Learning to Rank I session on the morning of July 21, and that afternoon, Susan Dumais<\/a> of Microsoft Research Redmond will chair the Interactive Search session. The following morning, it\u2019s Tetsuya Sakai\u2019s turn, during a session entitled Evaluation and Measurement I.<\/p>\n Microsoft Research attendees will be busy collaborating with academic partners during the July 23 workshops, participating in five:<\/p>\n Papers and posters accepted for SIGIR 2009 with at least one Microsoft Research co-author:<\/p>\n Click-Through Prediction for News Queries <\/strong> Arnd Christian K\u00f6nig, Microsoft Research Redmond; Michael Gamon, Microsoft Research Redmond; and Qiang Wu, Microsoft Research Redmond.<\/p>\n Context-Aware Query Classification<\/strong><\/a> Huanhuan Cao, University of Science and Technology of China; Derek Hao Hu, Hong Kong University of Science and Technology; Dou Shen, Microsoft; Daxin Jiang, Microsoft Research Asia; Jian-Tao Sun, Microsoft Research Asia; Enhong Chen, University of Science and Technology of China; and Qiang Yang, Hong Kong University of Science and Technology.<\/p>\n CrowdReranking: Exploring Multiple Search Engines for Visual Search Reranking<\/strong> Yuan Liu, University of Science and Technology of China; Tao Mei, Microsoft Research Asia; and Xian-Sheng Hua, Microsoft Research Asia.<\/p>\n Document Selection Methodologies for Efficient and Effective Learning-to-Rank<\/strong> Javed A. Aslam, Northeastern University; Evangelos Kanoulas, Northeastern University; Virgil Pavlu, Northeastern University; Stefan Savev, Northeastern University; and Emine Yilmaz, Microsoft Research Cambridge.<\/p>\n Effective Query Expansion for Federated Search<\/strong><\/a> Milad Shokouhi, Microsoft Research Cambridge; Leif Azzopardi, University of Glasgow; and Paul Thomas, Commonwealth Scientific and Research Organization.<\/p>\n Extracting Structured Information from User Queries with Semi-Supervised Conditional Random Fields<\/strong><\/a> Xiao Li, Microsoft Research Redmond; Ye-Yi Wang, Microsoft Research Redmond; and Alex Acero, Microsoft Research Redmond.<\/p>\n Named Entity Recognition in Query<\/strong><\/a> Jiafeng Guo, Chinese Academy of Sciences; Gu Xu, Microsoft Research Asia; Xueqi Cheng, Chinese Academy of Sciences; and Hang Li, Microsoft Research Asia.<\/p>\n On the Local Optimality of LambdaRank<\/strong><\/a> Pinar Donmez, Carnegie Mellon University; Krysta M. Svore, Microsoft Research Redmond; and Christopher J.C. Burges, Microsoft Research Redmond.<\/p>\n Optimizing Search Engine Revenue in Sponsored Search<\/strong> Yunzhang Zhu, Tsinghua University; Gang Wang, Microsoft Research Asia; Junli Yang, Nankai University; Dakan Wang, Shanghai Jiaotong University; Jun Yan, Microsoft Research Asia; Jian Hu, Microsoft Research Asia; and Zheng Chen, Microsoft Research Asia.<\/p>\n Predicting User Interests from Contextual Information<\/strong><\/a> Ryen W. White, Microsoft Research Redmond; Peter Bailey, Microsoft; and Liwei Chen, Microsoft.<\/p>\n Ranking Community Answers by Modeling Question-Answer Relationships via Analogical Reasoning<\/strong><\/a> Xin-Jing Wang, Microsoft Research Asia; Xudong Tu, Huazhong Science and Technology University; Dan Feng, Huazhong Science and Technology University; and Lei Zhang, Microsoft Research Asia.<\/p>\n Refined Experts: Improving Classification in Large Taxonomies<\/strong><\/a> Paul N. Bennett, Microsoft Research Redmond; and Nam Nguyen, Cornell University.<\/p>\n Risky Business: Modeling and Exploiting Uncertainty in Information Retrieval<\/strong> Jianhan Zhu, University College London; Jun Wang, University College London; Ingemar J. Cox, University College London; and Michael J. Taylor, Microsoft Research Cambridge.<\/p>\n Robust Sparse Rank Learning for Non-Smooth Ranking Measures<\/strong> Zhengya Sun, Chinese Academy of Sciences; Tao Qin, Microsoft Research Asia; Qing Tao, Chinese Academy of Sciences; and Jue Wang, Chinese Academy of Sciences.<\/p>\n Simultaneously Modeling Semantics and Structure of Threaded Discussions: A Sparse Coding Approach and Its Applications<\/strong><\/a> Chen Lin, Fudan University; Jiang-Ming Yang, Microsoft Research Asia; Rui Cai, Microsoft Research Asia; Xin-Jing Wang, Microsoft Research Asia; Wei Wang, Fudan University; and Lei Zhang, Microsoft Research Asia.<\/p>\n Smoothing Clickthrough Data for Web Search Ranking<\/strong><\/a> Jianfeng Gao, Microsoft Research Redmond; Wei Yuan, University of Montreal; Xiao Li, Microsoft Research Redmond; Kefeng Deng, Microsoft; and Jian-Yun Nie, University of Montreal.<\/p>\n SUSHI: Scoring Scaled Samples for Server Selection<\/strong><\/a> Paul Thomas, Commonwealth Scientific and Research Organization; and Milad Shokouhi, Microsoft Research Cambridge.<\/p>\n\n
Papers<\/h2>\n