# Field Information Recommendation Based on Context-Aware and Collaborative Filtering Algorithm

Zhili Chen, Chunjiang Zhao, Huarui Wu

► To cite this version:

Zhili Chen, Chunjiang Zhao, Huarui Wu. Field Information Recommendation Based on Context-Aware and Collaborative Filtering Algorithm. 11th International Conference on Computer and Computing Technologies in Agriculture (CCTA), Aug 2017, Jilin, China. pp.486-498, 10.1007/978-3-030-06137-1_45. hal-02124265

HAL Id: hal-02124265

https://inria.hal.science/hal-02124265

Submitted on 9 May 2019

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>
Field Information Recommendation based on

Context-aware and Collaborative Filtering Algorithm

Zhili Chen<sup>1,2</sup>, Chunjiang Zhao<sup>2,3 (✉)</sup>, Huarui Wu<sup>2,3</sup>

<sup>1</sup>College of Information and Electrical Engineering, China Agricultural University, Beijing,
100083, China

chenzhili@nercita.org.cn

<sup>2</sup>National Engineering Research Center for Information Technology in Agriculture, Beijing,
100097, China

<sup>3</sup>Beijing Research Center for Information Technology in Agriculture, Beijing Academy of
Agriculture and Forestry Sciences, Beijing, 100097, China

zhaocj@nercita.org.cn

wuhuarui1975@163.com

**Abstract.** Personalized recommendation technology is a valid way to solve the problem of "information overload". In the face the complexity of agricultural field information and problems of farmers' preference prediction accuracy which is not high, this paper proposes a kind of recommendation algorithm based on context-aware and collaborative filtering(CACF). The algorithm constructs the "user-item-context" 3D user interest model which contains the context information. Through calculating context similarity and adopting pre-filtering paradigm, the 3D model is reduced to "user-item"2D model. By computing item similarity, it can predict the item rating and generate recommendations. The CACF was applied on the field information recommendation. The experimental results show that the CACF can accomplish higher recommendation precision and efficiency compared with the traditional User-based collaborative filtering algorithm(UBCF), Slope one algorithm(SLOA).

**Keywords:** Context-aware · Collaborative filtering · Similarity calculation · Personalized recommendation · Field information

# 1 Introduction

As Internet and Internet of things technology have been developing rapidly, agriculture has entered the era of "big data". Because agricultural data comes from a variety of sources, updates more quickly and has complicated structure, with every technological progress in agriculture, it is necessary to research big data of agriculture [1,2]. In the face of huge amount of agricultural information resources, there are some problems such as "resource obscurity" and "information overload". Internet of things
technology has made access to agricultural context data more conveniently and accurately. It can dig user preference information in the light of context data, it is able to offer personalized information recommendation services for farmers.

Traditional recommendation systems mainly research "user-item" 2D model, by constructing the user interest model and combining with appropriate recommendation algorithm, they take the initiative to push items which users are interested in to users [3]. In agricultural areas, however, due to the complexity of agricultural variety and timeliness of information demand, if it joins the contextual information to recommend, it will have a better effect of information for farmers. The current recommendation systems are mostly based on user browsing behavior which can be recommended to users by digging up the content of the log, but they hardly take into account the context and characteristics of the users [4]. The proposed algorithm is combined with the farmer's production contextual information, such as planting varieties, season, climate, soil, water quality, location and so on. By constructing context-aware user interest model and combined with Slope one algorithm to predict preference of the items, it was carried out on the field information recommendation. Finally, the recommendation results of improved algorithm have been tested and evaluated.

# 2 Related Work

From the point of view of the recommendation models, the recommendation systems are mainly divided into the following categories: Content-Based(CB) [5,6,7], Collaborative Filtering(CF) [8,9,10], Hybrid recommendation [11,12], etc. These algorithms use data mining and optimization algorithms to mine the nearest neighbors or items, and then predict user's preference to recommend.

## 2.1 User-Based Collaborative Filtering Algorithm

