Mobile Information Systems
Volume 2016 (2016), Article ID 4397061, 12 pages
http://dx.doi.org/10.1155/2016/4397061

Research Article

Time-Aware IoE Service Recommendation on Sparse Data

Lianyong Qi,1,2 Xiaolong Xu,³ Wanchun Dou,² Jiguo Yu,¹ Zhili Zhou,³ and Xuyun Zhang⁴

¹School of Information Science and Engineering, Qufu Normal University, Qufu, China
²Department of Computer Science and Technology, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
³School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, China
⁴Department of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand

Received 15 September 2016; Accepted 10 November 2016

Academic Editor: Beniamino Di Martino

Copyright © 2016 Lianyong Qi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

With the advent of “Internet of Everything” (IoE) age, an excessive number of IoE services are emerging on the web, which places a heavy burden on the service selection decision of target users. In this situation, various recommendation techniques are introduced to alleviate the burden, for example, Collaborative Filtering- (CF-) based recommendation. Generally, CF-based recommendation approaches utilize similar friends or similar services to achieve the recommendation goal. However, due to the sparsity of user feedback, it is possible that a target user has no similar friends and similar services; in this situation, traditional CF-based approaches fail to produce a satisfying recommendation result. Besides, recommendation accuracy would be decreased if time factor is overlooked, as IoE service quality often varies with time. In view of these challenges, a time-aware service recommendation approach named is proposed in this paper. Concretely, we first calculate the time-aware user similarity; afterwards, indirect friends of the target user are inferred by Social Balance Theory (e.g., “enemy’s enemy is a friend” rule); finally, the services preferred by indirect friends of the target user are recommended to the target user. At last, through a set of experiments deployed on dataset WS-DREAM, we validate the feasibility of our proposal.

1. Introduction

With the wide adoption of various smart devices and connection technologies, human society is gradually transforming into an “Internet of Everything” (IoE) one [1–5]. In the age of IoE, the links among users, devices, or other things could be built easily, which significantly improves people’s quality of life and also brings many challenging open problems that need to be addressed [6–11].

With the advent of IoE age, an excessive number of IoE services with different functionalities or qualities are emerging on the web, which places a heavy burden on the service selection decision of target users [12–14]. In this situation, various recommendation techniques are put forward to help alleviate the service selection burden, for example, Collaborative Filtering- (CF-) based recommendation [15–19]. Generally, CF-based recommendation approaches (including user-based CF, item-based CF, and hybrid CF) utilize the similar friends or similar services of target users to achieve the recommendation goal. However, in certain situations, the available user-service rating data generated from historical service invocations is really sparse [20]. Therefore, it is probable that a target user cannot find his/her similar friends and similar services of target services (here, target services mean the services preferred by target users). In this situation, traditional CF-based recommendation approaches cannot return a satisfying recommendation result, which brings a great challenge for the robustness of service recommendation approaches. Besides, the quality of an IoE service often varies with time, due to the unstable network environment [21]. For example, the response time of a ticket-order service often becomes larger when Christmas day is approaching. Therefore, recommendation accuracy would be decreased if the time factor is not taken into consideration.

In view of the above two challenges, a novel time-aware service recommendation approach, that is, , is put forward in this paper, to make robust and accurate service recommendation for target users when the historical user-service rating data is sparse. Concretely, in , we first calculate the time-aware user similarity; afterwards, we look for the enemies (antonym of “friend”) of the target user and further determine the “indirect friends” of target user by Social Balance Theory [22] (e.g., “enemy’s enemy is a friend” rule); finally, the services preferred by indirect friends of target user are recommended to the target user.

The contributions of our paper are threefold.

(1)Time factor is considered in user similarity calculation to adapt to the dynamic quality variation of IoE services, which makes the subsequent recommendation result more objective and accurate.(2)Social Balance Theory is introduced for service recommendation on sparse data so that the recommendation robustness is improved.(3)A wide range of experiments are designed and deployed on a real web service quality set WS-DREAM [23], so as to further validate the feasibility of our proposal.

The remainder of our paper is organized as follows. In Section 2, we first formalize the CF-based service recommendation problem and afterwards demonstrate the motivation of our paper. In Section 3, a novel time-aware service recommendation approach named is brought forth. A set of experiments are deployed in Section 4 and evaluations are presented in Section 5. Finally, in Section 6, we summarize the paper and point out our future research directions.

2. Formalization and Motivation

In this section, we first formalize the CF-based service recommendation problem. And afterwards, an example is presented to demonstrate the motivation of our paper intuitively.

2.1. Formal Specification

Generally, the CF-based service recommendation problem could be specified with a four-tuple , where

