An Approach to Aggregate the Partial Rank List of Web Services in E-Business

An Approach to Aggregate the Partial Rank List of Web Services in E-Business

V. Mareeswari (School of Information Technology and Engineering, Vellore Institute of Technology (VIT), Vellore, India) and E. Sathiyamoorthy (School of Information Technology and Engineering, Vellore Institute of Technology (VIT), Vellore, India)
Copyright: © 2019 |Pages: 20
DOI: 10.4018/IJEBR.2019010106
OnDemand PDF Download:
No Current Special Offers


In the present web era, efficient and topmost outcomes of applications, such as recommender systems, search engines, voting and other ranking applications fascinate web users. Web services maintain communication among applications and applications to end users. In E*Trade, the support system evolves to suggest services based on the user's browser preferences. Services thus are ranked depending on the quality of service of the corresponding service from a user perspective. There are adequate services that are accessible, but users utilize only their desired services and give their ranking. In the process of final rank generation, merging the long partial ranked list by heterogeneous web service users is not adequate in current research articles. This approach applies the efficient methods of Markov chain for this dynamic context, and validating using real datasets and results showed the efficiency of this approach. This ranking approach engages the consumers to choose their services in a short span in the decision-making process in this competitive electronic business system.
Article Preview


In recent research areas of big data, cloud computing and IoT technologies, mining techniques should offer effective solutions to speed up entire applications. Web services perform an essential role in providing functionalities for exchanging information and services. Most electronic business (e-business) processes are endorsed by web services. The multiple web services are registered frequently in a central repository with descriptions.

In a typical scenario, a user’s request does not satisfy the single service or the perfect match of a requested service is unavailable in the discovery system. Multiple services needed to be composed and delivered to the user. When selecting a related service, the search engine finds multiple matches of the services. The discovery mechanism or agent therefore elects the best service among the available candidate services. The ranking involved in this situation produces the top-ranked results of the service description as a response to the user's request. Most users attempt the top-desired services on the list. The ranking process therefore is a substantial part of web service selection.

Furthermore, prediction is a crucial part of the web service selection. The system predicts the services that will help in the selection and business process. Many authors (Huang, Huang, Cheng, He, & Chen, 2017; Jayapriya, Mary, & Rajesh, 2016; Li, Wang, & Xiao, 2017) have intended to predict the service by developing algorithms in different areas of research. This is to improve the business by recommending services to the users. Users find their preferred services more easily because they are offered by the provider, which reduces the selection time. The curiosity of users also increases and motivates them to purchase other preferred services. These outcomes are derived from the experienced user’s perspectives or quality of service (QoS) values. The ranking of web service hence supports the efficient prediction system. Some questions raised in this stage include how to compare services, rank services, combine the entire rank list, determine the winner of the available service and produce a final list. Other questions raised include how to aggregate the top rank list given by experts, aggregate the full rank list given by all users and aggregate the partial rank list of missing services. This work picks up the challenge of predicting the rank sequence by aggregating available partial rank sequences that contain many services.

The ranking system generates a rank sequence with all participants of service. The collection of individuals’ input rank sequences (IRSs) are organized in two ways (Li et al., 2017), as shown in Table 1. Format 1 is item-based and each column represents the IRS of four individuals: IRS1, IRS2, IRS3 and IRS4. Each row represents the web services that partake in the ranking, whilst each cell represents the rank value of a particular web service given by individuals. Format 2 is rank-based and each column represents the IRSs of the four individuals mentioned above. Here, each row represents the rank value and each cell value represents the web services arranged in order as per the individuals. In the implementation, format 2 is more complicated for the aggregation of rank sequences. Format 1 thus is suitable for many real-world applications. The R package ‘RobustRankAggreg’ supports both format 1 and format 2. While giving input in format 2, first it is converted into format 1 and then it can be processed for aggregation. The ‘TopKList’ package processes the input in either of the above formats.

Table 1.
The format of organizing the input rank sequence

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 18: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 17: 4 Issues (2021): 2 Released, 2 Forthcoming
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing