RIAO Conference最新文献

筛选
英文 中文
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences 评价单音音乐序列相似性的局部版本优化
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931397
P. Hanna, Pascal Ferraro
{"title":"Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences","authors":"P. Hanna, Pascal Ferraro","doi":"10.5555/1931390.1931397","DOIUrl":"https://doi.org/10.5555/1931390.1931397","url":null,"abstract":"Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity generally consider sequences of pitches and durations. Algorithms that have been proposed for measuring melodic similarity rely on geometric representations, string matching techniques, etc. Adaptations of edit distance based algorithms, mainly applied in bioinformatic applications, to the musical domain have already been proposed. However, we present in this paper several experiments in order to optimize these methods. The different possible representations for pitches and durations are discussed and evaluated. Optimizations specific to musical applications are proposed and imply significant improvements of the algorithm. Evaluation of this algorithm led to the best results during the MIREX 2006 symbolic melodic similarity contest.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124070820","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}
引用次数: 20
Evaluating A Personal Information Assistant 评估个人信息助理
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931417
J. Psarras, J. Jose
{"title":"Evaluating A Personal Information Assistant","authors":"J. Psarras, J. Jose","doi":"10.5555/1931390.1931417","DOIUrl":"https://doi.org/10.5555/1931390.1931417","url":null,"abstract":"Personal Information Assistants that search on user's behalf aim to fetch relevant documents on a regular basis. We have developed such assistant system and evaluated it using a long-term, task-oriented approach involving real users. Current evaluation methodologies are inadequate and hence have resorted to a long-term real user study. This paper describes the design and development of our system and the results of the evaluation study.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121463911","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
Smart Qualitative Data (SQUAD): Information Extraction in a Large Document Archive 智能定性数据(SQUAD):大型文档档案中的信息提取
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931452
Maria Milosavljevic, Claire Grover, Louise Corti
{"title":"Smart Qualitative Data (SQUAD): Information Extraction in a Large Document Archive","authors":"Maria Milosavljevic, Claire Grover, Louise Corti","doi":"10.5555/1931390.1931452","DOIUrl":"https://doi.org/10.5555/1931390.1931452","url":null,"abstract":"In this paper, we present the results of an investigation into methodologies and technical solutions for exposing the structured metadata contained within digital qualitative data, to make them more shareable and exploitable. In particular, we develop mechanisms for using Information Extraction (IE) technology to provide user-friendly tools for semi-automating the process of preparing qualitative data in the social science domain for digital archiving, in order to archive enriched marked-up data.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133234451","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}
引用次数: 7
Extracting Useful Information from the Full Text of Fiction 从小说全文中提取有用信息
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931450
Sharon Givon, Maria Milosavljevic
{"title":"Extracting Useful Information from the Full Text of Fiction","authors":"Sharon Givon, Maria Milosavljevic","doi":"10.5555/1931390.1931450","DOIUrl":"https://doi.org/10.5555/1931390.1931450","url":null,"abstract":"In this paper, we describe some experiments in large-scale Information Extraction (IE) focusing on book texts. We investigate the scalability of IE techniques to full-sized books, and the utility of IE techniques in extracting useful information from fiction. In particular, we evaluate a variety of Named Entity Recognition (NER) techniques in identifying the central characters in works of fiction. First, we describe the creation of a gold standard for evaluation, which contains ordered lists of characters for a corpus of classic book texts in Project Gutenberg. Second, we describe several approaches to the task of character identification, where our best model achieves an average coverage score of 78.4% across all central characters. Finally, we propose a number of approaches for future work.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128217217","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
Effectiveness of Rich Document Representation in XML Retrieval 富文档表示在XML检索中的有效性
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931413
F. Raja, Mostafa Keikha, M. Rahgozar, F. Oroumchian
{"title":"Effectiveness of Rich Document Representation in XML Retrieval","authors":"F. Raja, Mostafa Keikha, M. Rahgozar, F. Oroumchian","doi":"10.5555/1931390.1931413","DOIUrl":"https://doi.org/10.5555/1931390.1931413","url":null,"abstract":"Information Retrieval (IR) systems are built with different goals in mind. Some IR systems target high precision that is to have more relevant documents on the first page of their results. Other systems may target high recall that is finding as many references as possible. In this paper we present a method of document representation called RDR to build XML retrieval engines with high specificity; that is finding more relevant documents that are mostly about the query topic. The Rich Document Representation (RDR) is a method of representing the content of a document with logical terms and statements. The conjecture is that since RDR is a better representation of the document content it will produce higher precision. In our implementation, we used the Vector Space model to compute the similarity between the XML elements and queries. Our experiments are conducted on INEX 2004 test collection. The results indicate that the use of richer features such as logical terms or statements for XML retrieval tends to produce more focused retrieval. Therefore it is a suitable document representation when users need only a few more specific references and are more interested in precision than recall.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974196","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
Estimating Importance Features for Fact Mining (With a Case Study in Biography Mining) 估算事实挖掘的重要特征(以传记挖掘为例)
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931464
S. F. Adafre, M. de Rijke
{"title":"Estimating Importance Features for Fact Mining (With a Case Study in Biography Mining)","authors":"S. F. Adafre, M. de Rijke","doi":"10.5555/1931390.1931464","DOIUrl":"https://doi.org/10.5555/1931390.1931464","url":null,"abstract":"We present a transparent model for ranking sentences that incorporates topic relevance as well as an aboutness and importance feature. We describe and compare five methods for estimating the importance feature. The two key features that we use are graph-based ranking and ranking based on reference corpora of sentences known to be important. Independently those features do not improve over the baseline, but combined they do. While our experimental evaluation focuses on informational queries about people, our importance estimation methods are completely general and can be applied to any topic.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122879087","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
Capturing Sentence Prior for Query-Based Multi-Document Summarization 基于查询的多文档摘要的句子先验捕获
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931465
Jagadeesh Jagarlamudi, Prasad Pingali, Vasudeva Varma
{"title":"Capturing Sentence Prior for Query-Based Multi-Document Summarization","authors":"Jagadeesh Jagarlamudi, Prasad Pingali, Vasudeva Varma","doi":"10.5555/1931390.1931465","DOIUrl":"https://doi.org/10.5555/1931390.1931465","url":null,"abstract":"In this paper, we have considered a real world information synthesis task, generation of a fixed length multi document summary which satisfies a specific information need. This task was mapped to a topic-oriented, informative multi-document summarization. We also tried to estimate, given the human written reference summaries and the document set, the maximum performance (ROUGE scores) that can be achieved by an extraction-based summarization technique. Motivated by the observation that the current approaches are far behind the estimated maximum performance, we have looked at Information Retrieval techniques to improve the relevance scoring of sentences towards information need. Following information theoretic approach we have identified a measure to capture the notion of importance or prior of a sentence. Following a different decomposition of Probability Ranking Principle, the calculated importance/prior is incorporated into the final sentence scoring by weighted linear combination. In order to evaluate the performance, we have explored information sources like WWW and encyclopedia in computing the information measure in a set of different experiments. The t-test analysis of the improvement on DUC 2005 data set is found to be significant (p ~ 0.05). The same system has outperformed rest of the systems at DUC 2006 challenge in terms of ROUGE scores with a significant margin over the next best system.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126205956","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
Construction of a Vietnamese Corpora for Named Entity Recognition 越南语命名实体识别语料库的构建
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931459
ThaoPham Thi Xuan, Ai Kawazoe, Dinh Dien, Nigel Collier, Tran Quoc Tri
{"title":"Construction of a Vietnamese Corpora for Named Entity Recognition","authors":"ThaoPham Thi Xuan, Ai Kawazoe, Dinh Dien, Nigel Collier, Tran Quoc Tri","doi":"10.5555/1931390.1931459","DOIUrl":"https://doi.org/10.5555/1931390.1931459","url":null,"abstract":"In order to build an automatic named entity recognition (NER) system using a machine learning approach, a large tagged corpus is widely seen as one necessary knowledge resource. Nevertheless, manual construction is time consuming, labor intensive and expensive. Building NER corpora for European languages has been extensively studied while some less-studied languages such as Vietnamese have not yet received much attention. This paper describes construction of a Vietnamese corpus, Vietnamese guidelines for annotators and a tagging tool that we make publicly available. We report on a comparison with the English named entity (NE) corpus in our multilingual NER system.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125012418","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}
引用次数: 8
Using Markov Chains to Exploit Word Relationships in Information Retrieval 利用马尔可夫链挖掘信息检索中的词关系
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931428
Guihong Cao, Jian-Yun Nie, Jing Bai
{"title":"Using Markov Chains to Exploit Word Relationships in Information Retrieval","authors":"Guihong Cao, Jian-Yun Nie, Jing Bai","doi":"10.5555/1931390.1931428","DOIUrl":"https://doi.org/10.5555/1931390.1931428","url":null,"abstract":"Document expansion and query expansion aim to add related terms into document and query representations in order to make them more complete. However, most previous studies are limited in two respects: They use either query expansion or document expansion, but not both; expansion has been limited to directly related words. In this paper, we propose a more general approach: both document and query representations are expanded, and the expansion process also exploits indirect term relationships. The whole process is implemented through Markov chains. Our experiments show that each of these extensions brings additional improvements.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126897602","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
Selecting Automatically the Best Query Translations 自动选择最佳查询翻译
RIAO Conference Pub Date : 2007-05-30 DOI: 10.5555/1931390.1931419
Pierre-Yves Berger, J. Savoy
{"title":"Selecting Automatically the Best Query Translations","authors":"Pierre-Yves Berger, J. Savoy","doi":"10.5555/1931390.1931419","DOIUrl":"https://doi.org/10.5555/1931390.1931419","url":null,"abstract":"In order to search corpora written in two or more languages, the simplest and most efficient approach is to translate the query submitted into the required language(s). To achieve this goal, we developed an IR model based on translation tools freely available on the Web (bilingual machine-readable dictionaries, machine translation systems). When comparing the retrieval effectiveness of manually and automatically translated queries, we found that manual translation outperformed machine-based approaches, yet performance differences varied from one language to the text. Moreover, when analyzing query-by-query performances, we found that query performances based on machine-based translations varied a great deal. We then wondered whether or not we could predict the retrieval performance of a translated query and apply this knowledge to select the best translation(s). To do so we designed and evaluated a predictive system based on logistic regression and then used it to select the top most appropriate machine-based translations. Using a set of 99 queries and a documents collection available in the German and Spanish languages (extracted from the CLEF-2001 and 2002 test suites), we show that the retrieval performance of the suggested query translation selection procedure is statistically better than the single best MT system, but still inferior to the retrieval performances resulting from manual translations.","PeriodicalId":120472,"journal":{"name":"RIAO Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656904","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
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学术官方微信