(1) denotes the user set in user-service invocation network and is the number of users;(2) denotes the web service set in user-service invocation network and is the number of web services;(3) denotes the historical invocation record set, that is, , which means that invoked in the past and the rating of by is . Here, for simplicity, the well-known rating system is adopted to depict . Also, each invocation record owns a timestamp that indicates the service invocation time (here, we assume the timestamp format is “yyyy.mm.dd”);(4) denotes the target user that requires service recommendation and holds.

With the above formalization, CF-based service recommendation problem could be specified as follows: according to the historical invocation record set “” between users (in ) and web services (in ), find out the services that were never invoked but may be preferred by target user and recommend them to .

2.2. Motivation

In this subsection, the paper motivation is clarified more intuitively with the example shown in Figure 1. In Figure 1, there are three users (Tom is the target user) in set and six web services in set ; historical user-service invocation record set (including rating data and timestamp) is also presented in Figure 1.

Figure 1: Time-aware service recommendation when target user has no similar friends and similar services.

Then according to the Adjusted Cosine Similarity [24] (i.e., ; here, the reason that we utilize ACS for similarity calculation is that user-service rating data is often discrete and the rating scales of different users often vary), we can calculate the similarity between target user Tom and other two users (i.e., Alice and Bob). Concretely, and (as no services were rated by both Tom and Bob). Therefore, we can conclude that target user Tom has no similar friends, so according to the traditional user-based CF recommendation approaches, no qualified services are recommended to Tom.

Likewise, the similarities between target services (i.e., and ) and other services (i.e., , , , and ) could also be obtained. Concretely, = = = and = = = (as no users invoked any pair of services above simultaneously). Therefore, a conclusion could be drawn that target user Tom’s preferred services (i.e., and ) have no similar services, so according to the traditional item-based CF recommendation approaches, no qualified services are recommended to Tom.

Therefore, in this situation, traditional CF-based service recommendation approaches (e.g., user-based CF, item-based CF, or hybrid CF) cannot make accurate service recommendation for target user. Besides, as Figure 1 shows, the timestamps of various invocation records are often different, so the service recommendation accuracy and fairness would be decreased if we overlook the time factor in recommendation process. In view of the above two challenges, a novel service recommendation approach named is put forward in Section 3.   cannot only find out the indirect friends of a target user so as to improve the recommendation robustness in sparse-data environment, but also consider time factor in recommendation so as to ensure the fairness and accuracy of recommendation results.

3. Time-Aware Service Recommendation Approach:

In this section, a novel time-aware recommendation approach, that is, , is introduced to deal with the service recommendation problem on sparse data. The main idea of our proposal is as follows: first, we calculate the time-aware similarity between target user and other users based on the historical user-service rating records; second, according to the derived user similarity and Social Balance Theory, we infer the indirect friends of target user; third, the services preferred by indirect friends of target user are recommended to the target user. Concretely, the three steps of time-aware service recommendation approach () are as follows.

Step 1 (time-aware user similarity calculation). Calculate the similarity between and other users . If ( is similarity threshold), then is considered as an enemy of .

Step 2 (determining indirect friends of target user). According to the enemies (derived in Step  1) of target user and Social Balance Theory, determine target user’s indirect friends.

Step 3 (service recommendation). Select the services preferred by the indirect friends (derived in Step  2) of target user and recommend them to the target user.

The three steps are explained as follows:

Step 1 (time-aware user similarity calculation). In this step, we calculate the similarity between target user and other users , that is, . As user-service rating data is often discrete and rating scores of a service by different users are often varied, Adjusted Cosine Similarity is recruited here for user similarity calculation. Concretely, could be obtained based on

Here, set denotes the common services that were rated by both and ; sets and denote the service set rated by and , respectively; and denote ratings of service by and , respectively; while and represent ’s and ’s average rating values. Then according to (1), we can calculate the similarity between target user and any other user.
Next, we improve the user similarity formula in (1) by introducing four kinds of weight coefficients.

(i)Weight for Service Intersection Size. As formula (1) indicates, and denote the service set rated by and , respectively. Generally, for and , the larger their service intersection (i.e., set in formula (1)) is, the more convincing their similarity is. So in order to depict this correlation, weight (in formula (2)) is assigned to user similarity :

(ii)Weight for Invocation Time. Due to the dynamic and unstable network environment, the IoE service quality is often varied with time; therefore, two neighboring service invocations with close invocation time often contribute more to the user similarity. In view of this observation, similar to work [4], weight in formula (3) is assigned to user similarity . In (3), is a parameter, while and represent the invocation time of service by and , respectively

(iii)Weight for Invocation Load. Service invocation time cannot reflect all the time-related information in similarity calculation. For example, and invoked the same ticket-booking service on 22-12-2015 and 24-12-2015, respectively. Although their service invocation time is close, the user experienced service quality may vary significantly as heavy service load is inevitable when Christmas day is approaching. So in order to depict the effect of service load on user similarity, weight in formula (4) is assigned to user similarity . In (4), and denote the service loads when and invoked service , respectively.

