Prediction of Web Services Reliability Based on Decision Tree Classification Method

With the development of the service-oriented computing(SOC),web service has an important and popular solution for the design of the application system to various enterprises.Nowadays,the numerous web services are provided by the service providers on the network,it becomes difficult for users to select the best reliable one from a large number of services with the same function.So it is necessary to design feasible selection strategies to provide users with the reliable services.Most existing methods attempt to select services according to accurate predictions for the quality of service(QoS)values.However,because the network and user needs are dynamic,it is almost impossible to accurately predict the QoS values.Furthermore,accurate prediction is generally time-consuming.This paper proposes a service decision tree based post-pruning prediction approach.This paper first defines the five reliability levels for measuring the reliability of services.By analyzing the quality data of service from the network,the proposed method can generate the training set and convert them into the service decision tree model.Using the generated model and the given predicted services,the proposed method classifies the service to the corresponding reliability level after discretizing the continuous attribute of service.Moreover,this paper applies the post-pruning strategy to optimize the generated model for avoiding the over-fitting.Experimental results show that the proposed method is effective in predicting the service reliability.

Half-global discretization algorithm based on rough set theory

It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasonable discretization results, a discretization algorithm is proposed, which arranges half-global discretization based on the correlational coefficient of each continuous attribute while considering the uniqueness of rough set theory. When choosing heuristic information, stability is combined with rough entropy. In terms of stability, the possibility of classifying objects belonging to certain sub-interval of a given attribute into neighbor sub-intervals is minimized. By doing this, rational discrete intervals can be determined. Rough entropy is employed to decide the optimal cut-points while guaranteeing the consistency of the decision table after discretization. Thought of this algorithm is elaborated through Iris data and then some experiments by comparing outcomes of four discritized datasets are also given, which are calculated by the proposed algorithm and four other typical algorithras for discritization respectively. After that, classification rules are deduced and summarized through rough set based classifiers. Results show that the proposed discretization algorithm is able to generate optimal classification accuracy while minimizing the number of discrete intervals. It displays superiority especially when dealing with a decision table having a large attribute number.

Continuous Multiplicative Attribute Graph Model

Network modeling is an important approach in many fields in analyzing complex systems. Recently new series of methods have emerged, by using Kronecker product and similar tools to model real systems. One of such approaches is the multiplicative attribute graph(MAG) model, which generates networks based on category attributes of nodes. In this paper we try to extend this model into a continuous one, give an overview of its properties, and discuss some special cases related to real-world networks, as well as the influence of attribute distribution and affinity function respectively.

GRIP： A Group Recommender Based on Interactive Preference Model

Numerous applications of recommender systems can provide us a tool to understand users. A group recommender reflects the analysis of multiple users＇ behavior, and aims to provide each user of the group with the things they involve according to users＇ preferences. Currently, most of the existing group recommenders ignore the interaction among the users. However, in the course of group activities, the interactive preferences will dramatically affect the success of recommenders. The problem becomes even more challenging when some unknown preferences of users are partly influenced by other users in the group. An interaction-based method named GRIP （Group Recommender Based on Interactive Preference） is presented which can use group activity history information and recommender post-rating feedback mechanism to generate interactive preference parameters. To evaluate the performance of the proposed method, it is compared with traditional collaborative filtering on the MovieLens dataset. The results indicate the superiority of the GRIP recommender for multi-users regarding both validity and accuracy.