提出了基于主题聚类的Web资源个性化推荐算法PRWRTC(personalized recommendations of Web resource based on Topic clustering),该算法首先基于Web资源的主题提出Web资源聚类算法,从而提高Web资源聚类的精确度,进而提升Web资源推荐的...提出了基于主题聚类的Web资源个性化推荐算法PRWRTC(personalized recommendations of Web resource based on Topic clustering),该算法首先基于Web资源的主题提出Web资源聚类算法,从而提高Web资源聚类的精确度,进而提升Web资源推荐的准确度;然后,基于用户的浏览行为,提出实时获取用户偏好的算法;最后,针对用户偏好的动态演化,在算法中加入了时效的概念,实现了对Web资源的动态推荐.并通过实验验证了该算法的有效性.展开更多
In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are c...In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are compared with the help of a matching algorithm.The algorithm has two levels and filters out the services which do not match the user’s constraint personality requirements.The mechanism can reduce the searching scope at the beginning of the service composition algorithm.Secondly,satisfactions of those selected services for the user’s personality requirements are computed and those services,which have the greatest satisfaction value to make up the service composition,are used.The algorithm is evaluated analytically and experimentally based on the efficiency of service composition and satisfaction for the user’s personality requirements.展开更多
文摘提出了基于主题聚类的Web资源个性化推荐算法PRWRTC(personalized recommendations of Web resource based on Topic clustering),该算法首先基于Web资源的主题提出Web资源聚类算法,从而提高Web资源聚类的精确度,进而提升Web资源推荐的准确度;然后,基于用户的浏览行为,提出实时获取用户偏好的算法;最后,针对用户偏好的动态演化,在算法中加入了时效的概念,实现了对Web资源的动态推荐.并通过实验验证了该算法的有效性.
基金The National Natural Science Foundation of China(No.60673130)the Natural Science Foundation of Shandong Province(No.Y2006G29,Y2007G24,Y2007G38)
文摘In order to improve the efficiency and quality of service composition,a service composition algorithm based on semantic constraint is proposed.First, a user’s requirements and services from a service repository are compared with the help of a matching algorithm.The algorithm has two levels and filters out the services which do not match the user’s constraint personality requirements.The mechanism can reduce the searching scope at the beginning of the service composition algorithm.Secondly,satisfactions of those selected services for the user’s personality requirements are computed and those services,which have the greatest satisfaction value to make up the service composition,are used.The algorithm is evaluated analytically and experimentally based on the efficiency of service composition and satisfaction for the user’s personality requirements.