The process of user-based collaborative filtering recommendation algorithm includes:
(1) searching for similar users;(2) calculating user's prediction rating for unevaluated items;(3) recommending items to target users that are highly rated and not evaluated by target user [13]. The algorithms which are used to calculate similarity between users mainly include cosine similarity, modified cosine similarity and Pearson similarity. Because different users have different evaluation criteria and grading habits for the same content, the similarity between users is calculated by using the modified cosine similarity as Eq.1 [14].

$$ \text{sim}(a,b) = \frac{\sum_{c \in U_{ab}} (U_{a,c} - \bar{U}_a)(U_{b,c} - \bar{U}_b)}{\sqrt{\sum_{c \in U_{ab}} (U_{a,c} - \bar{U}_a)^2 \sum_{c \in U_{ab}} (U_{b,c} - \bar{U}_b)^2}} \quad (1) $$

$U_{a,c}$ is the rating of user a for item c. $U_{b,c}$ is the rating of user b for item c. $\bar{U}_a$ and $\bar{U}_b$ are the average value of user a and user b for all item rating respectively.
After calculating the similarity of users, it should calculate the prediction ratings of other items. The nearest neighbor set of the target user *u* is *NN*<sub>*u*</sub>, and the prediction rating of user *u* for the recommended item *i* can be obtained by the user's rating of the item in the nearest neighbor set *NN*<sub>*u*</sub> as Eq.2.

$$S_{u,i} = \bar{U}_u + \frac{\sum_{m \in NN_u} \mathrm{sim}(u, m)(U_{m,i} - \bar{U}_m)}{\sum_{m \in NN_u} |\mathrm{sim}(u, m)|} \quad (2)$$

$\mathrm{sim}(u,m)$ represents similarity of the target user *u* and *m* that is its nearest neighbor set *NN*<sub>*u*</sub>.

## 2.2 Item-Based Collaborative Filtering Algorithm

The item-based collaborative filtering algorithm mainly includes: (1) using the existing user item rating record to calculate the similarity between items;(2) finding the nearest neighbor set of the target item according to the size of the similarity;(3) predicting the target item's rating by using the target user's rating of the nearest neighbor set item, and recommending the item to the user with a high forecast rating [15,16,17]. In order to alleviate data sparseness and scalability problem of the user-based collaborative filtering recommendation algorithm, it chooses to use Slope one algorithm [18]. Firstly, it calculates the item similarity as Eq.3, and then calculates predicting rating of the items as Eq.4. $f(x) = x+b$ is used to predict rating and it has higher accuracy and efficiency [19].

$$\mathrm{dev}_{x,y} = \sum_{u \in U(x) \cap U(y)} \frac{s_{u,x} - s_{u,y}}{|U(x) \cap U(y)|} \quad (3)$$

$$Q_{u,x} = \bar{s}_u + \sum_{y \in S_u} \frac{\mathrm{dev}_{x,y}}{|S_u|} \quad (4)$$

In Eq.3, $|U(x) \cap U(y)|$ is the amount of users who generate ratings of item *x* and item *y* at the same time. In Eq.4, $S_u$ is the rating of all known the items for user *u* except for item *x*.

## 2.3 Context-aware Recommendation

Context-aware recommendation system is a recommendation system which contains context information. The contextual information is introduced into the traditional "user-item"2D model, and then it will make its extension to be a multidimensional utility model R including contextual information: User×Item×Context→Rating [20,21], in which the user, item and the context of structural description is as Eq.5.

$$\begin{align*} \text{User} &\subseteq \text{UId} \times \text{UPreferences} \times \text{UAddress} \times \text{UJob}; \\ \text{Item} &\subseteq \text{IName} \times \text{IType} \times \text{IContent}; \\ \text{Context} &\subseteq \text{Location} \times \text{Time} \times \text{Environment} \times \text{Activity}. \end{align*} \quad (5)$$
Based on the location of context information used in the recommendation process, Context-aware recommendation is divided into: pre-filtering, contextual modelling, and post-filtering.

