Proceedings of the 21st ACM international conference on Information and knowledge management最新文献

Authentication of moving range queries 移动范围查询的认证

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398441

Duncan Yung, Eric Lo, Man Lung Yiu

引用次数: 12

Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters 快速候选生成两阶段文档排名:帖子列表交集与布隆过滤器

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398656

N. Asadi, Jimmy J. Lin

引用次数: 22

I want what i need!: analyzing subjectivity of online forum threads 我想要我想要的!:网络论坛话题主体性分析

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398675

P. Biyani, Cornelia Caragea, Amit Singh, P. Mitra

引用次数: 26

A model-based approach for RFID data stream cleansing 基于模型的RFID数据流清理方法

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2396871

Zhou Zhao, Wilfred Ng

{"title":"A model-based approach for RFID data stream cleansing","authors":"Zhou Zhao, Wilfred Ng","doi":"10.1145/2396761.2396871","DOIUrl":"https://doi.org/10.1145/2396761.2396871","url":null,"abstract":"In recent years, RFID technologies have been used in many applications, such as inventory checking and object tracking. However, raw RFID data are inherently unreliable due to physical device limitations and different kinds of environmental noise. Currently, existing work mainly focuses on RFID data cleansing in a static environment (e.g. inventory checking). It is therefore difficult to cleanse RFID data streams in a mobile environment (e.g. object tracking) using the existing solutions, which do not address the data missing issue effectively. In this paper, we study how to cleanse RFID data streams for object tracking, which is a challenging problem, since a significant percentage of readings are routinely dropped. We propose a probabilistic model for object tracking in a mobile environment. We develop a Bayesian inference based approach for cleansing RFID data using the model. In order to sample data from the movement distribution, we devise a sequential sampler that cleans RFID data with high accuracy and efficiency. We validate the effectiveness and robustness of our solution through extensive simulations and demonstrate its performance by using two real RFID applications of human tracking and conveyor belt monitoring.","PeriodicalId":313414,"journal":{"name":"Proceedings of the 21st ACM international conference on Information and knowledge management","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116916864","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}

引用次数: 32

Finding nuggets in IP portfolios: core patent mining through textual temporal analysis 在知识产权组合中寻找掘金:通过文本时间分析挖掘核心专利

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398524

Po Hu, Minlie Huang, Peng Xu, Weichang Li, A. Usadi, Xiaoyan Zhu

引用次数: 21

Generating facets for phone-based navigation of structured data 为基于手机的结构化数据导航生成facet

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398431

Krishna Kummamuru, Ajith Jujjuru, Mayuri Duggirala

{"title":"Generating facets for phone-based navigation of structured data","authors":"Krishna Kummamuru, Ajith Jujjuru, Mayuri Duggirala","doi":"10.1145/2396761.2398431","DOIUrl":"https://doi.org/10.1145/2396761.2398431","url":null,"abstract":"Designing interactive voice systems that have optimum cognitive load on callers has been an active research topic for quite some time. There have been many studies comparing the user preferences on navigation trees with higher depths over higher breadths. In this paper, we consider the navigation of structured data containing various types of attributes using phone-based interactions. This problem is particularly relevant to emerging economies in which innovative voice-based applications are being built to address semi-literate population. We address the problem of identifying the right sequence of facets to be presented to the user for phone-based navigation of the data in two stages. Firstly, we perform extensive user studies in the target population to understand the relation between the nature of facets (attributes) of the data and the cognitive load. Secondly, we propose an algorithm to design optimum navigation trees based on the inferences made in the first phase. We compare the proposed algorithm with the traditional facet generation algorithms with respect to various factors and discuss the optimality of the proposed algorithm.","PeriodicalId":313414,"journal":{"name":"Proceedings of the 21st ACM international conference on Information and knowledge management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498246","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

Comprehension-based result snippets 基于理解的结果片段

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398405

Abhijith Kashyap, Vagelis Hristidis

{"title":"Comprehension-based result snippets","authors":"Abhijith Kashyap, Vagelis Hristidis","doi":"10.1145/2396761.2398405","DOIUrl":"https://doi.org/10.1145/2396761.2398405","url":null,"abstract":"Result snippets are used by most search interfaces to preview query results. Snippets help users quickly decide the relevance of the results, thereby reducing the overall search time and effort. Most work on snippets have focused on text snippets for Web pages in Web search. However, little work has studied the problem of snippets for structured data, e.g., product catalogs. Furthermore, all works have focused on the important goal of creating informative snippets, but have ignored the amount of user effort required to comprehend, i.e., read and digest, the displayed snippets. In particular, they implicitly assume that the comprehension effort or cost only depends on the length of the snippet, which we show is incorrect for structured data. We propose novel techniques to construct snippets of structured heterogeneous results, which not only select the most informative attributes for each result, but also minimize the expected user effort (time) to comprehend these snippets. We create a comprehension model to quantify the effort incurred by users in comprehending a list of result snippets. Our model is supported by an extensive user-study. A key observation is that the user effort for comprehending an attribute across multiple snippets only depends on the number of unique positions (e.g., indentations) where this attribute is displayed and not on the number of occurrences. We analyze the complexity of the snippet construction problem and show that the problem is NP-hard, even when we only consider the comprehension cost. We present efficient approximate algorithms, and experimentally demonstrate their effectiveness and efficiency.","PeriodicalId":313414,"journal":{"name":"Proceedings of the 21st ACM international conference on Information and knowledge management","volume":"7 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124909255","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}

引用次数: 5

Two-part segmentation of text documents 文本文档的两部分分割

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2396862

Deepak P, Karthik Venkat Ramanan, N. Wiratunga, Sadiq Sani

{"title":"Two-part segmentation of text documents","authors":"Deepak P, Karthik Venkat Ramanan, N. Wiratunga, Sadiq Sani","doi":"10.1145/2396761.2396862","DOIUrl":"https://doi.org/10.1145/2396761.2396862","url":null,"abstract":"We consider the problem of segmenting text documents that have a two-part structure such as a problem part and a solution part. Documents of this genre include incident reports that typically involve description of events relating to a problem followed by those pertaining to the solution that was tried. Segmenting such documents into the component two parts would render them usable in knowledge reuse frameworks such as Case-Based Reasoning. This segmentation problem presents a hard case for traditional text segmentation due to the lexical inter-relatedness of the segments. We develop a two-part segmentation technique that can harness a corpus of similar documents to model the behavior of the two segments and their inter-relatedness using language models and translation models respectively. In particular, we use separate language models for the problem and solution segment types, whereas the inter-relatedness between segment types is modeled using an IBM Model 1 translation model. We model documents as being generated starting from the problem part that comprises of words sampled from the problem language model, followed by the solution part whose words are sampled either from the solution language model or from a translation model conditioned on the words already chosen in the problem part. We show, through an extensive set of experiments on real-world data, that our approach outperforms the state-of-the-art text segmentation algorithms in the accuracy of segmentation, and that such improved accuracy translates well to improved usability in Case-based Reasoning systems. We also analyze the robustness of our technique to varying amounts and types of noise and empirically illustrate that our technique is quite noise tolerant, and degrades gracefully with increasing amounts of noise.","PeriodicalId":313414,"journal":{"name":"Proceedings of the 21st ACM international conference on Information and knowledge management","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508448","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}

引用次数: 10

A unified learning framework for auto face annotation by mining web facial images 基于web人脸图像挖掘的人脸自动标注统一学习框架

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398444

Dayong Wang, S. Hoi, Ying He

{"title":"A unified learning framework for auto face annotation by mining web facial images","authors":"Dayong Wang, S. Hoi, Ying He","doi":"10.1145/2396761.2398444","DOIUrl":"https://doi.org/10.1145/2396761.2398444","url":null,"abstract":"Auto face annotation plays an important role in many real-world multimedia information and knowledge management systems. Recently there is a surge of research interests in mining weakly-labeled facial images on the internet to tackle this long-standing research challenge in computer vision and image understanding. In this paper, we present a novel unified learning framework for face annotation by mining weakly labeled web facial images through interdisciplinary efforts of combining sparse feature representation, content-based image retrieval, transductive learning and inductive learning techniques. In particular, we first introduce a new search-based face annotation paradigm using transductive learning, and then propose an effective inductive learning scheme for training classification-based annotators from weakly labeled facial images, and finally unify both transductive and inductive learning approaches to maximize the learning efficacy. We conduct extensive experiments on a real-world web facial image database, in which encouraging results show that the proposed unified learning scheme outperforms the state-of-the-art approaches.","PeriodicalId":313414,"journal":{"name":"Proceedings of the 21st ACM international conference on Information and knowledge management","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827372","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}

引用次数: 34

Information preservation in static index pruning 静态索引剪枝中的信息保存

Proceedings of the 21st ACM international conference on Information and knowledge management Pub Date : 2012-10-29 DOI: 10.1145/2396761.2398673

Ruey-Cheng Chen, Chia-Jung Lee, Chiung-min Tsai, J. Hsiang

引用次数: 5