(iv)Weight for Service Version. In the life cycle of a web service, service provider may publish a series of service versions with updated service qualities. Therefore, if two users invoked an identical web service that belongs to different versions, it would not make much sense to compare their experienced service qualities. In view of this observation, weight is suggested as follows:

With the above analyses, we can update the user similarity in (1) to be time-aware user similarity in (6). Then based on (6), we can calculate the time-aware similarity between target user and any other user:

Furthermore, according to the derived user similarity, the enemy set of target user, that is, (), could be obtained based on (7). Here, parameter is a predefined user similarity threshold for enemy relationship:

Step 2 (determining indirect friends of target user). In Step  1, we have obtained the enemy set of target user, that is, . Next, in this step, we will introduce how to get the indirect friends of target user, that is, , based on the obtained and Social Balance Theory. First of all, we introduce Social Balance Theory briefly.
Social Balance Theory [22] was first put forward by psychologist F. Heider in 1958. The theory investigates the stable social relationships among involved three parties (i.e., , , and in Figure 2). Concretely, according to Figure 2, we introduce the four stable social relationships, respectively, in a more intuitive manner.

(a)Friend’s Friend Is a Friend. If is a friend of and is a friend of , then we can infer that is probably an indirect friend of (see Figure 2(a)).(b)Enemy’s Enemy Is a Friend. If is an enemy of and is an enemy of , then we can infer that is probably an indirect friend of (see Figure 2(b)).(c)Friend’s Enemy Is an Enemy. If is an enemy of while is a friend of , then we can infer that is probably an indirect enemy of (see Figure 2(c)).(d)Enemy’s Friend Is an Enemy. If is a friend of while is an enemy of , then we can infer that is probably an indirect enemy of (see Figure 2(d)).

Next, with the above four rules in Social Balance Theory, we introduce how to obtain the indirect friend set of target user, that is, , based on the derived in Step  1.
Concretely, for each , we first calculate his/her similarities with other users based on (6); afterwards, we determine ’s enemies (i.e., ) based on (7) and ’s friends (i.e., ) based on (8). In (8), parameter denotes the user similarity threshold for friend relationship. To ease the understanding of readers, the relationships among , , , and are presented in Figure 3.

Then according to “enemy’s enemy is a friend” rule in Figure 2(b), we can infer that is probably an indirect friend of , and the probability could be calculated based on (9). If , then is regarded as a qualified indirect friend of target user and put into set (see Figure 3(b)). Likewise, according to “enemy’s friend is an enemy” rule in Figure 2(d), it can be inferred that is probably an indirect enemy of , and the probability can be obtained based on (10). If , then is regarded as a qualified indirect enemy of target user and put into set (see Figure 3(d))

Next, for each , we calculate his/her similarity with other users -- based on (6) and further determine ’s enemies based on (7) and ’s friends based on (8). Then according to “friend’s enemy is an enemy” rule in Figure 2(c), is regarded as an indirect enemy of target user and put into (see Figure 3(c)) if the probability in (11) is larger than −. Likewise, according to “friend’s friend is a friend” rule in Figure 2(a), is considered as an indirect friend of target user and put into (see Figure 3(a)) if the probability in (12) is larger than .

Repeat (a)–(d) process in Figure 3 until set stays stable. Then we obtain the indirect friends of target user, that is, .

(a)

(b)

(c)

(d)

Figure 2: Four stable relationships among , , and according to Social Balance Theory (the blue arrows between and denote the inferred relationships).

Figure 3: Relationships among , , , , , , and .

Step 3 (service recommendation). In Step  2, we have obtained target user’s indirect friend set . Next, in this step, we select the services preferred (i.e., with or rating) by indirect friends of target user and recommend them to the target user. More formally, for each element , if his/her rating over web service (), that is, , holds, then is put into the recommended service set, that is, . Finally, all the web services in set are recommended to .

With above Step  1–Step  3 of our proposed approach, a set of IoE services (in set ) are recommended to the target user. More formally, the pseudocode of is presented in Algorithm 1 (please note that algorithm is abbreviated as in the whole paper).

Inputs:

   : a set of users in user-service invocation & rating network;

  : a set of web services in user-service invocation & rating network;

  : a set of historical user-service rating records;

  : target user who requires service recommendation.

Output: : service set recommended to

  Set user similarity threshold   ()

  for  each   do    // Step  1

    calculate based on (1)–(6)

    if  

     then  put into set

    end  if

  end  for

  for  each   do    // Step  2

    determine ’s friend based on (6) and (8)

    if  probability in (10) is larger than

    then  put into

    end  if

    determine ’s enemy based on (6) and (7)

    if  probability in (9) is larger than

    then  put into

    end  if

  end  for

  for  each   do

    determine ’s enemy based on (6) and (7)

    if  probability in (11) is larger than

    then  put into

    end  if

    determine ’s friend based on (6) and (8)

    if  probability in (12) is larger than

    then  put into

    end  if

  end  for

  repeat Line –Line until stays stable

      // Step  3

  for  each   do

    for  each   do

     if  

     then  put into set

     end  if

    end  for

  end  for

  return  

