Vol.14 No.3&4 July 1, 2015

Organizing Information in Medical Blogs Using a Hybrid Taxonomy-Folksonomy Approach (pp181-195)
        Yamen Batch and Maryati Mohd. Yusof

Machine Learning in Efficient and Effective Web Service Discovery (pp196-214)
        Kailash Chander Bhardwaj and R.K. Sharma
The web service discovery mechanism has continuously evolved during the last years. There is plethora of information available about various techniques and methods used for meeting the challenge of improving web service discovery. A tremendous effort has been reported in literature and researchers are still contributing to make the web service discovery more effective and efficient. This paper discusses various eminent researchers’ work in this direction using machine learning based techniques. Machine learning is a promising area for researchers to produce accurate estimates consistently. Machine learning system effectively "learns" how to estimate from training set of completed projects. We hope that this paper would benefit researchers to carry further work discussed in this paper and provide an outlook for the future research trends.

An Online System for Notification of Changes to Blogging Space to Achieve Information Domination (pp215-233)
        Mehdi Naghavi and Mohsen Sharifi
Exponential growth of information in the Cyberspace alongside rapid advancements in its related technologies has created a new mode of competition between societies to gain information domination in this critical and invaluable space. It has thus become quite critical to all stakeholders to play a leading and dominant role in the generation of information and monitoring of voluminous information uploaded to this space. Dominance in monitoring of large amount of information in cyberspace requires real-time monitoring using new techniques and approaches instead of traditional techniques. Concerned with the latter case, we limit our focus in this paper on Blogs as an important part of the Cyberspace and propose a novel notification system for quick reporting of changes made to Blogs. This is achieved by restricting the search for changes to high volumes of Blogs only to changes to the abstracts of Blogs derived from Blogs. We show that this system works favourably compared to systems that require cooperation and synchronization between information providers.

A Novel Twig-Join Swift Using SST-Based Representation for Efficient Retrieval of Internet XML (pp234-250)
        Yi-Wei Kung, Hsu-Kuang Chang, and Chung-Nan Lee
Compiling documents in extensible markup language (XML) plays an important role in accessing data services when both rapid response and the precise use of search engines are required. The main operation in XML query processing is to find nodes that match the given query tree pattern (QTP) in the document. An efficient query service should be based on a skillful representation that can support low complexity and high precision search capabilities. However, accessing too many useless nodes in order to match a query pattern is very time-consuming. This paper proposes a structural summary tree (SST) algorithm that is not only able to satisfy a query, but also has better time-saving efficiency compared with the existing twig-join algorithms such as the TJFast algorithm. A novel twig-join Swift (TJSwift) associated with adjacent linked (AL) lists for the provision of efficient XML query services is also proposed, in which queries can be versatile in terms of predicates. TJSwift can completely preserve hierarchical information, and the new index generated from SST is used to save semantic information. The TJSwift approach can provide template-based indexing for fast data searches. An experiment is also conducted for the evaluation of the TJSwift approach.

Assisting developers to build high-quality code-first Web Service APIs (pp251-285)
        Juan Manuel Rodriguez, Cristian Mateos, and Alejandro Zunino 
Searching and understanding Web Services is challenging mainly because service developers tend to disregard the importance of the exposed service APIs. In many situations these APIs are defined using WSDL documents, which are written in an XML dialect. Service developers can opt between manually writing these documents or inferring them from service implementations. This work is focused on the later methodology and provides techniques and tools for generating WSDL documents avoiding well-known bad practices (e.g., lack of textual comments or representative names) that compromise Web Service API quality. Our experiments show that by using our approach the obtained WSDL documents are more likely to be free from these undesirable practices so they better describe service functionality. In addition, these experiments show that the WSDL documents generated using our approach also have other important quality-related features, such as less redundant data-type definitions and better defined data-types. Experiments have been performed by comparing our proposal against WSDL generation tools/\-approaches from both the industry and the academy.

Comparison of Hybrid Approaches with Traditional Algorithms for Improving Scaleability (pp286-300)
        Suriya Sundaramoorthy, S.P. Shantharajah, and Suresh Kannan Sundaramoorthy
Frequent pattern mining always occupies its space in research activities in spite of various emerging research ideas. This paper focuses on performance of four competitive algorithms namely hybrid k-Direct Count and Intersect algorithm with apriori algorithm, hybrid k-Direct Count and Intersect algorithm with transaction mapping algorithm, Modified Ant Colony algorithm and improved Ant Colony algorithm over frequent pattern mining against traditional algorithms. We focus on a set of well defined parameters such as database layout, scanning of input databases, memory requirement, input / output cost, input / output overhead, computational cost, execution speed, scalability, support for parallelization, complexity of the algorithm to do this comparison. Experimental results support for this effective comparison with help of visualization through graphs. We used ASP.net as front end tool and SQL server 2005 as back end tool for implementing our proposed approaches. As a result of this study, there is good improvement in effectiveness of pattern mining in all aspects while using the improved Ant Colony algorithm against other hybrid approaches and traditional algorithms.

A Novel Ontology Evolution Methodology (pp301-324)
        Ali Rahnama and Ahmad Abdollazadeh Barforoush
In recent years, ontology engineering has received a great amount of attention and has advanced greatly. Today, ontologies are finding their role in knowledge and information systems. To keep up with the dynamic aspect of knowledge, the need for ontology evolution systems has emerged. Such systems help facilitate the management of changes on the ontology in a systematic way. To define a systematic way of facilitating management of changes, a process model is needed. Therefore in this paper, we present our novel ontology evolution process model which uses ontology change rules to achieve this goal. These change rules are defined via the SWRL rule representation language. This new approach to ontology evolution helps the ontology evolution process by preserving the consistency of the ontology throughout the ontology evolution process. To classify ontology changes, we will also present our novel taxonomy of ontology changes. To test the feasibility of our presented process model, we have implemented the OntoEvol system. It is also presented in this paper.

Semantic-based Clustering of Web Services (pp325-345)
        Leonardo de Jesus Silva, Daniela Barreiro Claro, and Denivaldo Lopes
The interoperability needed for the exchange of information between organizations is currently obtained through Service Oriented Architecture (SOA). Through the implementation of Web services, components can be described in a consistent and standardized way. However, there is a high number of published Web services, it is important to have some organization in order to determine specific areas of these services. Thus, our approach proposes creating semantically similar domains of Web services by applying clustering algorithms. Two clustering algorithms were adapted and evaluated. Each cluster was validated in order to analyze whether the Web services were grouped correctly. Our results evaluated each group and the set of categorized services.

Credential Purpose-based Access Control for Personal Data Protection (pp346-360)
        Norjihan Abdul Ghani, Harihodin Selamat, and Zailani Mohamed Sidek
Web-based applications enable users to carry out their business transactions virtually at any time and place. They require users to disclose almost all their personal information. Organizations on the other hand will collect, process, and store a huge amount of this information, which results in a greater risk of information disclosure. Enforcing personal information protection in databases requires controlled access to systems and resources and is only granted to authorized users. Previous research on purpose-based access control does not fully support personal data protection, especially users’ rights and less user participation towards their personal data once it is released via web applications. This paper formulates a solution to control access while ensuring that personal data is protected and that users have full control over their own data. This model, which implements two-phase security involving user authentication using personal credential and data authorization based on purpose, is presented. The purpose of this model is to protect personal information that has been collected via web-based applications by using data access control.

Back to JWE Online Front Page