Pre-filtering refers to making use of contextual information preprocessing for the recommended data sets, filtering out the user rating data which is not associated with the current user context, then using traditional recommendation technology to predict the user preferences, and then producing recommendations. This paradigm transforms the multi-dimensional recommendation problem into a solution to the traditional two-dimensional recommendation problem. Baltrunas L presented the improved pre-filtering method based on contextual user clustering, and analyzed and verified the real data of e-commerce, online travel, mobile advertising and other fields [22]. Van Setten M presented a contextual pre-filtering recommendation system based on knowledge rules [23]. Liu D put forward a service recommended architecture that combined Context-aware and ontology. Above all, it was access to service data sets related to the current context of users, and then calculated the similarity of users fusing contextual information, eventually generated the personalized recommendation services for users based on the current context [24].

# 3 Context-aware and Collaborative Filtering Algorithm

By acquiring information about climate, soil, light, location, time and so on, this algorithm constructs the "user-item-context" 3D model. Through context-aware, it can mine the users' behavior, preferences, habits, knowledge level, interest characteristics and so on, then it fuses information into the user interest model, and further uses recommendation algorithm based on the traditional two-dimensional model. In this way, it establishes an initial user interest model based on the context information and solves the cold startup problem of the recommendation algorithm.

## 3.1 Context-aware User Interest Model

User interest preferences vary with contextual information (such as location, time, environment, etc.), so it should consider contextual information during the recommendation process.

*Location.* According to the distribution of national planting industry, it can be divided into east China, south China, central China, north China, northwest, northwest, northeast and so on, and it can also be divided according to the provinces and counties planned by the administrative region of China. The current location of the user is obtained using the IP address or mobile phone. The formula is Eq.6.

$$IR_{location} = l(u_i, m_i) = \sqrt{\frac{\exp(-\frac{(x_{i,0}^2 + y_{i,0}^2)}{2} - \exp(-\frac{(x_{j,I}^2 + y_{j,I}^2)}{2}))}{\exp(-\frac{(x_{i,0}^2 + y_{i,0}^2)}{2} + \exp(-\frac{(x_{j,I}^2 + y_{j,I}^2)}{2}))}} \quad (6)$$

Every region of China's agriculture has its own characteristics such as the main agricultural production object, the agricultural production cycle, the development of
the vulnerable disaster. When a user is in the corresponding region, he will contribute to the main crops which he is interested in, and he will product behaviors of sowing, harvesting based on the laws of the local agricultural production cycle.

*Time.* Agricultural production has obvious seasonal and cyclical characteristics, and the demand diversification of users in agriculture will change over time. The three ways of dividing the time are month, season and crop growth period. It makes the change of the user's interests based on the differences of different crop growth period. If the current season is in April, southern corn growers will tend to be more understanding of spring maize planting technology. The adaptive exponential attenuation function to process the time information is as Eq.7.

$$IR_{\text{time}} = t(u_i, t, l_i, c, p) = \exp\left|-\ln2 * \frac{\text{time}(u, p)}{hl_u}\right| \quad (7)$$
$$\text{time}(u, p) \ge 0, \quad \text{time}(u, p) \in \mathbb{N}$$

Among them, $t(u_i, t, l_i, c, p)$ is the value of time weight which is used to calculate the attenuation degree of user interest. The $u_i$ is the user. The $t$ is the current time of the system. The $l_i$ is the location of the user. The $c$ is the crop type in the user's label, and the $p$ is the page of the user browsing. When $time(u, p)=0$, it is the last browsing time of the page $p$. When $time(u, p)=1$, it is the penult time to browse. The $hl_u$ is the half-life of user $u$, and its value is related to the growth cycle of the crop. At the beginning of the growth cycle, the interest degree of the user will be high, and the interest degree will decrease with time.

*Environment.* Agricultural field environment context includes temperature, humidity, illumination, precipitation, wind speed, wind direction, air pressure, soil temperature, soil moisture, NPK, water level, dissolved oxygen, PH, and etc. All information can be obtained by IoT sensor. These contextual information can guide the agricultural production activities on cultivation, fertilization, irrigation, improvement, and it also can help farmers find problems in time, improve the agricultural production, and avoid or reduce the influence of all kinds of meteorological disasters. The environment context can be signified by Eq.8.