Algorithm 1: .

4. Experiment

In this section, a set of experiments are designed and tested to validate the feasibility of our proposed approach, in terms of recommendation accuracy, recall, and efficiency.

4.1. Experiment Dataset and Deployment

The experiment is based on a real service quality dataset WS-DREAM [23]. WS-DREAM consists of 4532 IoE services on the web, and 142 distributed users from Planet-Lab are employed for evaluating the real quality (e.g., response time and throughput) of services in 64 time intervals (time interval = 15 minutes).

Our paper focuses on the user-service rating-based recommendation, while available user-service rating data is really rare on the web; therefore, in the experiment, we need to transform the service quality data in WS-DREAM into corresponding user-service rating data (essentially, objective service quality data and subjective user-service rating data both reflect the service running quality; therefore, we argue that the transformation from former data to latter data makes sense for the service recommendation simulation here). Concretely, the transformation process is as follows: we determine the minimal and maximal quality values (denoted by and , resp.) of a service observed by an identical user, and afterwards we divide the range into five subranges in an arithmetic progression manner, each corresponding to a rating value. For example, if the minimal and maximal throughput values of a service observed by are 10 kbps and 60 kbps, respectively, then we can get five subranges after division, that is, [10, 20) kbps, [20, 30) kbps, [30, 40) kbps, [40, 50) kbps, and [50, 60] kbps. Furthermore, if the throughput value of observed by is 44 kbps in WS-DREAM, then the transformed user-service rating, that is, , holds. For each service invoked by a user, we randomly select a time interval from all the 64 intervals and transform the service quality corresponding to the selected time interval into a user-service rating with a timestamp (i.e., the selected time interval). In the experiment, only a quality dimension, that is, throughput, is considered.

Besides, our paper only discusses the time-aware service recommendation in sparse-data environment where target user has no similar friends and similar services. Therefore, we select appropriate data from WS-DREAM to simulate the above sparse recommendation situations. Furthermore, for each recruited target user, his/her 80% ratings are randomly selected for training while the remaining 20% ratings for testing.

Also, we compare our proposal with related works, for example, WSRec [25], MCCP [26], and SBT-SR [27], in terms of recommendation accuracy and recall. Concretely, accuracy and recall are measured by Mean Absolute Error (i.e., MAE; the smaller the better) in (13) and Recall (the larger the better) in (14). In (13), denotes the recommended service set for target user; denotes the size of set ; and represent target user’s real and predicted ratings over service , respectively. While in (14), symbols and denote the service set really preferred (with or rating) by target user and the service set recommended to target user, respectively.

The experiments were conducted on a Dell laptop with 2.80 GHz processors and 2.0 GB RAM. The software configuration is Windows XP + JAVA 1.5. Each experiment was carried out 10 times and the average results were adopted finally.

4.2. Experiment Results and Analyses

Concretely, four profiles are designed, tested, and compared. Here, and denote the number of users and number of services in the historical user-service invocation network.

(Profile 1) Recommendation Accuracy Comparison. In this profile, we compare the recommendation accuracy of with the other three approaches, that is, WSRec, MCCP, and SBT-SR. Concretely, parameters hold in WSRec; holds in MCCP; user similarity threshold holds in both SBT-SR and . Besides, in , holds in (3) and holds (in WS-DREAM, a service was invoked by a user 64 times within successive 16 hours; therefore, we assume that the service load and version do not vary much). Finally, is varied from 20 to 100 in all the four approaches.

The experiment result is presented in Figure 4. As Figure 4 shows, the recommendation accuracy of WSRec is low, as it only adopts the average ratings of target user and target services without considering the valuable user-service relationships hidden in historical service invocation records. The accuracy of MCCP is improved by considering the user-service relationships; however, it is not very suitable for service recommendation when target user has no similar friends and similar services, as MCCP is essentially a kind of similar user-based service recommendation approach. The recommendation accuracy of SBT-SR is high as “enemy’s enemy is a friend” rule of Social Balance Theory is recruited to find the “indirect friends” of target user. Furthermore, our proposed outperforms SBT-SR as not only considers Social Balance Theory, but also takes time factor into consideration for looking for the really similar “indirect friends” of target user. Besides, as shown in Figure 4, recommendation accuracy values of MCCP, SBT-SR, and all increase with the growth of approximately; this is because more valuable user-service relationship information would be discovered and recruited for service recommendation when there are many users as well as their invocation records.

Figure 4: Recommendation accuracy comparison with respect to .

