发布求助
文献互助 智能选刊 最新文献

RIAO Conference最新文献

筛选
英文 中文
Towards a collection-based results diversification 朝着以集合为基础的结果多样化发展
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937105
J. A. Akinyemi, C. Clarke, M. Kolla
{"title":"Towards a collection-based results diversification","authors":"J. A. Akinyemi, C. Clarke, M. Kolla","doi":"10.5555/1937055.1937105","DOIUrl":"https://doi.org/10.5555/1937055.1937105","url":null,"abstract":"We present a method that introduces diversity into document retrieval using clusters of top-m terms obtained from the top-k retrieved documents through pseudo-relevance feedback. Terms from each cluster are used to automatically expand the original query. We evaluate the effectiveness of our method using a non-traditional effectiveness evaluation method, which directly measures the level of diversification by computing the cosine similarity between top-k retrieved documents based on (i) the original query and (ii) the expanded queries. Our results indicate that we can increase diversity without compromising retrieval quality.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123508439","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}
引用次数: 3
Discovery of logic relations for text mining adaptation using unlabeled data 发现使用未标记数据进行文本挖掘的逻辑关系
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937085
Ki Chan, Wai Lam, Tak-Lam Wong
{"title":"Discovery of logic relations for text mining adaptation using unlabeled data","authors":"Ki Chan, Wai Lam, Tak-Lam Wong","doi":"10.5555/1937055.1937085","DOIUrl":"https://doi.org/10.5555/1937055.1937085","url":null,"abstract":"We have developed a framework to discover new logic formulae for the adaptation of first-order logic knowledge from a source domain to a target domain for solving the same task. We investigate an approach of adapting the source domain model, represented in Markov Logic Network (MLN), to the target domain using unlabeled data only. The existing logic formulae in the source domain MLN may not be sufficient for the target domain. New logic formulae for are discovered by analyzing the correlations between the candidate relations and the core relations.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131572111","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}
引用次数: 0
Hypios in the garden of user data Hypios在用户数据的花园里
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937112
M. Stanković, Benjamin Roth, Klaus Speidel
{"title":"Hypios in the garden of user data","authors":"M. Stanković, Benjamin Roth, Klaus Speidel","doi":"10.5555/1937055.1937112","DOIUrl":"https://doi.org/10.5555/1937055.1937112","url":null,"abstract":"In this paper, we describe the hypios problem solving platform and the various Information Retrieval (IR) research directions we are applying in our work. We share our initial experiences.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130743021","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
Opinion finding in blogs: a passage-based language modeling approach blog中的意见查找:基于段落的语言建模方法
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937093
M. S. Missen, M. Boughanem, G. Cabanac
{"title":"Opinion finding in blogs: a passage-based language modeling approach","authors":"M. S. Missen, M. Boughanem, G. Cabanac","doi":"10.5555/1937055.1937093","DOIUrl":"https://doi.org/10.5555/1937055.1937093","url":null,"abstract":"In this work, we propose a Passage-Based Language Modeling (LM) approach for Opinion Finding in Blogs. Our decision to use Language Modeling in this work is totally based on the importance of passages in blogposts and performance LM has given in various Opinion Detection approaches. In addition to this, we propose a novel method for bi-dimensional Query Expansion with relevant and opinionated terms using Wikipedia and Relevance-Feedback mechanism respectively. Besides all this, we also compare the performance of three Passage-based document ranking functions (Linear, Avg, Max). For evaluation purposes, we use the data collection of TREC Blog06 with 50 topics of TREC 2006 over TREC provided best baseline with opinion finding MAP of 0.3022. Our approach gives a MAP improvement of almost 9.29% over best TREC provided baseline (baseline4).","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130754943","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
Towards text-based recommendations 迈向基于文本的推荐
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937089
Damien Poirier, Isabelle Tellier, F. Fessant, Julien Schluth
{"title":"Towards text-based recommendations","authors":"Damien Poirier, Isabelle Tellier, F. Fessant, Julien Schluth","doi":"10.5555/1937055.1937089","DOIUrl":"https://doi.org/10.5555/1937055.1937089","url":null,"abstract":"Recommender systems have become, like search engines, a tool that cannot be ignored by a website with a large selection of products, music, news or simply webpages. The performance of this kind of systems depends on a large amount of information. Meanwhile, the amount of information available in the Web is continuously growing. In this paper, we propose to provide recommendation from unstructured textual data. The method has two steps. First, subjective texts are labelled according to their expressed opinion. Second, the results are used to provide recommendations thanks to a collaborative filtering technique. We describe the complete processing chain and evaluate it.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133714052","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}
引用次数: 12
An indexed full-text search method of printed document images with an M-tree 一个带m树的打印文档图像的索引全文搜索方法
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937071
Hajime Imura, Yuzuru Tanaka
{"title":"An indexed full-text search method of printed document images with an M-tree","authors":"Hajime Imura, Yuzuru Tanaka","doi":"10.5555/1937055.1937071","DOIUrl":"https://doi.org/10.5555/1937055.1937071","url":null,"abstract":"This paper describes an indexed full-text search method of printed document images for the occurrences of a specified character string image. It is based on N-gram-based indexing with an M-tree index structure. It is important to facilitate a full-text search method of historical letterpress printing collections to be able to deal with them. The proposed full-text search method is independent of difference of languages and fonts because it uses a pseudo-coding scheme that is based on the statistical features of character shapes. Conventional Word Spotting methods need a sequential scan of the whole document image and a matching calculation of the whole descriptor sequence of a document. The proposed N-gram-based indexing method accelerates the search process with an M-tree. Our method was evaluated in terms of its search time and of recall-precision curve for N-gram-based query strings. Our experiments demonstrated that the proposed approach achieves search times that are one hundred times faster improvement about search time.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949854","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}
引用次数: 2
Click-graph modeling for facet attribute estimation of web search queries 网页搜索查询面属性估计的点击图建模
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937103
Sumio Fujita, Keigo Machinaga, G. Dupret
{"title":"Click-graph modeling for facet attribute estimation of web search queries","authors":"Sumio Fujita, Keigo Machinaga, G. Dupret","doi":"10.5555/1937055.1937103","DOIUrl":"https://doi.org/10.5555/1937055.1937103","url":null,"abstract":"We use clickthrough data of a Japanese commercial search engine to evaluate the similarity between a query and a facet category from the patterns of clicks on URLs. Using a small number of seed queries, we extract a set of topical words forming search queries together with the same facet directive words, e.g., 'recipe' in 'curry recipe' or 'apple pie recipe'. We used a PageRank-like random walk approach on query-URL bipartite graphs called \"Biased ClickRank\" to propagate facet attributes through click bipartite graphs. We noticed that queries to URL links are too sparse to capture query variations whereas queries to domain links are too coarse to discriminate among the different usages of broadly related queries. We introduced edges and vertices corresponding to the decomposed URL paths into the click graph to capture the click pattern differences at an appropriate granularity level. Our expanded graph model improved recalls as well as average precision against baseline graph models.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129137356","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}
引用次数: 14
A comparison of discriminative classifiers for web news content extraction 判别分类器在网络新闻内容提取中的比较
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937099
Alex Spengler, Antoine Bordes, P. Gallinari
{"title":"A comparison of discriminative classifiers for web news content extraction","authors":"Alex Spengler, Antoine Bordes, P. Gallinari","doi":"10.5555/1937055.1937099","DOIUrl":"https://doi.org/10.5555/1937055.1937099","url":null,"abstract":"Until now, approaches to web content extraction have focused on random field models, largely neglecting large margin methods. Structured large margin methods, however, have recently shown great practical success. We compare, for the first time, greedy and structured support vector machines with conditional random fields on a real-world web news content extraction task, showing that large margin approaches are indeed competitive with random field models.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123086612","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}
引用次数: 4
The semantics of query modification 查询修改的语义
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937101
V. Hollink, T. Tsikrika, A. D. Vries
{"title":"The semantics of query modification","authors":"V. Hollink, T. Tsikrika, A. D. Vries","doi":"10.5555/1937055.1937101","DOIUrl":"https://doi.org/10.5555/1937055.1937101","url":null,"abstract":"We present a method that exploits 'linked data' to determine semantic relations between consecutive user queries. Our method maps queries onto concepts in linked data and searches the linked data graph for direct or indirect relations between the concepts. By comparing relations between large numbers of user queries, we identify semantic modification patterns. The application of this method to the logs of an image search engine revealed interesting usage patterns, such as that users often search for two entities sharing a property (e.g., two players from the same team). These patterns can be used to generate query suggestions. Results of preliminary experiments show that the patterns enable us to generate suggestions for more queries than a method purely based on search-log statistics.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115755837","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}
引用次数: 6
Inserting rhetorical predicates for quasi-abstractive summarization 插入修辞谓语进行准抽象概括
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937090
Horacio Saggion
{"title":"Inserting rhetorical predicates for quasi-abstractive summarization","authors":"Horacio Saggion","doi":"10.5555/1937055.1937090","DOIUrl":"https://doi.org/10.5555/1937055.1937090","url":null,"abstract":"We investigate the problem of inserting rhetorical predicates (e.g. \"to present\", \"to discuss\", \"to indicate\", \"to show\") during non extractive summary generation and compare various algorithms for the task which we trained over a set of human written summaries. The algorithms which use a set of features previously introduced in the summarization literature achieve between 57% to 62% accuracy depending on the machine learning algorithm used. We draw conclusions with respect to the use of context during predicate prediction.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900669","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信