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

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

筛选
英文 中文
Strategy-centred modelling for better understanding of learning/instructional theories 以策略为中心的建模，以便更好地理解学习/教学理论
Int. J. Knowl. Web Intell. Pub Date : 2010-07-01 DOI: 10.1504/IJKWI.2010.034187
Y. Hayashi, J. Bourdeau, R. Mizoguchi
{"title":"Strategy-centred modelling for better understanding of learning/instructional theories","authors":"Y. Hayashi, J. Bourdeau, R. Mizoguchi","doi":"10.1504/IJKWI.2010.034187","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034187","url":null,"abstract":"Structuring learning/instructional theories suffer from the issue of 'paradigms', which makes them even more challenging. This paper discusses the conceptualisation of the theories and proposes a mechanism to provide perspectives for understanding and utilising them. Two types of conceptualisation proposed in this paper reveal their characteristics from a variety of viewpoints.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124814499","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
Exploiting tree structure of a web page for clustering 利用网页的树状结构进行聚类
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027926
Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla
{"title":"Exploiting tree structure of a web page for clustering","authors":"Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla","doi":"10.1504/IJKWI.2009.027926","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027926","url":null,"abstract":"An approach to designing a Universal Web Wrapper has been in stages of implementation for over years. An issue associated with this is the automated selection of web pages and thereby extraction of content of interest. We propose an algorithm to cluster pages on the basis of their structure. Due to high amount of similarity in these pages, it is be easier to categorise them and extract any particular section of the page. This algorithm makes use of only the structural factors leading to complexity equivalent to O(log n). Further, the algorithm evaluation illustrates the precision and efficiency of the algorithm.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116710872","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
An efficient approach for mining web content sensitivity 一种有效的网页内容敏感性挖掘方法
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027927
Cheng Wang, Y. Liu, Liheng Jian, P. Zhang
{"title":"An efficient approach for mining web content sensitivity","authors":"Cheng Wang, Y. Liu, Liheng Jian, P. Zhang","doi":"10.1504/IJKWI.2009.027927","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027927","url":null,"abstract":"Abnormal remarks on the web, such as violence, threat, superstition, etc., may disturb the social order and public morality (referred as sensitive content). To provide a quantitative measure of the sensitivity of a webpage, we propose the concept of web content sensitivity which measures how sensitive a page is. We also propose a web content sensitivity mining approach. Our experiment identified a number of sensitive webpages that traditional frequency-based methods failed to find. By varying the sensitive values of the keywords, different sets of high sensitivity keywords were discovered as well as the corresponding webpages.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116745836","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
A semantic self-organising webpage-ranking algorithm using computational geometry across different knowledge domains 基于计算几何的跨知识领域的语义自组织网页排序算法
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027924
M. Poulos, S. Papavlasopoulos, V. S. Belesiotis, Nikolaos Korfiatis
{"title":"A semantic self-organising webpage-ranking algorithm using computational geometry across different knowledge domains","authors":"M. Poulos, S. Papavlasopoulos, V. S. Belesiotis, Nikolaos Korfiatis","doi":"10.1504/IJKWI.2009.027924","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027924","url":null,"abstract":"In this paper we introduce a method for Web page-ranking, based on computational geometry to evaluate and test by examples, order relationships among web pages belonging to different knowledge domains. The goal is, through an organising procedure, to learn from these examples a real-valued ranking function that induces ranking via a convexity feature. We consider the problem of self-organising learning from numerical data to be represented by a well-fitted convex polygon procedure, in which the vertices correspond to descriptors representing domains of web pages. Results and statistical evaluation of procedure show that the proposed method may be characterised as accurate.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125231473","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
Mapping OWL to the Entity Relationship and Extended Entity Relationship models 将OWL映射到实体关系和扩展实体关系模型
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027929
S. Bagui
{"title":"Mapping OWL to the Entity Relationship and Extended Entity Relationship models","authors":"S. Bagui","doi":"10.1504/IJKWI.2009.027929","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027929","url":null,"abstract":"This paper presents mapping rules to conceptually model an Entity Relationship (ER) diagram and Extended Entity Relationship (EER) diagram from OWL by identifying ER and EER constructs in OWL. OWL has been designed for the semantic web, but data in OWL format is not easy to manipulate or query. The conceptual view of OWL presented in this paper is necessary to understand OWL and OWL data, and will be used to eventually map OWL data to the relational model. Once in the relational model, OWL data can avail of mature relational database technology.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124161826","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
A fuzzy bi-clustering approach to correlate web users and pages 一种模糊双聚类方法来关联web用户和页面
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027923
Vassiliki A. Koutsonikola, A. Vakali
{"title":"A fuzzy bi-clustering approach to correlate web users and pages","authors":"Vassiliki A. Koutsonikola, A. Vakali","doi":"10.1504/IJKWI.2009.027923","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027923","url":null,"abstract":"With the rapid development of information technology, the significance of clustering in the process of delivering information to users is becoming more eminent. Especially in the web information space, clustering analysis can prove particularly beneficial for a variety of applications such as web personalisation and profiling, caching and prefetching and content delivery networks. In this paper, we propose a bi-clustering approach, which identifies groups of related web users and pages. The proposed approach is a three-step process that relies on the principles of spectral clustering analysis and provides a fuzzy relation scheme for the revealed users' and pages' clusters. Experiments have been conducted on both synthetic and real datasets to prove the proposed method's efficiency and reveal hidden knowledge.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133041722","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}
引用次数: 26
Semantic lifecycles: modelling, application, authoring, mining, and evaluation of meaningful data 语义生命周期:建模、应用、创作、挖掘和评估有意义的数据
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027928
Felix Mödritscher
{"title":"Semantic lifecycles: modelling, application, authoring, mining, and evaluation of meaningful data","authors":"Felix Mödritscher","doi":"10.1504/IJKWI.2009.027928","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027928","url":null,"abstract":"The Semantic Web aims at evolving the 'web of data' to an 'intelligent information space' which is responsive to both human beings and computer systems. Consequently, semantic technologies have emerged in many application fields, primarily to provide intelligent IT systems. Semantics, therefore, is considered to be the essence of systemic intelligence. In this paper, we introduce a lifecycle model for semantics, consisting of five phases: a) modeling; b) application; c) authoring; d) mining; e) evaluation of semantic information. With respect to this model, we analyse semantic lifecycles from former research work and summarise experiences as well as future research activities.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129044890","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
An integrated model for next page access prediction 下一页访问预测的集成模型
Int. J. Knowl. Web Intell. Pub Date : 2009-08-01 DOI: 10.1504/IJKWI.2009.027925
F. Khalil, Jiuyong Li, Hua Wang
{"title":"An integrated model for next page access prediction","authors":"F. Khalil, Jiuyong Li, Hua Wang","doi":"10.1504/IJKWI.2009.027925","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027925","url":null,"abstract":"Accurate next web page prediction benefits many applications, e-business in particular. The most widely used techniques for this purpose are Markov Model, association rules and clustering. However, each of these techniques has its own limitations, especially when it comes to accuracy and space complexity. This paper presents an improved prediction accuracy and state space complexity by using novel approaches that combine clustering, association rules and Markov Models. The three techniques are integrated together to maximise their strengths. The integration model has been shown to achieve better prediction accuracy than individual and other integrated models.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131477495","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}
引用次数: 48
Composition method of folk-tales based on STRIPS-like framework 基于类带状框架的民间故事写作方法
Int. J. Knowl. Web Intell. Pub Date : 1900-01-01 DOI: 10.1504/IJKWI.2012.051285
Ryosuke Arasawa, Koichi Hanaue, Toyohide Watanabe
{"title":"Composition method of folk-tales based on STRIPS-like framework","authors":"Ryosuke Arasawa, Koichi Hanaue, Toyohide Watanabe","doi":"10.1504/IJKWI.2012.051285","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.051285","url":null,"abstract":"We propose a method for supporting story composition of folk-tales. Our idea is to derive events in a story and their order constraints from the outline specified by a storywriter. To achieve this, we introduce a technique of partial order planning, and represent the situations and the events in a story based on the framework of STRIPS. In our method, events and order constraints are derived according to the policy that respects the intentions of a storywriter specified in his/her outline. We investigated the effectiveness of the policy in a case study.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125567385","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
A multi-agent-based negotiation system for web service selection 基于多代理的web服务选择协商系统
Int. J. Knowl. Web Intell. Pub Date : 1900-01-01 DOI: 10.1504/IJKWI.2016.10005792
Raja Bellakhal, K. Ghédira
{"title":"A multi-agent-based negotiation system for web service selection","authors":"Raja Bellakhal, K. Ghédira","doi":"10.1504/IJKWI.2016.10005792","DOIUrl":"https://doi.org/10.1504/IJKWI.2016.10005792","url":null,"abstract":"The web service selection is the process of finding matches between the service descriptions and the client's specific needs including the QoS parameters. Actually, these parameters are dynamic and considering them static affects negatively the system's reliability. To make dynamic the QoS parameters, negotiation appears a relevant tool as it positively influences the success rate of the web service selection process. However, existing works do not consider important characteristics of the real humans' interactions including dependencies existing between the concurrent negotiation processes, and the hybrid as well as the dynamic negotiation aspects. In this paper, we show that omitting these aspects while implementing a selection system incurs degradation on its performance. We propose a web service selection agent system based on a hybrid negotiation that solves these drawbacks. The experimental results show that the proposed approach outperforms the existing approaches in terms of the outputs quality and the CPU time.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133401973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信