(Profile 2) Recommendation Recall Comparison. In this profile, we compare the recommendation recall values of four approaches. The parameter settings are the same as those in profile 1. Concrete experiment results are shown in Figure 5.

Figure 5: Recommendation recall comparison with respect to .

As Figure 5 shows, the recall of WSRec is low as the “average” idea adopted in WSRec often leads to a low recommendation hit rate. The recommendation recall values of the remaining three approaches all increase with the growth of ; this is because when there are many available historical users, more useful user-service relationships could be mined and recruited in service recommendation; hence, more qualified recommendation results are returned finally. However, the recall of MCCP is still not high as few really similar friends of target user could be found in the recommendation situations that we discuss in this paper (i.e., the sparse recommendation situations when target user has no similar friends and similar services).

While both SBT-SR and approaches achieve good performances in recommendation recall, as Social Balance Theory is recruited to find out the indirect friends of target user even if the target user has no similar friends and similar services. Furthermore, our proposed approach often outperforms SBT-SR in recall. This is because only “enemy’s enemy is a friend” rule of Social Balance Theory is recruited in SBT-SR, while in , all four rules in Figure 2 are considered, which improves the recommendation hit rate to some extent.

(Profile 3) Execution Efficiency Comparison with respect to . In this profile, we test the execution efficiency of four approaches with respect to the number of users, i.e., . Here, is varied from 20 to 100; the number of services, that is, , holds; besides, , , and hold. The experiment result is shown in Figure 6.

Figure 6: Time cost comparison with respect to .

As Figure 6 shows, time cost of WSRec is the best, as WSRec only adopts the average ratings of target user and target services, without complex computation. The time costs of the remaining three approaches all increase with the growth of quickly, as more similarity computation cost is required to determine the similar friends or dissimilar enemies of a user when the number of users increases. Furthermore, often requires more computation time as multiple iteration processes are probable for finding all the indirect friends of target user. However, as Figure 6 indicates, the execution efficiency of is often acceptable (at “minute” level).

(Profile 4) Execution Efficiency Comparison with respect to . In this profile, we test the execution efficiency of four approaches with respect to the number of services, that is, . Here, is varied from 200 to 1000; the number of users, that is, , holds; besides, , , and hold. The concrete experiment result is shown in Figure 7.

Figure 7: Time cost comparison with respect to .

As Figure 7 shows, similar to profile 3, the time cost of WSRec is the best due to the adopted average idea. Besides, the time costs of the remaining three approaches all increase with the growth of approximately linearly, as each service is considered at most once in each user similarity calculation process. However, as can be seen from Figure 7, the service recommendation process of approach could be generally finished in polynomial time.

5. Evaluations

In this section, we first analyze the time complexity of our proposed approach. Afterwards, related works and comparison analyses are presented to further clarify the advantages and application scope of our proposal. Finally, we point out our future research directions.

5.1. Complexity Analyses

Suppose there are users and services in the historical user-service invocation network.

Step 1. According to (1)–(6), the time-aware similarity between target user and any other user could be calculated, whose time complexity is . Afterwards, a user is judged to be an qualified enemy of target user or not based on (7), whose time complexity is . As there are totally users in set , the time complexity of this step is .

Step 2. In this step, we utilize the four rules (see Figure 3) in Social Balance Theory iteratively, so as to find all the indirect friends of target user. And, in the worst case, the similarity between any two users in set needs to be calculated. As there are users in set , the time complexity of this step is .

Step 3. For each derived indirect friend (at most indirect friends) of target user, we select his/her preferred services (at most services) and recommend them to the target user. As the time complexity of preferred-service-judgment process is , the time complexity of this step is .

With the above analyses, we can conclude that the total time complexity of our proposed approach is .

5.2. Related Works and Comparison Analyses

With the advent of IoE age, an excessive number of IoE services are emerging on the web, which places a heavy burden on the service selection decision of target users. In this situation, various recommendation techniques, for example, CF-based recommendation [28] and content-based recommendation [29], are put forward to help the target users find their interested IoE services.

A two-phase -means clustering approach is brought forth in [30] to make service quality prediction and service recommendation. However, this clustering-based approach often requires a dense historical user-service invocation matrix, and hence cannot deal with the service recommendation problem on sparse data very well. In [31], a CF-based recommendation approach is put forward, which realizes service recommendation based on the similar friends of target user. However, when the target user has no similar friends, the recommendation accuracy is decreased significantly. A bidirectional (i.e., user-based CF + item-based CF) service recommendation approach named WSRec is brought forth in [25], for high-quality recommendation results. However, when a target user has no similar friends and similar services, WSRec can only make a rough prediction and recommendation, by considering both the average rating from target user and the average rating of the service that is ready to be predicted. In [26], a MCCP approach is put forward to capture and model the preferences of various users over different services; however, only similar friends of target user are recruited for service quality prediction and recommendation, which drops some valuable user-service relationship information hidden in the historical user-service invocation records.

