Pub Date : 2013-09-01DOI: 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.
{"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}
Pub Date : 2013-04-01DOI: 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.
{"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}
Pub Date : 2013-04-01DOI: 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.
{"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}
Pub Date : 2013-04-01DOI: 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.
{"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}
Pub Date : 2013-04-01DOI: 10.1504/IJKWI.2013.060277
C. Jouault, Kazuhisa Seta
The objective of this research is to give learners content-dependent scaffolding during self-directed learning: the system is able to generate content-dependent support adapted to the learners. Learners use a system to perform a learning task in the domain of history. They have to build a concept map containing a chronology using the system. To be able to support, we combined multiple semantic information sources and Wikipedia, for the natural language information, to create a semantic open learning space. The system provides advice by generating questions based on the semantic information and enhancing document based on the Wikipedia corresponding to the semantic information. All the advices are provided on demand and are generated depending on the learner's concept map for adaptive support question generation. The generated questions aim to lead the learners to new knowledge by deepening their understanding.
{"title":"Adaptive self-directed learning support by question generation in a semantic open learning space","authors":"C. Jouault, Kazuhisa Seta","doi":"10.1504/IJKWI.2013.060277","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.060277","url":null,"abstract":"The objective of this research is to give learners content-dependent scaffolding during self-directed learning: the system is able to generate content-dependent support adapted to the learners. Learners use a system to perform a learning task in the domain of history. They have to build a concept map containing a chronology using the system. To be able to support, we combined multiple semantic information sources and Wikipedia, for the natural language information, to create a semantic open learning space. The system provides advice by generating questions based on the semantic information and enhancing document based on the Wikipedia corresponding to the semantic information. All the advices are provided on demand and are generated depending on the learner's concept map for adaptive support question generation. The generated questions aim to lead the learners to new knowledge by deepening their understanding.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"153 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":"123407807","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}
Pub Date : 2013-04-01DOI: 10.1504/IJKWI.2013.060274
K. Asakura, Toyohide Watanabe
This paper proposes a construction system of navigational maps for evacuees in disaster areas. The navigational maps let evacuees know the current situations of disaster areas: namely, which roads can be used for evacuation, which paths is the shortest to shelters, and so on. In this system, in order to acquire up-to-minute information on road condition in the area, evacuees with mobile devices record roads chosen for evacuation to the shelter as data collection agents. Furthermore, in order to take recentness of information into account, collected road information is restructured into a navigational map based on a mechanism of ant colony systems. By this method, more recently used roads are treated as safer roads for evacuation. In the simulation experiments, we can observe that the proposed map construction system can follow changing situation and provide an up-to-minute safe-road map to a shelter in a disaster area. In addition, we can also clarify that navigational maps provided by our system can reduce evacuation time to shelters in disaster areas.
{"title":"Construction of navigational maps for evacuees in disaster areas based on ant colony systems","authors":"K. Asakura, Toyohide Watanabe","doi":"10.1504/IJKWI.2013.060274","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.060274","url":null,"abstract":"This paper proposes a construction system of navigational maps for evacuees in disaster areas. The navigational maps let evacuees know the current situations of disaster areas: namely, which roads can be used for evacuation, which paths is the shortest to shelters, and so on. In this system, in order to acquire up-to-minute information on road condition in the area, evacuees with mobile devices record roads chosen for evacuation to the shelter as data collection agents. Furthermore, in order to take recentness of information into account, collected road information is restructured into a navigational map based on a mechanism of ant colony systems. By this method, more recently used roads are treated as safer roads for evacuation. In the simulation experiments, we can observe that the proposed map construction system can follow changing situation and provide an up-to-minute safe-road map to a shelter in a disaster area. In addition, we can also clarify that navigational maps provided by our system can reduce evacuation time to shelters in disaster areas.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"36 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":"121388122","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}
Pub Date : 2013-03-01DOI: 10.1504/IJKWI.2013.052723
Jun Feng, Zhonghua Zhu, Yaqing Shi, Liming Xu
The prediction of spatio-temporal data streams which is based on aggregate queries has been an important research direction in the research field of databases. More and more methods have been proposed to obtain approximate aggregate results. However, they will consume a lot of time and storage space. This paper proposes Dynamic Sketch DS index by using modified method of Adaptive Multi-dimensional Histogram AMH* to intelligently partition static sketch which can improve the approximate quality of aggregate queries in road networks. Then, based on DS index, this paper proposes a new prediction approach over data streams in road networks using Self-Adaptive Exponential Smoothing SAES.
{"title":"A new spatio-temporal prediction approach based on aggregate queries","authors":"Jun Feng, Zhonghua Zhu, Yaqing Shi, Liming Xu","doi":"10.1504/IJKWI.2013.052723","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052723","url":null,"abstract":"The prediction of spatio-temporal data streams which is based on aggregate queries has been an important research direction in the research field of databases. More and more methods have been proposed to obtain approximate aggregate results. However, they will consume a lot of time and storage space. This paper proposes Dynamic Sketch DS index by using modified method of Adaptive Multi-dimensional Histogram AMH* to intelligently partition static sketch which can improve the approximate quality of aggregate queries in road networks. Then, based on DS index, this paper proposes a new prediction approach over data streams in road networks using Self-Adaptive Exponential Smoothing SAES.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129507418","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}
Pub Date : 2013-03-01DOI: 10.1504/IJKWI.2013.052722
H. Sato, Ryoichi Narita
Searching Aggregate k-Nearest Neighbour k-ANN queries on remote spatial databases suffers from a large amount of communication. In order to overcome the difficulty, RQP-M algorithm for efficiently searching k-ANN query results is proposed in this paper. It refines query results originally searched by RQP-S with subsequent k-NN queries, whose query points are chosen among vertices of a regular polygon inscribed in a circle searched previously. Experimental results show that precision of sum k-NN query results is over 0.95 and Number of Requests NOR is at most 4.0. On the other hand, precision of max k-NN query results is over 0.95 and NOR is at most 5.6. RQP-M brings 0.04-0.20 increase in PRECISION of sum k-NN query results and over 0.40 increase in that of max k-NN query results, respectively, in comparison with RQP-S.
{"title":"Approximate search algorithm for aggregate k-nearest neighbour queries on remote spatial databases","authors":"H. Sato, Ryoichi Narita","doi":"10.1504/IJKWI.2013.052722","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052722","url":null,"abstract":"Searching Aggregate k-Nearest Neighbour k-ANN queries on remote spatial databases suffers from a large amount of communication. In order to overcome the difficulty, RQP-M algorithm for efficiently searching k-ANN query results is proposed in this paper. It refines query results originally searched by RQP-S with subsequent k-NN queries, whose query points are chosen among vertices of a regular polygon inscribed in a circle searched previously. Experimental results show that precision of sum k-NN query results is over 0.95 and Number of Requests NOR is at most 4.0. On the other hand, precision of max k-NN query results is over 0.95 and NOR is at most 5.6. RQP-M brings 0.04-0.20 increase in PRECISION of sum k-NN query results and over 0.40 increase in that of max k-NN query results, respectively, in comparison with RQP-S.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078541","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}
Intelligent Tutoring System ITS is a learning support system which provides an individual learning environment to students. ITS gives learning contents to students according to the learning strategy based on their understanding degree. Many traditional ITSs, however, have static predefined contents without regard to individual preferences. It causes that students lose their motivation. Our research objective is to develop a system which automatically generates multiple-choice cloze exercises from input text according to the student's understanding. Our target is supporting individual study of learning English grammar. In this paper, we propose a representation method of English grammar by Part-of-Speech POS tags and specific words as units and the semantic relations of the units. In addition, the calculation method for estimating understanding degree of the student and the learning strategy for generating the next exercise proposed regarding the understanding degree of student and the relations of grammar rules.
{"title":"Multiple-choice cloze exercise generation through English grammar learning support","authors":"Ayse Saliha Sunar, Yuki Hayashi, Toyohide Watanabe","doi":"10.1504/IJKWI.2013.052727","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052727","url":null,"abstract":"Intelligent Tutoring System ITS is a learning support system which provides an individual learning environment to students. ITS gives learning contents to students according to the learning strategy based on their understanding degree. Many traditional ITSs, however, have static predefined contents without regard to individual preferences. It causes that students lose their motivation. Our research objective is to develop a system which automatically generates multiple-choice cloze exercises from input text according to the student's understanding. Our target is supporting individual study of learning English grammar. In this paper, we propose a representation method of English grammar by Part-of-Speech POS tags and specific words as units and the semantic relations of the units. In addition, the calculation method for estimating understanding degree of the student and the learning strategy for generating the next exercise proposed regarding the understanding degree of student and the relations of grammar rules.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694402","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}
Pub Date : 2013-03-01DOI: 10.1504/IJKWI.2013.052725
H. Mizutani, D. Yamamoto, N. Takahashi
We have previously developed a Focus+Glue+Context-type fisheye view map system called Emma. Emma shows maps of different scales on the same display region, so that users can use wide maps Context and confirm details Focuses simultaneously. However, when multiple Focuses overlap, Emma is problematic in that road-network connections cannot be correctly drawn. In this paper, we propose the Water Drop method as a solution to this problem. It prevents overlapping by transforming Focuses much in the same way that drops of water are transformed, united, and divided due to surface tension. In order to prove the efficiency of the proposed method, we also developed the Overlap Repulsion method as a baseline approach. It prevents overlapping by moving the inactive Focuses away from the active Focus when an active Focus overlaps inactive Focuses. We conducted three experimental evaluations from the point of view of the both usability of the interface and map visibility.
{"title":"A preventing method for overlapping focuses in a Focus+Glue+Context Map","authors":"H. Mizutani, D. Yamamoto, N. Takahashi","doi":"10.1504/IJKWI.2013.052725","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052725","url":null,"abstract":"We have previously developed a Focus+Glue+Context-type fisheye view map system called Emma. Emma shows maps of different scales on the same display region, so that users can use wide maps Context and confirm details Focuses simultaneously. However, when multiple Focuses overlap, Emma is problematic in that road-network connections cannot be correctly drawn. In this paper, we propose the Water Drop method as a solution to this problem. It prevents overlapping by transforming Focuses much in the same way that drops of water are transformed, united, and divided due to surface tension. In order to prove the efficiency of the proposed method, we also developed the Overlap Repulsion method as a baseline approach. It prevents overlapping by moving the inactive Focuses away from the active Focus when an active Focus overlaps inactive Focuses. We conducted three experimental evaluations from the point of view of the both usability of the interface and map visibility.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116769164","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：