首页 > 最新文献

Int. J. Knowl. Web Intell.最新文献

英文 中文
Classification of English language learner writing errors using a parallel corpus with SVM 基于支持向量机并行语料库的英语学习者写作错误分类
Pub Date : 2014-10-01 DOI: 10.1504/IJKWI.2014.065063
Brendan Flanagan, Chengjiu Yin, Takahiko Suzuki, S. Hirokawa
In order to overcome mistakes, learners need feedback to prompt reflection on their errors. This is a particularly important issue in education systems as the system effectiveness in finding errors or mistakes could have an impact on learning. Finding errors is essential to providing appropriate guidance in order for learners to overcome their flaws. Traditionally the task of finding errors in writing takes time and effort. The authors of this paper have a long-term research goal of creating tools for learners, especially autonomous learners, to enable them to be more aware of their errors and provide a way to reflect on the errors. As a part of this research, we propose the use of a classifier to automatically analyse and determine the errors in foreign language writing. For the experiment in this paper, we collected random sentences from the Lang-8 website that had been written by foreign language learners. Using predefined error categories, we manually classified the sentences to use as machine learning training data. This was then used to train a classifier by applying SVM machine learning to the training data. As the manual classification of training data takes time, it is intended that the classifier would be used to accelerate the process used for generating further training data.
为了克服错误,学习者需要反馈来促使他们反思自己的错误。这在教育系统中是一个特别重要的问题,因为系统在发现错误或错误方面的有效性可能会影响学习。发现错误对于为学习者提供适当的指导以克服他们的缺点至关重要。传统上,找出写作中的错误需要花费时间和精力。本文作者的长期研究目标是为学习者,特别是自主学习者创造工具,使他们能够更好地意识到自己的错误,并提供一种反思错误的方法。作为本研究的一部分,我们提出使用分类器来自动分析和确定外语写作中的错误。在本文的实验中,我们从Lang-8网站上随机收集了一些外语学习者写的句子。使用预定义的错误类别,我们手动对句子进行分类,以用作机器学习训练数据。然后通过对训练数据应用支持向量机机器学习来训练分类器。由于训练数据的手动分类需要时间,因此打算使用分类器来加速用于生成进一步训练数据的过程。
{"title":"Classification of English language learner writing errors using a parallel corpus with SVM","authors":"Brendan Flanagan, Chengjiu Yin, Takahiko Suzuki, S. Hirokawa","doi":"10.1504/IJKWI.2014.065063","DOIUrl":"https://doi.org/10.1504/IJKWI.2014.065063","url":null,"abstract":"In order to overcome mistakes, learners need feedback to prompt reflection on their errors. This is a particularly important issue in education systems as the system effectiveness in finding errors or mistakes could have an impact on learning. Finding errors is essential to providing appropriate guidance in order for learners to overcome their flaws. Traditionally the task of finding errors in writing takes time and effort. The authors of this paper have a long-term research goal of creating tools for learners, especially autonomous learners, to enable them to be more aware of their errors and provide a way to reflect on the errors. As a part of this research, we propose the use of a classifier to automatically analyse and determine the errors in foreign language writing. For the experiment in this paper, we collected random sentences from the Lang-8 website that had been written by foreign language learners. Using predefined error categories, we manually classified the sentences to use as machine learning training data. This was then used to train a classifier by applying SVM machine learning to the training data. As the manual classification of training data takes time, it is intended that the classifier would be used to accelerate the process used for generating further training data.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413706","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
Supporting self-control of individual training for motor-skill development with a social web environment 在社交网络环境下支持运动技能发展个体训练的自我控制
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056372
Kenji Matsuura, Hiroki Moriguchi, K. Kanenishi
This study proposes a system to support self-controlled motor-skill development in a web-community environment. We discuss the difficulties involved in sustaining self-controlled training without systematic supports. The system proposed provides a function to suggest an appropriate range of target goals based on data from previous training sessions. A prototype system has been designed and developed. This study reports a case study based on a trial use of the system. The results suggest that our approach contributes to each user's ability to achieve target goals.
本研究提出一种网路社群环境下的自我控制动作技能发展系统。我们讨论了在没有系统支持的情况下维持自我控制训练所涉及的困难。拟议的系统提供了一个功能,根据以前培训课程的数据建议适当范围的目标目标。设计并开发了一个原型系统。本研究报告了一个基于系统试用的案例研究。结果表明,我们的方法有助于每个用户实现目标的能力。
{"title":"Supporting self-control of individual training for motor-skill development with a social web environment","authors":"Kenji Matsuura, Hiroki Moriguchi, K. Kanenishi","doi":"10.1504/IJKWI.2013.056372","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056372","url":null,"abstract":"This study proposes a system to support self-controlled motor-skill development in a web-community environment. We discuss the difficulties involved in sustaining self-controlled training without systematic supports. The system proposed provides a function to suggest an appropriate range of target goals based on data from previous training sessions. A prototype system has been designed and developed. This study reports a case study based on a trial use of the system. The results suggest that our approach contributes to each user's ability to achieve target goals.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875226","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
Architecture specification of rule-based deep web crawler with indexer 带索引器的基于规则的深度网络爬虫的体系结构规范
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056366
S. Shaila, A. Vadivel
Suitable architecture specification of a deep web crawler with surface web crawler as well as indexer is proposed for fetching large number of documents from deep web using rules. The functional dependency of core and allied fields in the FORM are identified for generating rules using SVM classifier and classifies them as most preferable, least preferable and mutually exclusive. The FORMs are filled with values from most preferable class for fetching large number of documents. The extracted document is indexed for information retrieval applications. The architecture is extended to distributed crawler using web services. The proposed crawler fetches large number of documents while using the values in most preferable class. This architecture has higher coverage rate and reduces fetching time. The retrieval performance is encouraging and achieves similar precision of retrieval as Google search engine system.
提出了一种结合表层网络爬虫和索引器的深度网络爬虫的合适架构规范,用于使用规则从深度网络中获取大量文档。使用SVM分类器识别表单中核心字段和相关字段的功能依赖关系以生成规则,并将其分类为最优选、最不优选和互斥。表单中填充的值来自于获取大量文档的最理想的类。为信息检索应用程序索引提取的文档。将该体系结构扩展为使用web服务的分布式爬虫。建议的爬虫在使用最可取类中的值时获取大量文档。该体系结构具有较高的覆盖率和较短的提取时间。检索性能令人鼓舞,检索精度与Google搜索引擎系统相当。
{"title":"Architecture specification of rule-based deep web crawler with indexer","authors":"S. Shaila, A. Vadivel","doi":"10.1504/IJKWI.2013.056366","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056366","url":null,"abstract":"Suitable architecture specification of a deep web crawler with surface web crawler as well as indexer is proposed for fetching large number of documents from deep web using rules. The functional dependency of core and allied fields in the FORM are identified for generating rules using SVM classifier and classifies them as most preferable, least preferable and mutually exclusive. The FORMs are filled with values from most preferable class for fetching large number of documents. The extracted document is indexed for information retrieval applications. The architecture is extended to distributed crawler using web services. The proposed crawler fetches large number of documents while using the values in most preferable class. This architecture has higher coverage rate and reduces fetching time. The retrieval performance is encouraging and achieves similar precision of retrieval as Google search engine system.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318266","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
Generation of web recommendations using implicit user feedback and normalised mutual information 使用隐式用户反馈和规范化互信息生成web推荐
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056362
V. S. Dixit, Punam Bedi, Harita Mehta
The knowledge base of a traditional web recommender system is constructed from web logs, reflecting past user preferences which may change over time. In this paper, an algorithm, based on implicit user feedback on top N recommendations and normalised mutual information, is proposed for collaborative personalised web recommender system. The proposed algorithm updates the knowledge base taking into account the changing user preferences, in order to generate better recommendations in future. The proposed approach and collaborative personalised web recommender systems without feedback are compared. Significant improvements are observed in precision, recall and F1 measure for proposed approach.
传统的web推荐系统的知识库是由web日志构建的,反映了过去用户的偏好,这些偏好可能会随着时间的推移而改变。本文提出了一种基于用户对top N推荐的隐式反馈和归一化互信息的协同个性化web推荐算法。该算法根据用户偏好的变化对知识库进行更新,以便在将来生成更好的推荐。将该方法与无反馈的协作式个性化网络推荐系统进行了比较。该方法在查全率、查全率和F1测度方面均有显著提高。
{"title":"Generation of web recommendations using implicit user feedback and normalised mutual information","authors":"V. S. Dixit, Punam Bedi, Harita Mehta","doi":"10.1504/IJKWI.2013.056362","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056362","url":null,"abstract":"The knowledge base of a traditional web recommender system is constructed from web logs, reflecting past user preferences which may change over time. In this paper, an algorithm, based on implicit user feedback on top N recommendations and normalised mutual information, is proposed for collaborative personalised web recommender system. The proposed algorithm updates the knowledge base taking into account the changing user preferences, in order to generate better recommendations in future. The proposed approach and collaborative personalised web recommender systems without feedback are compared. Significant improvements are observed in precision, recall and F1 measure for proposed approach.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522399","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
Meta-cognitive skill training programme for first-year bachelor students using thinking process externalisation environment 基于思维过程外化环境的一年级本科生元认知技能训练方案
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056373
Kazuhisa Seta, Liang Cui, M. Ikeda, Noriyuki Matsuda, M. Okamoto
We think that to acquire a skill for co-creating knowledge with others cooperatively, it is important to develop meta-cognitive skill, but to do so is not straightforward. In this paper, we attempt to design a thinking skill particularly meta-cognitive skill development curriculum for first-year bachelor-degree students on the basis of the results obtained in two preceding studies that we have performed for postgraduate education and those engaged in medical services. To deal effectively with new learning for first-year bachelor students - 'thinking about thinking' - we designed a curriculum that gives students a knowledge co-creation programme and thinking externalisation tool to devote attention to the thinking process and to have the bodily sensation of its meaning, and we put it into practice. This paper describes a learning model for thinking skill, which is fundamental to appropriate curriculum design, and discusses the design intention of a curriculum conforming to it and the usefulness of the learning programme through examples of using the thinking externalisation tool in practice. Results show that the learning programme developed in this study is useful for cultivating the meta-cognitive skill of bachelor students.
我们认为,要获得与他人合作共同创造知识的技能,培养元认知技能是很重要的,但要做到这一点并不简单。在本文中,我们试图在之前两项针对研究生教育和从事医疗服务的研究结果的基础上,为一年级本科学生设计一个思维技能,特别是元认知技能发展课程。为了有效地应对大一新生的新学习——“思考思考”——我们设计了一个课程,为学生提供知识共同创造计划和思维外化工具,让他们专注于思维过程,并对其意义有身体的感觉,我们把它付诸实践。本文描述了思维技能的学习模式,这是适当的课程设计的基础,并通过在实践中使用思维外化工具的例子讨论了符合它的课程设计意图和学习计划的有用性。结果表明,本研究开发的学习计划对培养大学生的元认知技能是有益的。
{"title":"Meta-cognitive skill training programme for first-year bachelor students using thinking process externalisation environment","authors":"Kazuhisa Seta, Liang Cui, M. Ikeda, Noriyuki Matsuda, M. Okamoto","doi":"10.1504/IJKWI.2013.056373","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056373","url":null,"abstract":"We think that to acquire a skill for co-creating knowledge with others cooperatively, it is important to develop meta-cognitive skill, but to do so is not straightforward. In this paper, we attempt to design a thinking skill particularly meta-cognitive skill development curriculum for first-year bachelor-degree students on the basis of the results obtained in two preceding studies that we have performed for postgraduate education and those engaged in medical services. To deal effectively with new learning for first-year bachelor students - 'thinking about thinking' - we designed a curriculum that gives students a knowledge co-creation programme and thinking externalisation tool to devote attention to the thinking process and to have the bodily sensation of its meaning, and we put it into practice. This paper describes a learning model for thinking skill, which is fundamental to appropriate curriculum design, and discusses the design intention of a curriculum conforming to it and the usefulness of the learning programme through examples of using the thinking externalisation tool in practice. Results show that the learning programme developed in this study is useful for cultivating the meta-cognitive skill of bachelor students.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117134084","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
Towards effective course-based recommendations for public tenders 为公开招标提供有效的课程建议
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056374
F. Durão, M. Caraciolo, Bruno J. M. Melo, S. Meira
In this paper, we propose a recommendation model to assist users find relevant courses for public tenders. The recommendations are computed based on the user study activity at Atepassar.com, a web-based learning environment for public tender candidates. Unlike traditional academic-oriented recommender systems, our approach takes into account crucial information for public tender candidates such as salary offered by public tenders and location where the exams take place. Technically, our recommendations rely on content-based techniques and a location reasoning method in order to provide users with most feasible courses. Results from a real-world dataset indicate reasonable improvement in recommendation quality over compared baseline models - we observed about 11 precision improvement and 12.7% of recall gain over the best model compared - demonstrating the potential of our approach in recommending personalised courses.
在本文中,我们提出了一个推荐模型,以帮助用户找到相关的公开招标课程。这些建议是根据Atepassar.com上的用户研究活动计算出来的,Atepassar.com是一个面向公开招标候选人的网络学习环境。与传统的以学术为导向的推荐系统不同,我们的方法考虑了公开招标候选人的关键信息,如公开招标提供的工资和考试地点。在技术上,我们的推荐依赖于基于内容的技术和位置推理方法,以便为用户提供最可行的课程。来自真实数据集的结果表明,与基线模型相比,推荐质量有了合理的提高——我们观察到,与所比较的最佳模型相比,推荐精度提高了11%,召回率提高了12.7%——这表明了我们的方法在推荐个性化课程方面的潜力。
{"title":"Towards effective course-based recommendations for public tenders","authors":"F. Durão, M. Caraciolo, Bruno J. M. Melo, S. Meira","doi":"10.1504/IJKWI.2013.056374","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056374","url":null,"abstract":"In this paper, we propose a recommendation model to assist users find relevant courses for public tenders. The recommendations are computed based on the user study activity at Atepassar.com, a web-based learning environment for public tender candidates. Unlike traditional academic-oriented recommender systems, our approach takes into account crucial information for public tender candidates such as salary offered by public tenders and location where the exams take place. Technically, our recommendations rely on content-based techniques and a location reasoning method in order to provide users with most feasible courses. Results from a real-world dataset indicate reasonable improvement in recommendation quality over compared baseline models - we observed about 11 precision improvement and 12.7% of recall gain over the best model compared - demonstrating the potential of our approach in recommending personalised courses.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115638387","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
Personalised web search using ACO with information scent 使用带有信息气味的蚁群算法进行个性化网页搜索
Pub Date : 2013-09-01 DOI: 10.1504/IJKWI.2013.056370
S. Chawla
In this paper the information scent is used as pheromone in ACO for optimising the personalised web search based on clustered user search query sessions. It is realised that user's search for information on the web using information scent of the clicked URLs is analogous to that of ants searching for food using the pheromone in ACO. The user clicks to the personalised search results is used to update increase/decrease the information scent of the corresponding clicked URLs of the stored query sessions and the associated clusters dynamically. This regular updation of information scent optimises the relevant set of clicked URLs associated with the clusters and hence personalises the user's search effectively. An experimental study was conducted on the web user query sessions to test the effectiveness of the proposed approach and results shows the effective improvement in the precision of search results.
本文将信息气味作为信息素应用于蚁群算法中,对基于聚类用户搜索查询会话的个性化网页搜索进行优化。人们认识到,用户利用所点击的url的信息气味在网络上搜索信息,类似于蚂蚁利用蚁群算法中的信息素寻找食物。用户对个性化搜索结果的点击用于动态地更新、增加/减少所存储查询会话和相关集群的相应点击url的信息气味。这种信息气味的定期更新优化了与集群关联的相关点击url集,从而有效地个性化了用户的搜索。通过对web用户查询会话的实验研究,验证了该方法的有效性,结果表明该方法有效地提高了搜索结果的精度。
{"title":"Personalised web search using ACO with information scent","authors":"S. Chawla","doi":"10.1504/IJKWI.2013.056370","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.056370","url":null,"abstract":"In this paper the information scent is used as pheromone in ACO for optimising the personalised web search based on clustered user search query sessions. It is realised that user's search for information on the web using information scent of the clicked URLs is analogous to that of ants searching for food using the pheromone in ACO. The user clicks to the personalised search results is used to update increase/decrease the information scent of the corresponding clicked URLs of the stored query sessions and the associated clusters dynamically. This regular updation of information scent optimises the relevant set of clicked URLs associated with the clusters and hence personalises the user's search effectively. An experimental study was conducted on the web user query sessions to test the effectiveness of the proposed approach and results shows the effective improvement in the precision of search results.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130265555","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
How radiation and its effect were explained?: Scientific communication after the Fukushima Daiichi nuclear disaster 如何解释辐射及其影响?:福岛第一核电站灾难后的科学传播
Pub Date : 2013-04-01 DOI: 10.1504/IJKWI.2013.060276
Kazuhisa Todayama, K. Karasawa
In this paper we examine eight popular books published immediately after the Fukushima Daiichi nuclear disaster. Our aim is to clarify the characteristics, problems in the scientific communication related to the health effects of radiation. The eight books are compared from the aspects of: 1 how units such as Bq, Gy and Sv are defined; 2 how the dose limits are explained; 3 how deterministic and stochastic effects of radiation are differentiated; 4 how LNT model is explained and evaluated; 5 how the fact that we evolved in the midst of natural background radiation is treated. The main finding of our survey is that although the authors of the examined texts start from the same 'scientific facts', in trying to make these facts easily understandable, they adopt different rhetorical strategies and eventually they end up delivering quite different and conflicting messages to the people.
在本文中,我们研究了福岛第一核电站灾难后立即出版的八本畅销书。我们的目的是澄清辐射对健康影响的科学传播的特点和问题。这八本书从以下几个方面进行了比较:1 .如何定义Bq、Gy、Sv等单位;如何解释剂量限制;如何区分辐射的确定性效应和随机效应;如何解释和评估LNT模型;我们在自然背景辐射中进化的事实是如何被对待的。我们调查的主要发现是,尽管研究文本的作者从相同的“科学事实”开始,但为了使这些事实易于理解,他们采用了不同的修辞策略,最终他们向人们传递了截然不同和相互矛盾的信息。
{"title":"How radiation and its effect were explained?: Scientific communication after the Fukushima Daiichi nuclear disaster","authors":"Kazuhisa Todayama, K. Karasawa","doi":"10.1504/IJKWI.2013.060276","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.060276","url":null,"abstract":"In this paper we examine eight popular books published immediately after the Fukushima Daiichi nuclear disaster. Our aim is to clarify the characteristics, problems in the scientific communication related to the health effects of radiation. The eight books are compared from the aspects of: 1 how units such as Bq, Gy and Sv are defined; 2 how the dose limits are explained; 3 how deterministic and stochastic effects of radiation are differentiated; 4 how LNT model is explained and evaluated; 5 how the fact that we evolved in the midst of natural background radiation is treated. The main finding of our survey is that although the authors of the examined texts start from the same 'scientific facts', in trying to make these facts easily understandable, they adopt different rhetorical strategies and eventually they end up delivering quite different and conflicting messages to the people.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489041","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
Inferring relevant blocks on hyperlinked web page based on block-to-block similarity 基于块到块的相似性推断超链接网页上的相关块
Pub Date : 2013-04-01 DOI: 10.1504/IJKWI.2013.060266
K. Tsukamoto, Y. Koizumi, H. Ohsaki, K. Hato, J. Murayama
Internet users devote considerable time and effort to collecting information from the web. To do so efficiently, after following a hyperlink, a user must be able to rapidly determine whether the desired information is contained on the destination web page. In this paper, therefore, we propose a method called hyperlink referring block estimation HERB, which infers the existence and location of relevant contents on destination web pages. HERB utilises user context in web browsing, in particular, the selected hyperlink and the text around it. Through experiments simulating ordinary web browsing, we quantitatively investigate the effectiveness of HERB. Our experiments show that HERB can infer blocks relevant to a hyperlink with approximately 65% precision and 70% recall. Furthermore, we design two HERB implementations, namely, a web proxy and a web browser, and we present an overview of a web proxy prototype and an example use case.
因特网用户花费大量的时间和精力从网上收集信息。为了有效地做到这一点,在点击超链接之后,用户必须能够快速确定目标网页上是否包含所需的信息。因此,本文提出了一种超链接引用块估计方法HERB,该方法可以推断出目标网页上相关内容的存在和位置。HERB在网页浏览中利用用户上下文,特别是所选的超链接和它周围的文本。通过模拟普通网页浏览的实验,定量地考察了HERB的有效性。我们的实验表明,HERB可以以大约65%的准确率和70%的召回率推断出与超链接相关的块。此外,我们设计了两个HERB实现,即web代理和web浏览器,并给出了web代理原型的概述和一个示例用例。
{"title":"Inferring relevant blocks on hyperlinked web page based on block-to-block similarity","authors":"K. Tsukamoto, Y. Koizumi, H. Ohsaki, K. Hato, J. Murayama","doi":"10.1504/IJKWI.2013.060266","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.060266","url":null,"abstract":"Internet users devote considerable time and effort to collecting information from the web. To do so efficiently, after following a hyperlink, a user must be able to rapidly determine whether the desired information is contained on the destination web page. In this paper, therefore, we propose a method called hyperlink referring block estimation HERB, which infers the existence and location of relevant contents on destination web pages. HERB utilises user context in web browsing, in particular, the selected hyperlink and the text around it. Through experiments simulating ordinary web browsing, we quantitatively investigate the effectiveness of HERB. Our experiments show that HERB can infer blocks relevant to a hyperlink with approximately 65% precision and 70% recall. Furthermore, we design two HERB implementations, namely, a web proxy and a web browser, and we present an overview of a web proxy prototype and an example use case.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125886472","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
Approximately processing aggregate range queries on remote spatial databases 在远程空间数据库上近似处理聚合范围查询
Pub Date : 2013-04-01 DOI: 10.1504/IJKWI.2013.060275
H. Sato, Ryoichi Narita
Processing aggregate range queries on remote spatial databases suffers from accessing huge and/or large number of databases that operate autonomously and simple and/or restrictive web API interfaces. To overcome these difficulties, this paper applies a revised version of regular polygon-based search algorithm RPSA to approximately search aggregate range query results over remote spatial databases. The algorithm requests a series of k-NN queries to obtain aggregate range query results. The query point of a subsequent k-NN query is chosen from among the vertices of a regular polygon inscribed in a previously searched circle. Experimental results show that precision is over 0.97 with regard to sum range query results and NOR is at most 4.3. On the other hand, precision is over 0.87 with regard to maximum range query results and NOR is at most 4.9.
在远程空间数据库上处理聚合范围查询时,需要访问大量的数据库,这些数据库都是自主运行的,且操作简单和/或受限的web API接口。为了克服这些困难,本文采用改进的正则多边形搜索算法RPSA对远程空间数据库的聚合范围查询结果进行近似搜索。该算法请求一系列k-NN查询以获得聚合范围查询结果。后续k-NN查询的查询点是从之前搜索的圆内嵌的正多边形的顶点中选择的。实验结果表明,对于求和范围查询结果,精度在0.97以上,NOR不超过4.3。另一方面,对于最大范围查询结果,精度超过0.87,NOR不超过4.9。
{"title":"Approximately processing aggregate range queries on remote spatial databases","authors":"H. Sato, Ryoichi Narita","doi":"10.1504/IJKWI.2013.060275","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.060275","url":null,"abstract":"Processing aggregate range queries on remote spatial databases suffers from accessing huge and/or large number of databases that operate autonomously and simple and/or restrictive web API interfaces. To overcome these difficulties, this paper applies a revised version of regular polygon-based search algorithm RPSA to approximately search aggregate range query results over remote spatial databases. The algorithm requests a series of k-NN queries to obtain aggregate range query results. The query point of a subsequent k-NN query is chosen from among the vertices of a regular polygon inscribed in a previously searched circle. Experimental results show that precision is over 0.97 with regard to sum range query results and NOR is at most 4.3. On the other hand, precision is over 0.87 with regard to maximum range query results and NOR is at most 4.9.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988836","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
期刊
Int. J. Knowl. Web Intell.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1