$$\text{EnvironContext} = \{\text{temperature}, \text{humidity}, \text{illumination}, \text{rainfall}\} \quad (8)$$

In the application of specific examples, that setting up an environment context model can select several important factors to adjust the dimension properly.

## 3.2 Context-aware Collaborative Filtering Algorithm

**Algorithm Thought.** The algorithm adopts the pre-filtering recommended paradigm, and the first is obtained approximate context set by computing context similarity with target user current context, and then "user-item-context" 3D model is reduced to "user-item" 2D model, and finally by computing item similarity, it can predict the ratings of items and generate recommendations using slope one algorithm. The algorithm frame is represented in figure 1.
<figure><img src="image_2.png" /><figcaption>fig.1. Context-aware algorithm frame</figcaption></figure>

**Context similarity calculation.** Context similarity computing includes location similarity, time similarity, and environment similarity.

*Location similarity.* By obtaining the user's location, the database determines whether the users belong to the same planting area. If they belong to the same area, they are supposed to be similar. To define a growing area as E, the calculation formula of the location similarity of target user a and the other user b is as Eq.9.

$$ \text{simL}(a,b) = \begin{cases} 1, & a,b \in E \\ 0, & a,b \notin E \end{cases} \qquad (9) $$

*Time similarity.* Through calculating time difference between currently using system time of target user and using system of other users last time, if the difference is
smaller, the time similarity is bigger, on the contrary it is smaller. Solar terms play an important role in farming guide, so it divides by a solar term for a period in China. It defines that t is the time difference for users to use the system, the unit for the day. The time similarity computation formula of the target user a with another user b is as Eq.10.

$$simT(a,b) = \begin{cases} 1, & t \in [0,15] \\ 0.8, & t \in (15,30] \\ 0.6, & t \in (30,45] \\ 0.4, & t \in (45,60] \\ 0.2, & t \in (60,75] \\ 0, & t \in (75, \infty) \end{cases} \qquad (10)$$

**Environment similarity.** Environmental context involving factors index is more complicated, and the environment such as climate, topography, soil information has distinct regional characteristics, so each area should plant reasonably on the grounds of their own conditions for precipitation, temperature and humidity conditions, soil conditions. Therefore, the environment similarity can be computed based on the location similarity by Eq.11.

$$simE(a,b) = \begin{cases} 1, & a,b \in E \\ 0, & a,b \notin E \end{cases} \qquad (11)$$

**Comprehensive Context Similarity.** The above three similarity is acquired. The comprehensive context similarity formula of the users is calculated by Eq.12.

$$sim(a,b) = \alpha simL(a,b) + \beta simT(a,b) + (1 - \alpha - \beta) simE(a,b) \qquad (12)$$

Weighting factor $0 < \alpha, \beta < 1$, $\alpha$ indicates the weight of the user's location similarity, and $\beta$ indicates the weight of the user's time similarity of the system, and $1-\alpha-\beta$ indicates the right value of the environment similarity. By setting different values, the three kinds of similarity can be fused to improve the recommended quality.

**Algorithm Process Description.** The algorithm process is described below.

Input: "user-item-context" 3D model $C_n$; Target user $u$; User rating data $S$; Current context information $C$; Collection $I(R)$ of the recommended items.

Output: user $u$ in the current context $C$ has the most preferred Top-N item set $I(N)$.

Algorithm process:
1. I(N)=null //initialize
2. struct (item-context) matrix
3. foreach Ci do
4. si=sim(Ci,C) //calculate comprehensive context similarity
5. find Cj which has higher similarity//construct an //approximate set
6. if(Sci!=Scj) to the same item
   if(si>sj) S=Sci;
   else S=Scj;//Reduce dimension to ensure the uniqueness //of rating
7. foreach Ii do
8. p=sim(Ii,Ij) //calculate item similarity
9. Q=Eq.4 //calculate predicting rating of items
10. I(N)-I(R) items which have top N ratings
11.return I(N)

