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

RIAO Conference最新文献

筛选
英文 中文
The effects of time on query flow graph-based models for query suggestion 时间对基于查询流图的查询建议模型的影响
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937102
R. Baraglia, F. M. Nardini, C. Castillo, R. Perego, D. Donato, F. Silvestri
{"title":"The effects of time on query flow graph-based models for query suggestion","authors":"R. Baraglia, F. M. Nardini, C. Castillo, R. Perego, D. Donato, F. Silvestri","doi":"10.5555/1937055.1937102","DOIUrl":"https://doi.org/10.5555/1937055.1937102","url":null,"abstract":"A recent query-log mining approach for query recommendation is based on Query Flow Graphs, a markov-chain representation of the query reformulation process followed by users of Web Search Engines trying to satisfy their information needs. In this paper we aim at extending this model by providing methods for dealing with evolving data. In fact, users' interests change over time, and the knowledge extracted from query logs may suffer an aging effect as new interesting topics appear. Starting from this observation validated experimentally, we introduce a novel algorithm for updating an existing query flow graph. The proposed solution allows the recommendation model to be kept always updated without reconstructing it from scratch every time, by incrementally merging efficiently the past and present data.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"111 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":"117179823","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}
引用次数: 25
Mining news streams using cross-stream sequential patterns 使用跨流顺序模式挖掘新闻流
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937079
Robert Gwadera, F. Crestani
{"title":"Mining news streams using cross-stream sequential patterns","authors":"Robert Gwadera, F. Crestani","doi":"10.5555/1937055.1937079","DOIUrl":"https://doi.org/10.5555/1937055.1937079","url":null,"abstract":"We present a new method for mining streams of news stories using cross-stream sequential patterns. We cluster stories reporting the same event across the streams within a given time window. For every discovered cluster of stories we create an itemset-sequence consisting of stream identifiers of the stories in the cluster, where the sequence is ordered according to the timestamps of the stories. For every such itemset-sequence we record exact timestamps and content similarities between the respective stories, thus building a collection of itemset-sequences that we use for two tasks: (I) to discover cross-stream dependencies in terms of frequent sequential publishing patterns and content similarity and (II) to rank the streams of news stories with respect to timeliness of reporting important events and content authority. We tested the applicability of the presented method on a collection of streams of news stories which was gathered from major world news agencies.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"27 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":"114912827","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
A double layer indexing structure for flexible querying of XML documents 用于灵活查询XML文档的双层索引结构
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937086
S. Marrara, E. Panzeri, G. Pasi
{"title":"A double layer indexing structure for flexible querying of XML documents","authors":"S. Marrara, E. Panzeri, G. Pasi","doi":"10.5555/1937055.1937086","DOIUrl":"https://doi.org/10.5555/1937055.1937086","url":null,"abstract":"This paper presents an advanced indexing structure for XML documents which allows the evaluation of loose constraints on both structure and content of XML documents. This structure is an extension of the one presented in [1], and allows an evaluation of flexible queries performed into two subsequent steps: content-based matching and structure-based matching (applied to documents pre-selected by the first evaluation phase)","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"120 4 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":"128486404","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
Stylometric features for emotion level classification in news related blogs 新闻相关博客中情感等级分类的文体特征
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937087
E. Lex, M. Granitzer, Markus Muhr, A. Juffinger
{"title":"Stylometric features for emotion level classification in news related blogs","authors":"E. Lex, M. Granitzer, Markus Muhr, A. Juffinger","doi":"10.5555/1937055.1937087","DOIUrl":"https://doi.org/10.5555/1937055.1937087","url":null,"abstract":"Breaking news and events are often posted in the blogo-sphere before they are published by any media agency. Therefore, the blogosphere is a valuable resource for news-related blog analysis. However, it is crucial to first sort out news-unrelated content like personal diaries or advertising blogs. Besides, there are different levels of emotionality or involvement which bias the news information to a certain extent. In our work, we evaluate topic-independent stylometric features to classify blogs into news versus rest and to assess the emotionality in these blogs. We apply several text classifiers to determine the best performing combination of features and algorithms. Our experiments revealed that with simple style features, blogs can be classified into news versus rest and their emotionality can be assessed with accuracy values of almost 80%.","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":"130472468","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
Voting for related entities 关联实体投票
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937057
Rodrygo L. T. Santos, C. Macdonald, I. Ounis
{"title":"Voting for related entities","authors":"Rodrygo L. T. Santos, C. Macdonald, I. Ounis","doi":"10.5555/1937055.1937057","DOIUrl":"https://doi.org/10.5555/1937055.1937057","url":null,"abstract":"Entity search is an emerging research topic in Information Retrieval, where the goal is to rank not documents, but entities in response to a given query. A particularly challenging example of this search scenario is when a user's underlying information need is for a list of entities related to a given entity, represented in the query. In this paper, we propose to tackle this problem as a voting process, by considering the occurrence of an entity among the top ranked documents for a given query as a vote for the existence of a relationship between this and the entity in the query. Our proposed approach is evaluated using a large Web test collection, in the context of the TREC 2009 Entity track. The results attest the effectiveness of our approach when compared to the top participants at TREC, with unparalleled gains in terms of recall. Moreover, through a comprehensive failure analysis, we uncover important issues to be considered when tackling this new search scenario and draw valuable insights towards achieving an effective related entity search performance.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"2 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":"126400348","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}
引用次数: 19
Predicting query performance using query, result, and user interaction features 使用查询、结果和用户交互特性预测查询性能
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937104
Qi Guo, Ryen W. White, S. Dumais, Jue Wang, Blake Anderson
{"title":"Predicting query performance using query, result, and user interaction features","authors":"Qi Guo, Ryen W. White, S. Dumais, Jue Wang, Blake Anderson","doi":"10.5555/1937055.1937104","DOIUrl":"https://doi.org/10.5555/1937055.1937104","url":null,"abstract":"The high cost of search engine evaluation makes techniques for accurately predicting engine effectiveness valuable. In this paper we present a study in which we use features of the query, search results, and user interaction with the search results to predict query performance. We establish which features are most useful, study the effect of different classes of features, and examine the effect of query frequency on our predictions. Our findings show that performance predictions using result and interaction features are substantially better than those obtained using only query features. Such results can support automated search engine evaluation methods and new query processing capabilities.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"138 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":"121634135","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}
引用次数: 44
Clustering and semantics preservation in cultural heritage information spaces 文化遗产信息空间的聚类与语义保存
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937078
Javier Pereira, Felipe Schmidt, Pedro Contreras, F. Murtagh, H. Astudillo
{"title":"Clustering and semantics preservation in cultural heritage information spaces","authors":"Javier Pereira, Felipe Schmidt, Pedro Contreras, F. Murtagh, H. Astudillo","doi":"10.5555/1937055.1937078","DOIUrl":"https://doi.org/10.5555/1937055.1937078","url":null,"abstract":"In this paper, we analyze the preservation of original semantic similarity among objects when dimensional reduction is applied on the original data source and a further clustering process is performed on dimensionally reduced data. An experiment is designed to test Baire, or longest common prefix ultrametric, and K-Means when prior random projection is applied. A data matrix extracted from a cultural heritage database has been prepared for the experiment. Given that the random projection produces a vector with components ranging on the interval [0, 1], clusters are obtained at different precision levels. Next, the mean semantic similarity of clusters is calculated using a modified version of the Jaccard index. Our findings show that semantics is difficult to preserve by these methods. However, a Student's hypothesis test on mean similarity indicates that Baire clusters objects are semantically better than K-Means when we increase the digit precision, but paying an increasing cost for orphan clustered objects. Despite this cost, it is argued that the ultrametric technique provides an efficient process to detect semantic homogeneity on the original data space.","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":"133894004","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
Non-productive machine transliteration 非生产性机器音译
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937059
Satoshi Sato
{"title":"Non-productive machine transliteration","authors":"Satoshi Sato","doi":"10.5555/1937055.1937059","DOIUrl":"https://doi.org/10.5555/1937055.1937059","url":null,"abstract":"This paper proposes a new framework of machine transliteration, called non-productive machine transliteration. In this framework, it is assumed that a large candidate list including the correct transliteration is given. Therefore, the transliteration problem is simplified into the selection problem of the correct entry from the large list. We have developed an efficient algorithm of this framework and applied it to English-Japanese transliteration of person names. Experimental results show that our algorithm is practical even if the size of the candidate list is over a million.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"12 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":"132864148","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
Analysis of robustness in trust-based recommender systems 基于信任的推荐系统鲁棒性分析
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937080
Zunping Cheng, N. Hurley
{"title":"Analysis of robustness in trust-based recommender systems","authors":"Zunping Cheng, N. Hurley","doi":"10.5555/1937055.1937080","DOIUrl":"https://doi.org/10.5555/1937055.1937080","url":null,"abstract":"Much research has recently been carried out on the incorporation of trust models into recommender systems. It is generally understood that trust-based recommender systems can help to improve the accuracy of predictions. Moreover they provide greater robustness against profile injection attacks by malicious users. In this paper we analyze these contentions in the context of two trust-based algorithms. We note that one of the characteristics of trust-based algorithms is that ratings are often exposed in the user population in order for users to develop opinions on the trustworthiness of their peers. We will argue that exposing ratings presents a robustness vulnerability in these systems and we will show how this vulnerability can be exploited in the development of profile injection attacks. We conclude that the improved accuracy obtained in trust-based systems may well come at a cost of decreased robustness. In the end, trust models should be selected very carefully when building trust-based collaborative filtering (CF) systems.","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":"125805614","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}
引用次数: 9
Cluster-based navigation for a virtual museum 基于集群的虚拟博物馆导航
RIAO Conference Pub Date : 2010-04-28 DOI: 10.5555/1937055.1937109
Peter W. Eklund, P. Goodall, T. Wray
{"title":"Cluster-based navigation for a virtual museum","authors":"Peter W. Eklund, P. Goodall, T. Wray","doi":"10.5555/1937055.1937109","DOIUrl":"https://doi.org/10.5555/1937055.1937109","url":null,"abstract":"The Virtual Museum of the Pacific (VMP) is designed around the use of Formal Concept Analysis [4] to organize digital library content. It creates an associative network based on semantic themes according to a museological view of content. The system allows the extensible creation of new views, the addition of new attributes and contains a social tagging interface that encourages the Museum's stakeholders to annotate content and build custom views of the collection according to their communities of interest.","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":"129782224","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
下一页 尾页
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学术官方微信