Proceedings of the 19th ACM international conference on Information and knowledge management最新文献_第9页

FACeTOR: cost-driven exploration of faceted query results FACeTOR:对分面查询结果进行成本驱动的探索

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871530

Abhijith Kashyap, Vagelis Hristidis, M. Petropoulos

{"title":"FACeTOR: cost-driven exploration of faceted query results","authors":"Abhijith Kashyap, Vagelis Hristidis, M. Petropoulos","doi":"10.1145/1871437.1871530","DOIUrl":"https://doi.org/10.1145/1871437.1871530","url":null,"abstract":"Faceted navigation is being increasingly employed as an effective technique for exploring large query results on structured databases. This technique of mitigating information-overload leverages metadata of the query results to provide users with facet conditions that can be used to progressively refine the user's query and filter the query results. However, the number of facet conditions can be quite large, thereby increasing the burden on the user. We present the FACeTOR system that proposes a cost-based approach to faceted navigation. At each step of the navigation, the user is presented with a subset of all possible facet conditions that are selected such that the overall expected navigation cost is minimized and every result is guaranteed to be reachable by a facet condition. We prove that the problem of selecting the optimal facet conditions at each navigation step is NP-Hard, and subsequently present two intuitive heuristics employed by FACeTOR. Our user study at Amazon Mechanical Turk shows that FACeTOR reduces the user navigation time compared to the cutting edge commercial and academic faceted search algorithms. The user study also confirms the validity of our cost model. We also present the results of an extensive experimental evaluation on the performance of the proposed approach using two real datasets. FACeTOR is available at http://db.cse.buffalo.edu/facetor/.","PeriodicalId":310611,"journal":{"name":"Proceedings of the 19th ACM international conference on Information and knowledge management","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 73

Automatically weighting tags in XML collection 自动加权标记在XML集合

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871603

Dexi Liu, Changxuan Wan, Lei Chen, X. Liu

引用次数: 10

FALCON: seamless access to meeting data from the inbox and calendar 猎鹰:从收件箱和日历中无缝访问会议数据

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871780

Peter Bjellerup, Karl J. Cama, Mukundan Desikan, Yi Guo, Ajinkya Kale, J. Lai, Nizar Lethif, Jie Lu, Mercan Topkara, Stephan H. Wissel

引用次数: 5

Relevance-index size tradeoff in contextual advertising 上下文广告中相关性指数大小的权衡

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871713

GM PavanKumar, Krishna P. Leela, Mehul Parsana, S. Garg

{"title":"Relevance-index size tradeoff in contextual advertising","authors":"GM PavanKumar, Krishna P. Leela, Mehul Parsana, S. Garg","doi":"10.1145/1871437.1871713","DOIUrl":"https://doi.org/10.1145/1871437.1871713","url":null,"abstract":"In Contextual advertising, textual ads relevant to the content in a webpage are embedded in the page. Content keywords are extracted offline by crawling webpages and then stored in an index for fast serving. Given a page, ad selection involves index lookup, computing similarity between the keywords of the page and those of candidate ads and returning the top-k scoring ads. In this approach, there is a tradeoff between relevance and index size where better relevance can be achieved if there are no limits on the index size. However, the assumption of unlimited index size is not practical due to the large number of pages on the Web and stringent requirements on the serving latency. Secondly, page visits on the web follows power-law distribution where a significant proportion of the pages are visited infrequently, also called the tail pages. Indexing tail pages is not efficient given that these pages are accessed very infrequently. We propose a novel mechanism to mitigate these problems in the same framework. The basic idea is to index the same keyword vector for a set of similar pages. The scheme involves learning a website specific hierarchy from (page, URL) pairs of the website. Next, keywords are populated on the nodes via bottom-up traversal over the hierarchy. We evaluate our approach on a human labeled dataset where our approach has higher nDCG compared to a recent approach even though the index size of our approach is 7 times less than index size of the recent approach.","PeriodicalId":310611,"journal":{"name":"Proceedings of the 19th ACM international conference on Information and knowledge management","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124153262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Assessor error in stratified evaluation 分层评估中的评估员误差

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871508

William Webber, Douglas W. Oard, Falk Scholer, Bruce Hedin

{"title":"Assessor error in stratified evaluation","authors":"William Webber, Douglas W. Oard, Falk Scholer, Bruce Hedin","doi":"10.1145/1871437.1871508","DOIUrl":"https://doi.org/10.1145/1871437.1871508","url":null,"abstract":"Several important information retrieval tasks, including those in medicine, law, and patent review, have an authoritative standard of relevance, and are concerned about retrieval completeness. During the evaluation of retrieval effectiveness in these domains, assessors make errors in applying the standard of relevance, and the impact of these errors, particularly on estimates of recall, is of crucial concern. Using data from the interactive task of the TREC Legal Track, this paper investigates how reliably the yield of relevant documents can be estimated from sampled assessments in the presence of assessor error, particularly where sampling is stratified based upon the results of participating retrieval systems. We show that assessor error is in general a greater source of inaccuracy than sampling error. A process of appeal and adjudication, such as used in the interactive task, is found to be effective at locating many assessment errors; but the process is expensive if complete, and biased if incomplete. An unbiased double-sampling method for resolving assessment error is proposed, and shown on representative data to be more efficient and accurate than appeal-based adjudication.","PeriodicalId":310611,"journal":{"name":"Proceedings of the 19th ACM international conference on Information and knowledge management","volume":"1992 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

Brown dwarf: a P2P data-warehousing system 棕矮星:一个P2P数据仓库系统

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871777

Katerina Doka, Dimitrios Tsoumakos, N. Koziris

引用次数: 1

Latent interest-topic model: finding the causal relationships behind dyadic data 潜在兴趣-主题模型:寻找二元数据背后的因果关系

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871521

N. Kawamae

{"title":"Latent interest-topic model: finding the causal relationships behind dyadic data","authors":"N. Kawamae","doi":"10.1145/1871437.1871521","DOIUrl":"https://doi.org/10.1145/1871437.1871521","url":null,"abstract":"This paper presents a hierarchical generative model that captures the latent relation of cause and effect underlying user behavioral-originated data such as papers, twitter and purchase history. Our proposel, the Latent Interest Topic model (LIT), introduces a latent variable into each document and each author layor in a coherent generative model. We call the former variable the document class, and the latter variable the author class, where these classes are indicator variables that allow the inclusion of different types of probability, and can be shared over documents with similar content and authors with similar interests, respectively. Significantly, unlike other works, LIT differentiates, respectively, document topics and user interests by using these classes. Consequently, LIT is superior to previous models in explaining the causal relationships behind the data by merging similar distributions; it also makes the computation process easier. Experiments on a research paper corpus show that the proposed model can well capture document and author classes, and reduce the dimensionality of documents to a low-dimensional author-document space, making it useful as a generative model.","PeriodicalId":310611,"journal":{"name":"Proceedings of the 19th ACM international conference on Information and knowledge management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129267287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

Communication motifs: a tool to characterize social communications 交际母题:描述社会交际特征的工具

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871694

Qiankun Zhao, Yuan Tian, Qi He, Nuria Oliver, R. Jin, Wang-Chien Lee

引用次数: 90

Exploiting site-level information to improve web search 利用站点级信息来改进网络搜索

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871630

A. Broder, E. Gabrilovich, V. Josifovski, G. Mavromatis, Donald Metzler, Jane Wang

引用次数: 16

Online annotation of text streams with structured entities 具有结构化实体的文本流的在线注释

Proceedings of the 19th ACM international conference on Information and knowledge management Pub Date : 2010-10-26 DOI: 10.1145/1871437.1871446

K. Pu, Oktie Hassanzadeh, Richard Drake, Renée J. Miller

引用次数: 14