Hao Tian

Dr. Hao Tian

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 October 2017 in Future Internet
Verified
Journal Article
Open access
PDF file
LDLijun Duan
Lijun Duan
HTHao Tian
Hao Tian
With the increasing application of web services in varying fields, the demand of effective Web service discovery approaches is becoming unprecedentedly strong. To improve the performance of service discovery, this paper proposes a collaborative Web service discovery and recommendation mechanism based on social link by extracting the latent relationships behind users and services. The presented approach can generate a set of candidate services through a complementary manner, in which service discovery and service recommendation could collaborate according to the formalized social link. The experimental results reveal that the proposed mechanism can effectively improve the efficiency and precision of Web service discovery.

7 March 2017 in Scientific Programming
Verified
Journal Article
Open access
PDF file
HTHao Tian
Hao Tian
PLPeifeng Liang
Peifeng Liang
With the rapid development and extensive application of Web services, various approaches for Web service recommendation have been proposed in the past. However, the traditional methods only utilize the information of the user-service rating matrix but ignore the trust relations between users, so their recommendation precision is often unsatisfactory, and, furthermore, most of these methods lack the ability to distinguish the credibility of recommendation. To address the problems, we proposed a personalized service recommendation based on trust relationship. In particular, our approach takes into account user experience, interest background, recommendation effect, and evaluation tendency in the formalization of trust relationship, and moreover it can filter out useless or suspected services by exploiting trust relationships between users. To verify the proposed approach, we conducted experiments by using a real-world Web services set. The experimental results show that our proposed approach leads to a substantial increase in the precision and the credibility of service recommendations.

21 March 2017 in Future Internet
Verified
Journal Article
Open access
PDF file
HTHao Tian
Hao Tian
PLPeifeng Liang
Peifeng Liang
In order to alleviate the pressure of information overload and enhance consumer satisfaction, personalization recommendation has become increasingly popular in recent years. As a result, various approaches for recommendation have been proposed in the past few years. However, traditional recommendation methods are still troubled with typical issues such as cold start, sparsity, and low accuracy. To address these problems, this paper proposed an improved recommendation method based on trust relationships in social networks to improve the performance of recommendations. In particular, we define trust relationship afresh and consider several representative factors in the formalization of trust relationships. To verify the proposed approach comprehensively, this paper conducted experiments in three ways. The experimental results show that our proposed approach leads to a substantial increase in prediction accuracy and is very helpful in dealing with cold start and sparsity.

6 July 2019 in Information
Verified
Journal Article
Open access
PDF file
LDLijun Duan
Lijun Duan
HTHao Tian
Hao Tian
KLKun Liu
Kun Liu
Service recommendation is one of the important means of service selection. Aiming at the problems of ignoring the influence of typical data sources such as service information and interaction logs on the similarity calculation of user preferences and insufficient consideration of dynamic trust relationship in traditional trust-based Web service recommendation methods, a novel approach for Web service recommendation based on advanced trust relationships is presented. After considering the influence of indirect trust paths, the improved calculation about indirect trust degree is proposed. By quantifying the popularity of service, the method of calculating user preference similarity is investigated. Furthermore, the dynamic adjustment mechanism of trust is designed by differentiating the effect of each service recommendation. Integrating these efforts, a service recommendation mechanism is introduced, in which a new service recommendation algorithm is described. Experimental results show that, compared with existing methods, the proposed approach not only has higher accuracy of service recommendation, but also can resist attacks from malicious users more effectively.