Initialization algorithm process is as follows: first of all, items recommended list is empty (line 1). Then it takes out all of the rating data of the target user *u*, and it constructs "item-context" 2D rating matrix as shown in table 1 (line 2). Based on the current context information *C* and context model *C*<sub>*n*</sub>, it calculates comprehensive context similarity using the Eq.9-Eq.12 and structures approximate context set *F*(*C*) of the current context (line 3-5). The 3D model is lessened to "user-item"2D model. If a user has different ratings on the same item in different contexts, it only saves the rating which has the largest rating with the current context similarity(line 6). According to Eq.3, the similarity calculation between items is obtained(line 7-8), and the similarity between items is shown in table 2. Using Eq.4 to predict the item's rating (line 9), the first N items collection *I*(*N*) which has the highest predicting rating is recommended to users (line 10-11).

<table><caption>**Table.1** item-context rating matrix</caption><thead><tr><th rowspan="2">Contexts</th><th colspan="5">Items</th></tr><tr><th>I1</th><th>I2</th><th>I3</th><th>...</th><th>In</th></tr></thead><tbody><tr><td>C1</td><td>R1,1</td><td>R1,2</td><td>R1,3</td><td>...</td><td>R1,n</td></tr><tr><td>C2</td><td>R2,1</td><td>R2,2</td><td>R2,3</td><td>...</td><td>R2,n</td></tr><tr><td>C3</td><td>R3,1</td><td>R3,2</td><td>R3,3</td><td>...</td><td>R3,n</td></tr><tr><td>...</td><td>...</td><td>...</td><td>...</td><td>...</td><td>...</td></tr><tr><td>Cm</td><td>Rm,1</td><td>Rm,2</td><td>Rm,3</td><td>...</td><td>Rm,n</td></tr></tbody></table>

<table><caption>**Table.2** Similarity between items</caption><thead><tr><th></th><th>I1</th><th>I2</th><th>I3</th><th>...</th><th>In</th></tr></thead><tbody><tr><td>I1</td><td>sim(I1,I1)</td><td>sim(I1,I2)</td><td>sim(I1,I3)</td><td>...</td><td>sim(I1,In)</td></tr><tr><td>I2</td><td>sim(I2,I1)</td><td>sim(I2,I2)</td><td>sim(I2,I3)</td><td>...</td><td>sim(I2,In)</td></tr></tbody></table>
<table><tr><td>I3</td><td>sim(I3,I1)</td><td>sim(I3,I2)</td><td>sim(I3,I3)</td><td>...</td><td>sim(I3,In)</td></tr><tr><td>...</td><td>...</td><td>...</td><td>...</td><td>...</td><td>...</td></tr><tr><td>In</td><td>sim(In,I1)</td><td>sim(In,I2)</td><td>sim(In,I3)</td><td>...</td><td>sim(In,In)</td></tr></table>

# 4 Experimentation and Results Analysis

In order to verify the validity of the CACF algorithm, it adopts the Java language, Eclipse2015 development tool and the MySQL5.7 database to develop a system prototype to verify.

## 4.1 Data Sets

The data set is to use the crawler technology from China's agricultural science and technology information website, China's rural website, China agricultural information website and other comprehensive websites crawling 2000 users data, including the user's location, the time of using the system, the environmental information, users' interest in crop varieties, the user browsing behavior and so on. It selects 80% of these as the training set, and the remaining 20% as the test set.

## 4.2 Evaluation Criteria

This paper adopts MAP (Mean Average Precision) and P@N as the measurement criteria. These two methods are commonly used to measure classification accuracy, which focus on the accuracy of the most relevant items, and pays more attention to the ordering relation of the recommended results, and it is also more consistent with the Top-N recommendation.

MAP is used to measure the accuracy of the average ranking of all related items. The larger the value of MAP, the higher the accuracy, on the contrary the lower the accuracy. MAP is calculated by Eq.13.

