Research on Rough Sets Based Service Matchmaking Algorithm for Pervasive Computing

摘要

Rough sets theory is applied to the service matchmaking algorithm for pervasive computing. The relevant service matchmaking algorithm model and method are presented in the paper. The decision system is built on the basis of the sample data from service resources. The evaluation indexes for service matchmaking are taken as the attributes to find out the important attributes that reflect the essential relationship of evaluation indexes and the attribute rules for service matchmaking. These reduction attributes and matchmaking rules are good to demonstrate the essential characteristics among the attributes in finite sample. Finally, the method is justified through attribute dependency.