In order to mine and introduce more user-service relationship information into recommendation, a service recommendation approach SBT-SR is proposed in our previous work [27]. By utilizing “enemy’s enemy is a friend” rule in Social Balance Theory, some indirect friends of target user could be found and utilized for further recommendation, which improves the accuracy and recall of recommendation in sparse-data environment. However, SBT-SR has two shortcomings: first, service invocation time is not considered in SBT-SR, which may decrease the recommendation accuracy as service quality is often dynamic and varied with time; second, SBT-SR only employs “enemy’s enemy is a friend” rule for service recommendation, while overlooks other valuable rules in Social Balance Theory, for example, “friend’s friend is a friend” rule, “friend’s enemy is an enemy” rule, and “enemy’s friend is an enemy” rule. In view of the above two shortcomings, a novel time-aware service recommendation approach named is put forward in this paper, to deal with the recommendation problem in sparse-data environment. considers not only the service invocation time but also the four rules of Social Balance Theory, so that the recommendation accuracy and recall could be ensured. Finally, through a set of experiments deployed on a real web service quality dataset WS-DREAM, we validate the feasibility of in terms of recommendation accuracy, recall, and efficiency.

5.3. Further Discussions

In this paper, we put forward a time-aware similarity for service recommendation. Generally, the proposed time-aware similarity could also be applied in other similarity-based application domains, such as content searching [32–36], information detection [37–45], and quality optimization [46–50]. However, there are still several shortcomings in our paper, which are discussed as follows:

(1)The time cost of our proposed approach increases fast when the number of users grows. Therefore, the execution efficiency of needs to be improved, especially when a huge number of users are present in the historical user-service invocation records.(2)In this paper, we have investigated the time-aware user similarity. However, besides service invocation time, many other factors, for example, user-service location information, also play an important role in user similarity calculation. In the future, we will improve our proposal by combining the time and location factors together.

6. Conclusions

In this paper, a novel time-aware service recommendation approach, that is, , is put forward, to handle the service recommendation problems in sparse-data environment where target user has no similar friends and similar services. Instead of looking for similar friends in traditional CF-based service recommendation approaches, in , we first look for dissimilar enemies of target user based on time-aware user similarity and further determine the indirect friends of target user based on Social Balance Theory. Afterwards, the services preferred by indirect friends of target user are recommended to the target user. Finally, through a set of experiments deployed on a real web service quality dataset WS-DREAM, we validate the feasibility of our proposal in terms of recommendation accuracy, recall, and efficiency.

In the future, we will improve the recommendation effect of our proposal by considering more user-service location information. Moreover, distributed or parallel recommendation approaches will be investigated in the future to improve the recommendation efficiency.

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This paper is partially supported by Natural Science Foundation of China (no. 61402258, no. 61602253, no. 61672276, no. 61373027, and no. 61672321) and Open Project of State Key Laboratory for Novel Software Technology (no. KFKT2016B22).

References