$$ MAP = \frac{1}{|U|} \sum_{i=1}^{|U|} \frac{1}{|C_i|} \sum_{g=1}^{|C_i|} \frac{1}{|R_{ig}|} \sum_{h=1}^{|R_{ig}|} \frac{h}{r_{igh}} \quad (13) $$

Among them, $|U|$ signifies the amount of elements in the user collection; $|C_i|$ shows the amount of contextual type; $|R_{ig}|$ expresses related numbers under context $c_g$ of $u_i$, $r_{igh}$ denotes the $h$ related item. If there is no context information included in the user preferences, $|C_i|=1$.

P@N is used to evaluate the relevance of the user's first N recommendation items. In the experiment, it defines $N = 15$ and defines $W$ as the number of related items for the top-N recommendation items as Eq.14.
$$P@15 = \frac{W_{15}}{15} \qquad (14)$$

## 4.3 Results and Discussion

This experiment firstly classifies the training set and test set according to the context information, and pre-filters the data through the calculation of the comprehensive context similarity, then it carries on the preference prediction and recommendation.

The results of this experiment are demonstrated in figure 2, figure 3 and figure 4. In figure 2, the number of item neighbors K is equal to 20,40,60,80,100, which compared the MAP values of different algorithms. As the number of item neighbors increased, the MAP values of different algorithms increased, and all these algorithms reached the maximum value at K = 60, but then the MAP value began to decrease with the increase of the amount of neighbors. In figure 3, the number of item neighbors K is equal to 20,40,60,80,100, and the P@15 value of different algorithms was compared. With the quantity of item neighbors increasing, the value of P@15 of different algorithms first rose and then fell, and all these algorithms reached the maximum value at K = 60. It is obvious that a suitable number of item neighbors can improve the recommendation accuracy. In figure 4, therefore, it took the number of nearest neighbor item K = 60, it can be seen that the CACF had the highest MAP value of 0.65, that is 25% and 12% respectively higher than the UBCF and SLOA; The P@15 value of the CACF is 0.51, which is 30% and 13% respectively higher than the UBCF and SLOA. To sum up, the CACF has the higher MAP value and higher P@15 accuracy values than the UBCF and SLOA. It is shown that it has a higher recommendation quality in the case of considering context information.

<figure><img src="image_3.png" /><figcaption>Fig. 2. The influence of the number of neighbors on MAP</figcaption></figure>
<figure><img src="image_4.png" /><figcaption>Fig. 3. The influence of the number of neighbors on P@15</figcaption></figure>

<figure><img src="image_5.png" /><figcaption>Fig. 4. The comparison of different algorithms on MAP and P @15</figcaption></figure>

**5 Conclusion**

Regarding to the problems of the complexity of agricultural field information and the
personalized needs of agricultural users, this research puts forward a kind of
recommendation algorithm which combined context-aware with the Item-based
collaborative filtering. Through acquiring agricultural context information such as
location, time, environment, calculating context similarity and adopting pre-filtering
method, the 3D model is reduced to "user-item"2D model, then it uses the classic
Slope one algorithm to predict preference to recommend field information.
Experiments show that the CACF algorithm has improved their effectiveness and has
higher recommendation quality compared with UBCF and SLOA. The next step will
be to refine the user contextual information to improve the recommendation quality
further.

**Acknowledgements.** This work was supported by Beijing Natural Science Foundation Key Program (4151001).
References

1. Wang W S, Guo L F: Agricultural big data and its application prospect. Jiangsu Agricultural Science (09), 1-5 (2015)

2. Zhang H R, Li Z L, Zou T F: A review of Agricultural big data. Computer Science (S2), 387-392 (2014)

3. Ilarri, S., Hermoso, R., Trillo-Lado, R., Del Carmen Rodriguez-Hernandez, M.: A Review of the Role of Sensors in Mobile Context-Aware Recommendation Systems. INT J DISTRIB SENSN (489264) (2015)

4. Unger, M., Bar, A., Shapira, B., Rokach, L.: Towards latent context-aware recommendation systems. KNOWL-BASED SYST, 104, 165-178 (2016)

