Int. J. Web Eng. Technol.最新文献

筛选
英文 中文
Clustering facilitated web services discovery model based on supervised term weighting and adaptive metric learning 基于监督项加权和自适应度量学习的聚类促进了web服务发现模型
Int. J. Web Eng. Technol. Pub Date : 2013-03-01 DOI: 10.1504/IJWET.2013.052591
Lei Chen, Geng Yang, Wei Zhu, Yingzhou Zhang, Zhen Yang
{"title":"Clustering facilitated web services discovery model based on supervised term weighting and adaptive metric learning","authors":"Lei Chen, Geng Yang, Wei Zhu, Yingzhou Zhang, Zhen Yang","doi":"10.1504/IJWET.2013.052591","DOIUrl":"https://doi.org/10.1504/IJWET.2013.052591","url":null,"abstract":"With the explosive growth of web services, the research on how to rapidly find the desired services becomes increasingly important and challenging. In this paper, we focus on non-semantic web services discovery and present an efficient clustering facilitated web services discovery model CFWSFinder. Compared with the existing models, CFWSFinder has several characteristics. First, in services representing process, CFWSFinder imports WordNet and latent semantics index to represent non-semantic web services as the low-dimensional compact semantic feature vectors; Second, in services clustering process, CFWSFinder employs a modified Kernel batch self-organising map KBSOM neural network to minimise the services discovery duration; Third and most importantly, in services matching process, by using the category label information achieved from services clustering process, CFWSFinder can adopt supervised term weighting scheme and adaptive metric learning method to ameliorate the services discovery precision. Finally, experimental results performed on the real-world web services collection demonstrate the feasibility of the CFWSFinder.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"17 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":"115392933","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
The aggregation of heterogeneous metadata in web-based cultural heritage collections: a case study 基于网络的文化遗产馆藏中异构元数据的聚合:一个案例研究
Int. J. Web Eng. Technol. Pub Date : 2013-02-01 DOI: 10.1504/IJWET.2013.059107
S. Peroni, Francesca Tomasi, F. Vitali
{"title":"The aggregation of heterogeneous metadata in web-based cultural heritage collections: a case study","authors":"S. Peroni, Francesca Tomasi, F. Vitali","doi":"10.1504/IJWET.2013.059107","DOIUrl":"https://doi.org/10.1504/IJWET.2013.059107","url":null,"abstract":"In this paper, we discuss some issues related to digital libraries that are born as aggregators of cultural heritage resources harvested from different distributed digital repositories. Whenever such aggregations fall short of providing a real service to users, most of the time this is due to the inadequacy of the data or conceptual model proposed for the mapping and exposed to the final user. Our aim is to enhance the formal representation of cultural heritage materials, reasoning about some key concepts to improve the quality of the description of digital resources by refining the conceptual model. In order to discuss about these issues, we focus particularly on Europeana, the principal European Digital Library, as the foremost and most paradigmatic example of aggregators, and on the Europeana Data Model EDM as the conceptual model on which metadata from different repositories are mapped in Europeana.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127141198","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
Topological XML data cube construction 拓扑XML数据立方体构造
Int. J. Web Eng. Technol. Pub Date : 2013-02-01 DOI: 10.1504/IJWET.2013.059104
Hao Gui, M. Roantree
{"title":"Topological XML data cube construction","authors":"Hao Gui, M. Roantree","doi":"10.1504/IJWET.2013.059104","DOIUrl":"https://doi.org/10.1504/IJWET.2013.059104","url":null,"abstract":"The usage of online analytical processing is now widespread, having emerged primarily in areas of business information systems using relational databases. However, the XML tree-based model is quite different from the relational model in mainstream OLAP. In terms of conceptual modelling, this provides new challenges, for example with operations such as cube and roll-up. However, our view is that it should be possible to exploit the more expressive XML model to deliver efficiencies not possible in more traditional OLAP systems. To be precise, XML data contains inherent structure and semantics not available in relational data. In this paper, we analyse the distinct characteristics and requirements of a more structured OLAP to make comprehensive comparisons between structural and flat dimensions. In order to build our conceptual model, we examined different XML cube construction models for commonly used XML recursive structures. This construction process requires only a single scan of input data and captures structural information on the fly, delivering both standard and structural OLAP support simultaneously.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123814992","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
Repairing broken RDF links in the web of data 修复数据网络中损坏的RDF链接
Int. J. Web Eng. Technol. Pub Date : 2013-02-01 DOI: 10.1504/IJWET.2013.059106
Mohammad Pourzaferani, M. Nematbakhsh
{"title":"Repairing broken RDF links in the web of data","authors":"Mohammad Pourzaferani, M. Nematbakhsh","doi":"10.1504/IJWET.2013.059106","DOIUrl":"https://doi.org/10.1504/IJWET.2013.059106","url":null,"abstract":"In the web of data, linked datasets are changed over time. These changes include updating on features and address of entities. The address change in RDF entities causes their corresponding links to be broken. Broken link is one of the major obstacles that the web of data is facing. Most approaches to solve this problem attempt to fix broken links at the destination point. These approaches have two major problems: a single point of failure; and reliance on the destination data source. In this paper, we introduce a method for fixing broken links which is based on the source point of links, and discover the new address of the detached entity. To this end, we introduce two datasets, which we call 'superior' and 'inferior'. Through these datasets, our method creates an exclusive graph structure for each entity that needs to be observed over time. This graph is used to identify and discover the new address of the detached entity. Afterward, the most similar entity, which is candidate for the detached entity, is deduced and suggested by the algorithm. The proposed model is evaluated with DBpedia dataset within the domain of 'person' entities. The result shows that most of the broken links, which had referred to a 'person' entity in DBpedia, had been fixed correctly.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"374 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988700","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
SP4PS: service process rewriting for efficient and proper web services composition SP4PS:重写服务流程,以实现高效和适当的web服务组合
Int. J. Web Eng. Technol. Pub Date : 2013-02-01 DOI: 10.1504/IJWET.2013.059098
Mansour Mekour, S. Benslimane
{"title":"SP4PS: service process rewriting for efficient and proper web services composition","authors":"Mansour Mekour, S. Benslimane","doi":"10.1504/IJWET.2013.059098","DOIUrl":"https://doi.org/10.1504/IJWET.2013.059098","url":null,"abstract":"Web services have become a key technology to implement distributed systems and perform applications' integration. Service composition involves the development of customised services often by discovering, integrating, and executing existing services. This can be done in such a way that already existing services are orchestrated into one or more new services that fit better to the composite application. In this paper, we propose a novel approach to tackle the dynamic services composition problem. Mainly, we focus on service behaviour formalisation to provide a representation that enables us to perform the analysis of service interaction for service behavioural rewriting and combination. Our approach takes advantage of control flows compatibility and service part-consumption to select, integrate and interleave service processes in order to fulfil the provider's constraints and satisfy the requester's needs. The experimental results show that our proposal can contribute to enhance the dynamic user task realisation, and ensure an efficient and proper web service consumption at the provider and the requester's level.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"4 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120992928","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
W-entropy method to measure the influence of the members from social networks 用w -熵法衡量社会网络成员的影响力
Int. J. Web Eng. Technol. Pub Date : 2013-02-01 DOI: 10.1504/IJWET.2013.059105
Weigang Li, Jianya Zheng, Guiqiu Liu
{"title":"W-entropy method to measure the influence of the members from social networks","authors":"Weigang Li, Jianya Zheng, Guiqiu Liu","doi":"10.1504/IJWET.2013.059105","DOIUrl":"https://doi.org/10.1504/IJWET.2013.059105","url":null,"abstract":"With the rapid advance of the social media, the challenge is to develop new techniques and standards to measure the influence of people or brands in the online social networks. Each website has its way of ranking the display of the most influential members of its virtual society. However, most of the current measurement methods are incomplete and one-dimensional. This paper presents a new measurement model, W-entropy, which has been developed based on information theory to study the influence of individuals based on different social networks. The model was tested using data from Facebook, Twitter, YouTube, and Google search. The proposed model can be extended to other platforms. To evaluate the effectiveness, the developed method was compared with Famecount ranking using the same data with different weight distributions. The result shows that W-entropy method is suitable for index ranking to reflect uneven information distribution across various social networks.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121092123","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
MultiAspectForensics: mining large heterogeneous networks using tensor MultiAspectForensics:使用张量挖掘大型异构网络
Int. J. Web Eng. Technol. Pub Date : 2012-12-01 DOI: 10.1504/IJWET.2012.050958
Koji Maruhashi, Fan Guo, C. Faloutsos
{"title":"MultiAspectForensics: mining large heterogeneous networks using tensor","authors":"Koji Maruhashi, Fan Guo, C. Faloutsos","doi":"10.1504/IJWET.2012.050958","DOIUrl":"https://doi.org/10.1504/IJWET.2012.050958","url":null,"abstract":"Modern applications such as web knowledge bases, network traffic monitoring and online social networks involve an unprecedented amount of 'heterogeneous' network data, with rich types of interactions among nodes. How can we find patterns and anomalies for heterogeneous networks with millions of edges that have high dimensional attributes, in a scalable way? We introduce MultiAspectForensics, a novel tool to automatically detect and visualise bursts of specific sub-graph patterns within a local community of nodes as anomalies in a heterogeneous network, leveraging scalable tensor analysis methods. One such pattern consists of a set of vertices that form a dense bipartite graph, whose edges share exactly the same set of attributes. We present empirical results of the proposed method on three datasets from distinct application domains, and discuss insights derived from these patterns discovered. Moreover, we empirically show that our algorithm can be feasibly applied to higher dimensional datasets.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123011013","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
A scalable and efficient Web 2.0 reader platform for mashups 用于mashup的可伸缩且高效的Web 2.0阅读器平台
Int. J. Web Eng. Technol. Pub Date : 2012-12-01 DOI: 10.1504/IJWET.2012.050967
O. Hassan, Bassam Al-Shargabi
{"title":"A scalable and efficient Web 2.0 reader platform for mashups","authors":"O. Hassan, Bassam Al-Shargabi","doi":"10.1504/IJWET.2012.050967","DOIUrl":"https://doi.org/10.1504/IJWET.2012.050967","url":null,"abstract":"Two of the icons of Web 2.0 applications are feed readers and mashup platforms. On one hand, feed readers provide end-users with updates of content of feeds they subscribe to. On the other hand, mashups are conceptually web services created by end-users and hosted by mashup platforms which empower end-users with a tool to query the web based on their personalised interests. In this paper, we combine the best of mashup readers and mashup platforms in order to design a novel Web 2.0 application called mashup reader. Mashup reader enables end-users to subscribe to their favourite mashups and obtain updates of the result of executing those mashups. In this paper, we introduce the design of mashup reader, provide ways to improve its efficiency, and evaluate its execution mechanism. Our experiments show that mashup reader is an efficient and scalable Web 2.0 platform which provides end-users with an effective web querying tool.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114244085","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
Towards an approach to design and enforce security in web service composition 探讨在web服务组合中设计和实施安全性的方法
Int. J. Web Eng. Technol. Pub Date : 2012-12-01 DOI: 10.1504/IJWET.2012.050966
F. Lins, J. Damasceno, Bruno Silva, Robson W. A. Medeiros, Andre R. R. Souza, Fabricio Teles, David Aragão, E. Sousa, N. Rosa, Bryan Stephenson, H. M. Nezhad, Jun Yu Li
{"title":"Towards an approach to design and enforce security in web service composition","authors":"F. Lins, J. Damasceno, Bruno Silva, Robson W. A. Medeiros, Andre R. R. Souza, Fabricio Teles, David Aragão, E. Sousa, N. Rosa, Bryan Stephenson, H. M. Nezhad, Jun Yu Li","doi":"10.1504/IJWET.2012.050966","DOIUrl":"https://doi.org/10.1504/IJWET.2012.050966","url":null,"abstract":"Modelling and enforcing security requirements is an important but challenging task in web service composition. However, the explicit treatment of security requirements is challenging for many reasons: diversity of security background of involved stakeholders, absence or complexity of notations to express security requirements, complexity of mapping security requirements into security mechanisms and enforcing them at runtime. Existing work often delays considering the security requirements until the implementation and execution. We present an approach to design and enforce security in web service composition. By adopting the proposed approach, security requirements are incorporated during the business process definition and service composition code generation, and enforced at runtime. The proposed approach is supported by a set of tools that allows annotating business processes with security requirements, refining the security annotated business process and enforcing security annotations at execution time. We showcase an illustrative application to demonstrate the proposed approach and developed tools.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133842575","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
Sentiment classification of Chinese online reviews: analysing and improving supervised machine learning 中文在线评论的情感分类:分析和改进监督机器学习
Int. J. Web Eng. Technol. Pub Date : 2012-12-01 DOI: 10.1504/IJWET.2012.050968
P. Yin, Hongwei Wang, Lijuan Zheng
{"title":"Sentiment classification of Chinese online reviews: analysing and improving supervised machine learning","authors":"P. Yin, Hongwei Wang, Lijuan Zheng","doi":"10.1504/IJWET.2012.050968","DOIUrl":"https://doi.org/10.1504/IJWET.2012.050968","url":null,"abstract":"With the boost of online reviews, a large quantity of consumers' opinions on certain products and services are generated and spread over the internet, thus techniques of sentiment classification for online reviews rise in response to the requirement of retrieving valuable information. This paper is mainly focused on improving sentiment classification of Chinese online reviews through analysing and improving each step in supervised machine learning. At first, adjectives, adverbs, and verbs are selected as the initial text features. Then, three statistic methods (DF, IG and CHI) are utilised to extract features. At last, a Boolean method is applied to set weight to features and a support vector machine (SVM) is employed as the classifier. Several comparative experiments have been conducted on reviews of two domains: mobile phone (product) reviews and hotel (service) reviews. The experimental results indicate that part of speech (POS), the number of features, evaluation domain, feature extraction algorithm and kernel function of SVM have great influences on sentiment classification, while the number of training corpora has a little impact. In addition, further improvements of DF IG and CHI have been made, which demonstrate the theoretical significance and the practical value of this research.","PeriodicalId":396746,"journal":{"name":"Int. J. Web Eng. Technol.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126468059","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
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学术文献互助群
群 号:481959085
Book学术官方微信