Y. Duan, G. Fu, N. Zhou, X. Sun, N. C. Narendra, and B. Hu, “Everything as a service (XaaS) on the cloud: origins, current and future trends,” in Proceedings of the 8th International Conference on Cloud Computing (Cloud '15), pp. 621–628, New York, NY, USA, July 2015.

Y. Ren, J. Shen, J. Wang, J. Han, and S. Lee, “Mutual verifiable provable data auditing in public cloud storage,” Journal of Internet Technology, vol. 16, no. 2, pp. 317–323, 2015.

J. Shen, H. Tan, J. Wang, J. Wang, and S. Lee, “A novel routing protocol providing good transmission reliability in underwater sensor networks,” Journal of Internet Technology, vol. 16, no. 1, pp. 171–178, 2015.

C. Yuan, X. Sun, and L. V. Rui, “Fingerprint liveness detection based on multi-scale LPQ and PCA,” China Communications, vol. 13, no. 7, pp. 60–65, 2016.

X. Wen, L. Shao, Y. Xue, and W. Fang, “A rapid learning algorithm for vehicle classification,” Information Sciences, vol. 295, no. 1, pp. 395–406, 2015.

Z. Xia, X. Wang, X. Sun, and Q. Wang, “A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 2, pp. 340–352, 2016.

Z. Fu, X. Sun, Q. Liu, L. Zhou, and J. Shu, “Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing,” IEICE Transactions on Communications, vol. 98, no. 1, pp. 190–200, 2015.

Z. Xia, X. Wang, L. Zhang, Z. Qin, X. Sun, and K. Ren, “A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 11, pp. 2594–2608, 2016.

Z. Pan, Y. Zhang, and S. Kwong, “Efficient motion and disparity estimation optimization for low complexity multiview video coding,” IEEE Transactions on Broadcasting, vol. 61, no. 2, pp. 166–176, 2015.

S. Xie and Y. Wang, “Construction of tree network with limited delivery latency in homogeneous wireless sensor networks,” Wireless Personal Communications, vol. 78, no. 1, pp. 231–246, 2014.

Z. Zhou, Y. Wang, J. Wu, C. N. Yang, and X. Sun, “Effective and efficient global context verification for image copy detection,” IEEE Transactions on Information Forensics and Security, vol. 12, no. 1, pp. 48–63, 2016.

L. Qi, X. Xu, X. Zhang et al., “Structural Balance Theory-based E-commerce recommendation over big rating data,” IEEE Transactions on Big Data, 2016.

T. Ma, J. Zhou, M. Tang et al., “Social network and tag sources based augmenting collaborative recommender system,” IEICE Transactions on Information and Systems, vol. 98, no. 4, pp. 902–910, 2015.

L. Qi, W. Dou, C. Hu, Y. Zhou, and J. Yu, “A context-aware service evaluation approach over big data for cloud applications,” IEEE Transactions on Cloud Computing.

X. Fan, Y. Hu, R. Zhang, W. Chen, and P. Brézillon, “Modeling temporal effectiveness for context-aware web services recommendation,” in Proceedings of the IEEE International Conference on Web Services (ICWS '15), pp. 225–232, New York, NY, USA, June 2015.

S. Wang, L. Huang, C.-H. Hsu, and F. Yang, “Collaboration reputation for trustworthy Web service selection in social networks,” Journal of Computer and System Sciences, vol. 82, no. 1, pp. 130–143, 2016.

S. Wang, Y. Ma, B. Cheng, F. Yang, and R. Chang, “Multi-dimensional QoS prediction for service recommendations,” IEEE Transaction on Services Computing, 2016.

Y. Ma, S. Wang, P. C. Hung, C. H. Hsu, Q. Sun, and F. Yang, “A highly accurate prediction algorithm for unknown web service QoS value,” IEEE Transactions on Services Computing, vol. 9, no. 4, pp. 511–523, 2016.

S. Wang, L. Huang, L. Sun, C.-H. Hsu, and F. Yang, “Efficient and reliable service selection for heterogeneous distributed software systems,” Future Generation Computer Systems, 2016.

Y. Ni, Y. Fan, W. Tan, K. Huang, and J. Bi, “NCSR: negative-connection-aware service recommendation for large sparse service network,” IEEE Transactions on Automation Science and Engineering, vol. 13, no. 2, pp. 579–590, 2016.

Y. Zhong, Y. Fan, K. Huang, W. Tan, and J. Zhang, “Time-aware service recommendation for mashup creation,” IEEE Transactions on Services Computing, vol. 8, no. 3, pp. 356–368, 2015.

D. Cartwright and F. Harary, “Structural balance: a generalization of Heider's theory,” Psychological Review, vol. 63, no. 5, pp. 277–293, 1956.

Z. Zheng, Y. Zhang, and M. R. Lyu, “Investigating QoS of real-world web services,” IEEE Transactions on Services Computing, vol. 7, no. 1, pp. 32–39, 2014.

B. Sarwar, G. Karypis, J. Konstan, and J. Reidl, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the the 10th International Conference on World Wide Web, pp. 285–295, ACM, Hong Kong, May 2001.

Z. Zheng, H. Ma, M. R. Lyu, and I. King, “QoS-aware web service recommendation by collaborative filtering,” IEEE Transactions on Services Computing, vol. 4, no. 2, pp. 140–152, 2011.

Y. Rong, X. Wen, and H. Cheng, “A Monte Carlo algorithm for cold start recommendation,” in Proceedings of the 23rd International Conference on World Wide Web (WWW '14), pp. 327–336, ACM, Seoul, South Korea, April 2014.

L. Qi, X. Zhang, Y. Wen, and Y. Zhou, “A Social Balance Theory-based service recommendation approach,” in Advances in Services Computing: 9th Asia-Pacific Services Computing Conference, APSCC 2015, Bangkok, Thailand, December 7–9, 2015, Proceedings, vol. 9464 of Lecture Notes in Computer Science, pp. 48–60, Springer, Berlin, Germany, 2015.

F. Zhang, T. Gong, V. E. Lee, G. Zhao, C. Rong, and G. Qu, “Fast algorithms to evaluate collaborative filtering recommender systems,” Knowledge-Based Systems, vol. 96, pp. 96–103, 2016.

L. Yao, Q. Z. Sheng, A. H. H. Ngu, J. Yu, and A. Segev, “Unified collaborative and content-based web service recommendation,” IEEE Transactions on Services Computing, vol. 8, no. 3, pp. 453–466, 2015.

C. Wu, W. Qiu, Z. Zheng, X. Wang, and X. Yang, “QoS prediction of web services based on two-phase K-means clustering,” in Proceedings of the IEEE International Conference on Web Services (ICWS '15), pp. 161–168, IEEE, New York, NY, USA, July 2015.

S.-Y. Lin, C.-H. Lai, C.-H. Wu, and C.-C. Lo, “A trustworthy QoS-based collaborative filtering approach for web service discovery,” Journal of Systems and Software, vol. 93, pp. 217–228, 2014.

Z. Fu, X. Wu, C. Guan, X. Sun, and K. Ren, “Towards efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 12, pp. 2706–2716, 2016.

Z. Fu, K. Ren, J. Shu, X. Sun, and F. Huang, “Enabling personalized search over encrypted outsourced data with efficiency improvement,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 9, pp. 2546–2559, 2016.

Z. Pan, P. Jin, J. Lei, Y. Zhang, X. Sun, and S. Kwong, “Fast reference frame selection based on content similarity for low complexity HEVC encoder,” Journal of Visual Communication and Image Representation, vol. 40, pp. 516–524, 2016.

Z. Fu, F. Huang, X. Sun, A. V. Vasilakos, and C. Yang, “Enabling semantic search based on conceptual graphs over encrypted outsourced data,” IEEE Transactions on Services Computing, 2016.

Z. Fu, X. Sun, S. Ji, and G. Xie, “Towards efficient content-aware search over encrypted outsourced data in cloud,” in Proceedings of the 35th Annual IEEE International Conference on Computer Communications (INFOCOM '16), pp. 1–9, San Francisco, Calif, USA, April 2016.

Z. Xia, X. Wang, X. Sun, and B. Wang, “Steganalysis of least significant bit matching using multi-order differences,” Security and Communication Networks, vol. 7, no. 8, pp. 1283–1291, 2014.

J. Li, X. Li, B. Yang, and X. Sun, “Segmentation-based image copy-move forgery detection scheme,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 3, pp. 507–518, 2015.

Z. Pan, J. Lei, Y. Zhang, X. Sun, and S. Kwong, “Fast motion estimation based on content property for low-complexity H.265/HEVC encoder,” IEEE Transactions on Broadcasting, vol. 62, no. 3, pp. 675–684, 2016.

Y. Zheng, B. Jeon, D. Xu, Q. M. J. Wu, and H. Zhang, “Image segmentation by generalized hierarchical fuzzy C-means algorithm,” Journal of Intelligent and Fuzzy Systems, vol. 28, no. 2, pp. 961–973, 2015.

B. Chen, H. Shu, G. Coatrieux, G. Chen, X. Sun, and J. L. Coatrieux, “Color image analysis by quaternion-type moments,” Journal of Mathematical Imaging and Vision, vol. 51, no. 1, pp. 124–144, 2015.

Z. Xia, X. Wang, X. Sun, Q. Liu, and N. Xiong, “Steganalysis of LSB matching using differences between nonadjacent pixels,” Multimedia Tools and Applications, vol. 75, no. 4, pp. 1947–1962, 2016.

Y. Zhang, X. Sun, and B. Wang, “Efficient algorithm for k-barrier coverage based on integer linear programming,” China Communications, vol. 13, no. 7, pp. 16–23, 2016.

J. Wang, T. Li, Y. Shi, S. Lian, and J. Ye, “Forensics feature analysis in quaternion wavelet domain for distinguishing photographic images and computer graphics,” Multimedia Tools and Applications, 2016.

Z. Zhou, C. Yang, B. Chen, X. Sun, Q. Liu, and Q. J. Wu, “Effective and efficient image copy detection with resistance to arbitrary rotation,” IEICE Transactions on Information and Systems D, vol. 99, no. 6, pp. 1531–1540, 2016.

L. Qi, W. Dou, and J. Chen, “Weighted principal component analysis-based service selection method for multimedia services in cloud,” Computing, vol. 98, no. 1-2, pp. 195–214, 2016.

Y. Chen, C. Hao, W. Wu, and E. Wu, “Robust dense reconstruction by range merging based on confidence estimation,” Science China Information Sciences, vol. 59, no. 9, Article ID 092103, 11 pages, 2016.

Q. Liu, W. Cai, J. Shen, Z. Fu, X. Liu, and N. Linge, “A speculative approach to spatial‐temporal efficiency with multi‐objective optimization in a heterogeneous cloud environment,” Security and Communication Networks, vol. 9, no. 17, pp. 4002–4012, 2016.

Y. Kong, M. Zhang, and D. Ye, “A belief propagation-based method for task allocation in open and dynamic cloud environments,” Knowledge-Based Systems, vol. 115, pp. 123–132, 2017.

B. Gu, V. S. Sheng, and S. Li, “Bi-parameter space partition for cost-sensitive SVM,” in Proceedings of the 24th International Conference on Artificial Intelligence (ICAI '15), pp. 3532–3539, Las Vegas, Nev, USA, July 2015.