5. Puglisi, S., Parra-Arnau, J., Forne, J., Rebollo-Monedero, D.: On content-based recommendation and user privacy in social-tagging systems. COMPUT STAND INTER, 41, 17-27 (2015)

6. Soares, M., Viana, P.: Tuning metadata for better movie content-based recommendation systems. MULTIMED TOOLS APPL, 74(17), 7015-7036 (2015)

7. Achakulvisut, T., Acuna, D.E., Ruangrong, T., Kording, K.: Science Concierge: A Fast Content-Based Recommendation System for Scientific Publications. PLOS ONE, 11(e01584237) (2016)

8. Yang, Z., Cai, Z.: Detecting abnormal profiles in collaborative filtering recommender systems. J INTELL INF SYST, 48(3), 499-518 (2017)

9. Da Silva, E.Q., Camilo-Junior, C.G., Pascoal, L.M.L., Rosa, T.C.: An evolutionary approach for combining results of recommender systems techniques based on collaborative filtering. EXPERT SYST APPL, 53, 204-218 (2016)

10. Yang, Z., Xu, L., Cai, Z., Xu, Z.: Re-scale AdaBoost for attack detection in collaborative filtering recommender systems. KNOWL-BASED SYST, 100, 74-88 (2016)

11. Son, L.H.: HU-FCF: A hybrid user-based fuzzy collaborative filtering method in Recommender Systems. EXPERT SYST APPL, 41(15), 6861-6870 (2014)

12. Liu, Q., Xiong, Y., Huang, W.: Combining User-Based and Item-Based Models for Collaborative Filtering Using Stacked Regression. CHINESE J ELECTRON, 23(4), 712-717 (2014)

13. Pirasteh, P., Hwang, D., Jung, J.E.: Weighted Similarity Schemes for High Scalability in User-Based Collaborative Filtering. MOBILE NETW APPL, 20(4), 497-507 (2015)

14. Hao, F., Blair, R.H.: A comparative study: classification vs. user-based collaborative filtering for clinical prediction. BMC MED RES METHODOL, 16(172) (2016)

15. Ma, W., Shi, J., Zhao, R.: Normalizing Item-Based Collaborative Filter Using Context-Aware Scaled Baseline Predictor. MATH PROBL ENG (6562371) (2017)

16. Du, Y., Yao, C., Huo, S., Liu, J.: A new item-based deep network structure using a restricted Boltzmann machine for collaborative filtering. FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 18(5), 658-666 (2017)

17. Li, C., He, K.: CBMR: An optimized MapReduce for item-based collaborative filtering recommendation algorithm with empirical analysis. CONCURR COMP-PRACT E, 29(e409210) (2017)
18. Zhang, J., Su, Z., Taber, D., Marsden, J., Moran, W., Mauldin, P., Srinivas, T.: Predictors of eGFR Slope at One Year in Kidney Transplants - A Big Data Approach. AM J TRANSPLANT, 163(SI), 314 (2016)

19. Linda, S., Bharadwaj, K.K.: A Fuzzy Trust Enhanced Collaborative Filtering for Effective Context-Aware Recommender Systems

20. Mettouris, C., Achilleos, A.P., Papadopoulos, G.A.: A Context Modelling System and Learning Tool for Context-Aware Recommender Systems

21. Cheng, Z., Shen, J.: On Effective Location-Aware Music Recommendation. ACM T INFORM SYST, 34(132) (2016)

22. Baltrunas L, Amatriain X. Towards time-dependent recommendation based on implicit feedback[C]. Proc of RecSys'09 Workshop on CARS. (2009)

23. Van Setten M, Pokraev S, Koolwaaij J. Context-aware recommendations in the mobile tourist application COMPASS[C]. ProcofAdaptiveHypermedia2004., LNCS3137.Berlin: Springer-Verlag, 235-244. (2004)

24. Liu D, Meng X W, Chen J L. A framework for context-aware service recommendation[C]. Proc of IEEE ICACT', 2131-2134. (2008)