# Tourist Attraction Recommendation Method Based on Megadata and Artificial Intelligence Algorithm

Authors: Laiyan Yun; Huihua Jiao; Kai Lu
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

As China’s economy continues to grow of informational technology and mobile Internet industry, the online tourism industry has received more and more extensive attention and use. However, as an emerging industry, users often need to spend a lot of time to choose travel services that match their needs because of the complex amount of relevant information. Under such circumstances, this paper studied the recommendation method in travel platform. First, the big data is used to extract user data. Secondly, the current online travel business recommendation for users has the problem of low accuracy. The reason is that the services provided are still in traditional recommendation algorithm. In this paper, the Bayesian network is used to evaluate the user’s attribute preference and generate a data model, using effective methods in artificial intelligence algorithms to improve collaborative filtering algorithms and finally generate hybrid recommendation algorithms. Compared with the traditional recommendation method, the experimental results showed that the research can improve the recommendation accuracy of tourist attractions by 6.55%, increase the user’s satisfaction for the platform, and enhance the visit rate and retention rate of the tourist attraction recommendation platform.


---

## Body

## 1. Introduction

At present, in order to accurately grasp the user’s preferred tourist attractions and improve the visit rate and retention rate of the tourism recommendation platform, the tourism industry has gradually deepened the research on the recommendation algorithm for tourist attractions. However, the current personalized recommendation algorithm still has the problem of low recommendation accuracy. This paper applies big data and artificial intelligence algorithms to improve the recommendation method, which is conducive to improving users’ satisfaction with the platform and improving the visit rate and retention rate of the tourist attraction recommendation platform. Improving the visit rate and retention rate of the tourist attraction recommendation platform, it is of great significance to the good development of the online tourism industry.Liu et al. proposed that it is the most widely used of the personalized recommendation methods. The principle of the algorithm is based on the user’s model labels and the user’s ratings and comments on the recommended entities [1]. Han et al. subdivided the collaborative filtering algorithm into two types: one type is the collaborative filtering algorithm based on high similarity, and the other is the collaborative filtering algorithm based on the data model. The collaborative filtering method based on the high similarity of neighbors focused on analyzing the relationship between users and entities; the model-based collaborative filtering algorithm learned the prediction model through the user’s rating of the entity or other behaviors, built the feature association between the user and the entity, and recommended the entity with high user preference to the users [2]. Many scientists had studied collaborative filtering algorithms based on data models, such as Ngaffo AN’s research on matrix factorization factor models. The matrix factorization factor model is widely used. The matrix factor algorithm is used to extract hidden factors from the evaluation matrix of user objects, and these factors are used to describe users and entities, as well as users’ estimated values of other entities [3]. Besides, Angadi et al. discussed Naive Bayes model. The model had a solid mathematical theory and steady-state classification efficiency as the basis, and the algorithm required by the model was relatively simple, and the main content of the algorithm was to solve some parameters with incomplete data [4]. In addition, there is an analysis of the hidden semantic analysis model performed by Cai. The model used statistical econometrics to analyze large amounts of text, extracted implicit semantic structures that exist between words, and used this kind of implicit semantic structure to reconstruct sentences [5].Problems of the current recommendation algorithm: (1) the problem of cold start. A study by Villanueva-Polanco and Angulo-Madrid pointed out that a cold start is when a new entity that has never been evaluated is added to the system and its associated data is extremely scarce. In addition, when a newly registered user joins the system, the user’s data is extremely lacking, and it is also impossible to recommend [6]. Karacan et al. proposed and applied a novel overlapping method that employs overlapping techniques as a tool to deal with the shortcomings of clustering techniques. The advantage of overlapping techniques is to allow users to feedback their behavior and ratings in social networks, belonging to multiple clusters simultaneously [7]. (2) The problem of sparsity: Chen et al. combines the evaluation of individual cognitive behaviors, user cognitive relationships, and time decay coefficients into a probability matrix decomposed by a single model, combined with the social interaction coefficient for personalized recommendation, for the use of social interaction factor for personalized recommendations [8]. Rodpysh et al. pointed out that the reason for the sparse data is that most users have a very limited number of reviews for the product. Second, as the total number of products and users increases, the number of products viewed by users will only decrease. The proportion of evaluation items to the total is even lower [9]. The sparsity problem can cause inefficiency, low precision, and low adequacy for similarity computation. (3) Real-time questions: according to the research of Paddock, the total number of items and users for calculating similarity keep increasing, so when all the sparse matrices are passed, the time spent increases exponentially, and users’ demands for real-time recommendation will be difficult to meet [10].At present, the research on the recommendation method of tourist attraction recommendation platform had achieved certain results, but there still had a problem about poor recommendation accuracy. This paper applied big data and artificial intelligence algorithms to the improvement of recommendation algorithms, and payed attention to solve the problem of low recommendation accuracy. This paper can accurately discover the needs of users, help users to obtain recommendation results efficiently and accurately, and meet the personalized needs of users.


## 2. Tourist Attraction Recommendation System

The tourist attraction recommendation system can enable users to obtain attractions that match their preferences, save a lot of time for users, and improve users’ satisfaction with the platform, thereby increasing the visit rate of the tourist attraction recommendation platform and enhancing its market competitiveness. The recommendation system is based on the recommendation algorithm. Firstly, the user data is extracted from the big data, and the data is simply analyzed and interpreted. Then, the data is mined, and the user model is generated. Finally, the hybrid recommendation algorithm improved by the artificial intelligence algorithm module completes the prediction of the user’s scenic spot preference. It is shown in Figure1.Figure 1
Tourist attraction recommendation system.


### 2.1. Big Data Module

Because the data collection of big data is very large, the requirements for data retrieval, storage, control, and analysis are very high [11]. It has four characteristics of large scale, fast flow, diverse types, and low value density. The commonly used big data technologies are actually based on the Hadoop ecosystem [12]. Hadoop uses a decentralized system infrastructure. In other words, its data storage and processing processes are distributed and completed by multiple machines. Through such parallel processing, security and data processing scale are improved. The main designs of the Hadoop platform: HDFS and MapReduce [13]. HDFS provides massive storage, and MapReduce provides massive computing. When submitting computing tasks to the MapReduce platform, the computing tasks are first divided into different partitions, each partition processes some input data and then sinks to different nodes. When the Map task is completed, Reduce will combine the outputs of several previous maps and then output. It is equivalent to using distributed machines to complete large-scale computing tasks.Therefore, this paper drew inspiration from the Hadoop ecosystem and built a big data module for building a tourist attraction recommendation system. In this system, the data sources of users and attractions are extensive and diverse, and a complex data environment is formed in parallel, which brings a problem that must be solved for big data processing. Therefore, the big data module must obtain, clean, and integrate the required data sources in order to obtain the essence and relationship of the data. After a series of reconstructions, the data is emptied and stored in a similar structure to ensure high data quality and reliability. The module composition is shown in Figure2.Figure 2
Big data module.Data extraction is not a brand new technology and has been relatively mature in the traditional database field [14]. Data retrieval is the process of filtering the desired data using specific criteria, transferring the data to a target file, and searching the entire data source. As the first step of data processing, data mining plays an important role.The principle of data cleaning is to use the existing technical means to transform the low-quality data in the source data into data that can meet the quality requirements by analyzing the existing format and the reasons for redundant data, so as to ensure the data quality of the datasets generated by the later data integration [15]. Data integration integrates scattered but interrelated data into a unified dataset according to a certain logic, so that the unity and utilization efficiency of the overall data can be guaranteed [16]. Data integration can provide comprehensive data sharing and provide an integrated data source access interface that is convenient for other modules to access the big data module.


### 2.2. Engine Service Module

Engine service module consists of data mining group and user model. The reason it is called “engine service” is that this module is at the heart of the whole system [17]. Its final result will produce a related user model, which contains various data of the user: age; gender; travel time; travel footprint; travel mode of transportation; distance between tourist attractions and residence. The data will be compiled into three types of attributes: interest preference, explicit feedback, and implicit feedback. Only when the generated user model data is accurate can the artificial intelligence algorithm make accurate recommendations; otherwise, it is water without a source and a tree without roots. The module composition is shown in Figure 3.Figure 3
Engine service module.In this module, the data mining group will reanalyze the data processed by the big data module and generate a user model that includes three attributes: interest preference, explicit feedback, and implicit feedback.


### 2.3. Artificial Intelligence Algorithm Module

Artificial intelligence has become a broader term nowadays. In the past, a large number of the term artificial intelligence is regularly used interchangeably with subfields such as machine learning and deep learning. However, they differ from each other in a number of ways. Machine learning, for example, focuses on building systems that can learn or improve performance based on the data they use [18]. In other words, all machine learning is artificial intelligence, but not all artificial intelligence is machine learning. In order to give full play to the value of artificial intelligence, scholars have gradually deepened their research on data science. Data science is an interdisciplinary field that combines professional skills and knowledge from science, data statistics, computer science, and other disciplines, supplemented by other methods to extract data value and conduct a comprehensive and detailed study of data collected and generated from multiple sources analysis [19].The artificial intelligence algorithm module studied in this paper includes four aspects: data processing, feature engineering, model evaluation, and machine learning. The focus of this module is machine learning, mainly generating data models through Bayesian networks and improving hybrid recommendation algorithms through artificial intelligence algorithms. The module composition is shown in Figure4.Figure 4
Artificial intelligence algorithm module.


## 2.1. Big Data Module

Because the data collection of big data is very large, the requirements for data retrieval, storage, control, and analysis are very high [11]. It has four characteristics of large scale, fast flow, diverse types, and low value density. The commonly used big data technologies are actually based on the Hadoop ecosystem [12]. Hadoop uses a decentralized system infrastructure. In other words, its data storage and processing processes are distributed and completed by multiple machines. Through such parallel processing, security and data processing scale are improved. The main designs of the Hadoop platform: HDFS and MapReduce [13]. HDFS provides massive storage, and MapReduce provides massive computing. When submitting computing tasks to the MapReduce platform, the computing tasks are first divided into different partitions, each partition processes some input data and then sinks to different nodes. When the Map task is completed, Reduce will combine the outputs of several previous maps and then output. It is equivalent to using distributed machines to complete large-scale computing tasks.Therefore, this paper drew inspiration from the Hadoop ecosystem and built a big data module for building a tourist attraction recommendation system. In this system, the data sources of users and attractions are extensive and diverse, and a complex data environment is formed in parallel, which brings a problem that must be solved for big data processing. Therefore, the big data module must obtain, clean, and integrate the required data sources in order to obtain the essence and relationship of the data. After a series of reconstructions, the data is emptied and stored in a similar structure to ensure high data quality and reliability. The module composition is shown in Figure2.Figure 2
Big data module.Data extraction is not a brand new technology and has been relatively mature in the traditional database field [14]. Data retrieval is the process of filtering the desired data using specific criteria, transferring the data to a target file, and searching the entire data source. As the first step of data processing, data mining plays an important role.The principle of data cleaning is to use the existing technical means to transform the low-quality data in the source data into data that can meet the quality requirements by analyzing the existing format and the reasons for redundant data, so as to ensure the data quality of the datasets generated by the later data integration [15]. Data integration integrates scattered but interrelated data into a unified dataset according to a certain logic, so that the unity and utilization efficiency of the overall data can be guaranteed [16]. Data integration can provide comprehensive data sharing and provide an integrated data source access interface that is convenient for other modules to access the big data module.


## 2.2. Engine Service Module

Engine service module consists of data mining group and user model. The reason it is called “engine service” is that this module is at the heart of the whole system [17]. Its final result will produce a related user model, which contains various data of the user: age; gender; travel time; travel footprint; travel mode of transportation; distance between tourist attractions and residence. The data will be compiled into three types of attributes: interest preference, explicit feedback, and implicit feedback. Only when the generated user model data is accurate can the artificial intelligence algorithm make accurate recommendations; otherwise, it is water without a source and a tree without roots. The module composition is shown in Figure 3.Figure 3
Engine service module.In this module, the data mining group will reanalyze the data processed by the big data module and generate a user model that includes three attributes: interest preference, explicit feedback, and implicit feedback.


## 2.3. Artificial Intelligence Algorithm Module

Artificial intelligence has become a broader term nowadays. In the past, a large number of the term artificial intelligence is regularly used interchangeably with subfields such as machine learning and deep learning. However, they differ from each other in a number of ways. Machine learning, for example, focuses on building systems that can learn or improve performance based on the data they use [18]. In other words, all machine learning is artificial intelligence, but not all artificial intelligence is machine learning. In order to give full play to the value of artificial intelligence, scholars have gradually deepened their research on data science. Data science is an interdisciplinary field that combines professional skills and knowledge from science, data statistics, computer science, and other disciplines, supplemented by other methods to extract data value and conduct a comprehensive and detailed study of data collected and generated from multiple sources analysis [19].The artificial intelligence algorithm module studied in this paper includes four aspects: data processing, feature engineering, model evaluation, and machine learning. The focus of this module is machine learning, mainly generating data models through Bayesian networks and improving hybrid recommendation algorithms through artificial intelligence algorithms. The module composition is shown in Figure4.Figure 4
Artificial intelligence algorithm module.


## 3. Algorithm for Tourist Attraction Recommendation

### 3.1. Introduction to Bayesian Networks

Bayesian network is a graphical model whose operations contain probabilistic content, so it is often used to analyze and predict the relationship between two objects [20]. As shown in Figure 5, it is a classic Bayesian network diagram. If the probability of X4 is calculated, it needs to rely on X1, X2, and X3. It can be seen that the Bayesian network involves probability problems. The following is a preliminary introduction to Bayesian probability.Figure 5
Bayesian network.The Bayesian formula is a conditional probability formula, such asPAB, which represents the probability of A under the condition of B, where PAB represents the probability of A and B occurring at the same time. From this, the calculation formulas of PAB and PBA can be obtained as follows:
(1)PAB=PA,BPB,(2)PBA=PA,BPA.The formula for calculating the Bayesian posterior probability after processing is as follows:(3)PAB=PAPBAPB.


### 3.2. Bayesian Algorithm

Bayes’ theorem is often used to calculate the probability of a condition occurring by quantifying the relationship between two objects. For example, letX be the head precursor data, which contains unknown attributes whose value is x1,x2,⋯,xn. For the classification problem, after X is determined, the probability of assuming that H is established is PHX, which means that under the condition X is the posterior probability of H. Bayes’ Theorem provides a method consisting of PH, PX, and PXH, similar to Formula (3), where PHX operates as follows:
(4)PHX=PXHPHPX.PH is the prior probability of H, PXH is the posterior probability of X under condition H, and PX is the prior probability of X. Bayes satisfies the condition that each feature data in a special set is independent of each other. And from the probability theory, it can be concluded that when A and B are independent of each other, PAB=PAPB. The calculation formula of its PXH is as follows:
(5)PXH=∏k=1nPxkH=Px1HPx2H⋯PxnH.


### 3.3. Application of Bayesian Network in Scenic Spot Recommendation

In the stage of predicting user preference, it is necessary to calculate the user’s preference for an entity. The probability formula can be derived to express the user’s preference for an entity, and a data model can be evaluated and generated. The generation process is as follows: first, define the user set and the scenic spot set: define the user model as a set, which is used to representn users, and the set is U=u1,u2,⋯,un. Among them, uii∈n represents the user feature vector, and all the features are aggregated to represent a user feature vector. The scenic spot set is defined as A=a1,a2,⋯,am, which represents m users, where aii∈m represents the scenic spot feature vector. All features collectively represent an attraction record. The best choice is obtained by improving formula (5). The calculation formula of the user’s preference for the scenic spot is as follows:
(6)Paiuj=PaiPujaiPuj.


### 3.4. User Model Generated by Bayesian Network

The formula for calculating the user’s preference for scenic spots generated by the Bayesian network is reanalyzed to generate a user model.DefinitionPaiuj represents the probability of recommending a certain scenic spot to a user, that is, the user’s scenic spot recommendation degree. The attribute coincidence between users is defined, which is used to judge the similarity of users’ preference attributes for scenic spots. The calculation formula is as follows:
(7)Simbu,k=Nfu∩NfkNfu∪Nfk.DefineSimbu,k to represent the similarity of behavior between users, and its calculation formula is as follows:
(8)Simbu,k=∑a∈cu,kNsuaNska∑a∈cuNsua2∑a∈ckNska2.Cu,k represents the attractions visited by both user u and user k, Nsua represents the number of check-ins by user u at attraction a, Nska represents the number of times user k has checked in at attraction a, Cu is the number of attractions that user u has checked in, and Ck is the number of attractions that user k has checked in number. Definition Simu,k represents the similarity between user u and user k, including user behavior similarity and user attribute similarity. The calculation formula is as follows:
(9)Simu,k=bSimbu,k+1−bSimfu,k.b is a weighting factor used to adjust the similarity of user behavior and the similarity of user attributes, and the proportion of a certain factor is increased according to the actual situation. If the user is a new user without any information record, then define b=0 at this time, thus solving the problem that the new user has no data under the cold start problem. Define Ru,a to represent user u’s rating for attraction a, and its calculation formula is as follows:
(10)Ru,a=γNu,a∑j∈ANu,j.Nu,a represents the number of check-ins of user u at attraction a, ∑j∈ANu,j represents the number of check-ins of user u, and A table indicates the set of user attractions, and γ is the adjustment factor to prevent the value of Ru,a from being too small. So far, the user model has been created.


### 3.5. Introduction to Leapfrog Algorithm

Hybrid leapfrog algorithm be called SFLA for short belongs to artificial intelligence algorithm. The “frog” group is initialized, and information is transmitted according to the differentiated groups, and the global optimal solution of the problem is obtained by combining the deep subgroup search function and the overall global information exchange function of the frog group. The SFLA algorithm not only has the faster global optimization capability of the particle swarm optimization algorithm but also has the local optimization capability and can perform the evolutionary algorithm faster. The algorithm has the advantages of convenient implementation, fast optimization, and strong global search ability and has became one of the most popular research fields for researchers. The concept diagram of hybrid leapfrog search is shown in Figure6.Figure 6
Hybrid leapfrog search.In the SFLA algorithm, group of frogs is composed of several frog individuals, and each group is divided into several subpopulations containing a random number of frogs. The data of frog individuals in different subpopulations are different, and each frog in the subpopulation has certain special data, which will affect other individuals. Then, after the local search is performed, data is exchanged in each subpopulation, and the local optimal solution can be found in the subpopulation.


### 3.6. Improved Hybrid Recommendation Algorithm Based on Artificial Intelligence

The SFLA algorithm in the artificial intelligence algorithm and the collaborative filtering algorithm are introduced for fusion and improvement to generate a hybrid recommendation algorithm. The mathematical model of the algorithm can be interpreted as: all kinds of substitutes and measurement relations used by the algorithm during the execution process will automatically organize the data into a mathematical model, which is conducive to the analysis of the algorithm. Next, analyzing and explaining the mathematical model of the SFLA algorithm: randomly generateP frog individuals to form the initial frog population Q=F1,F2,⋯,Fp, and the ith frog in Q is denoted as F1xi1,xi2,⋯,xil. This formula represents a solution to the problem, where l refers to the dimension of the solution space. Arranging all the frogs in the population in descending order of fitness and dividing the population into m subpopulations, each subpopulation has n frogs, and the initial total number P of frogs satisfies P=m×n. When the population is divided into subpopulations, the rules described by the formula are used to divide, where Fk refers to the kth frog subpopulation.
(11)Fk=Fk+mj−1∈P1≤j≤n,1≤k≤m.Local search is carried out in each subpopulation and iteratively updated, that is, the position of the frogFw with the worst fitness in each subpopulation is continuously updated iteratively. The updated rules are as follows:
(12)Di=rand0,1×Fb−FW,(13)newFw=Fw+Di−Dmax≤Di≤Dmax.In the formula,rand0,1 refers to a random number between 0 and 1, while Di refers to the distance movement value in the i direction, and Dmax refers to the upper limit of the single position movement of each frog. After the location update operation is performed, if the fitness of newFw is better than that of Fw, use newFw instead of Fw. The fitness of newFw is not as good as that of Fw, replacing Fg with Fb and performing the update operation again.The normal distribution theory is introduced to solve the optimization problem of local minima. The basic theory of normal distribution is as follows: a random variablex that obeys the normal distribution of mathematical expectation is u, and the variance is σ2 which can be expressed as N (u, σ2), and the standard normal distribution is the normal distribution when σ=1, u=0. Its probability density function is as follows:
(14)fx=12πσexp−x−u2σ2.A variation factor that follows a normal distribution is added to the update strategy of the worst frog, whereN0,1 refers to the standard normal distribution. The improved strategy is as follows:
(15)newFw=Fw+N0,1×Di−Dmax≤Di≤Dmax.The mutation strategy of the fittest is added to the SFLA algorithm to improve the lower limit of the quality of the population. The addition of the variation factor can reduce the blindness of optimization, thereby improving the execution speed of the algorithm.(16)newFmij=Fmij+N0,1mij×Fmij.On this basis, the winning mutation mechanism is added to make the population move towards a better solution, and it is easier to find the optimal solution. The winning mutation strategy can be expressed as:(17)newFbj=Fbj∗1+ξN0,1bj.The similarity value of the target useru and the U′ element in the nearest neighbor set can be used as the fitness function, and the final expression of the algorithm is obtained as follows:
(18)fFk=∑n=1Nxknsimu,u′.In order to verify whether the algorithm is effective, two high-dimensional unimodal functions, the Sphere function and the Rosenbrock function, are selected to test the performance of the algorithm. The detailed mathematical formulas and characteristics of the functions are as follows.The Sphere function is often used to measure the accuracy of an algorithm. In the value range, the function only obtains the globally unique optimal value 0 when the point is (0,0,…,0). That is to say, the optimal value of the function isf0,0,⋯,0=0.(19)f1X=∑i=1nxi2,xi∈−100,100.The Rosenbrock function has the characteristics of nonconvex and asymmetric and is generally used to measure the operating efficiency of the algorithm. The function only obtains the globally unique optimal value 0 when the point is (1,1,…,1). In other words, the optimal value of the function isf1,1,⋯,1=0.
(20)f2X=∑i=1n−1xi+1−xi22+xi+12,xi∈−30,30.


## 3.1. Introduction to Bayesian Networks

Bayesian network is a graphical model whose operations contain probabilistic content, so it is often used to analyze and predict the relationship between two objects [20]. As shown in Figure 5, it is a classic Bayesian network diagram. If the probability of X4 is calculated, it needs to rely on X1, X2, and X3. It can be seen that the Bayesian network involves probability problems. The following is a preliminary introduction to Bayesian probability.Figure 5
Bayesian network.The Bayesian formula is a conditional probability formula, such asPAB, which represents the probability of A under the condition of B, where PAB represents the probability of A and B occurring at the same time. From this, the calculation formulas of PAB and PBA can be obtained as follows:
(1)PAB=PA,BPB,(2)PBA=PA,BPA.The formula for calculating the Bayesian posterior probability after processing is as follows:(3)PAB=PAPBAPB.


## 3.2. Bayesian Algorithm

Bayes’ theorem is often used to calculate the probability of a condition occurring by quantifying the relationship between two objects. For example, letX be the head precursor data, which contains unknown attributes whose value is x1,x2,⋯,xn. For the classification problem, after X is determined, the probability of assuming that H is established is PHX, which means that under the condition X is the posterior probability of H. Bayes’ Theorem provides a method consisting of PH, PX, and PXH, similar to Formula (3), where PHX operates as follows:
(4)PHX=PXHPHPX.PH is the prior probability of H, PXH is the posterior probability of X under condition H, and PX is the prior probability of X. Bayes satisfies the condition that each feature data in a special set is independent of each other. And from the probability theory, it can be concluded that when A and B are independent of each other, PAB=PAPB. The calculation formula of its PXH is as follows:
(5)PXH=∏k=1nPxkH=Px1HPx2H⋯PxnH.


## 3.3. Application of Bayesian Network in Scenic Spot Recommendation

In the stage of predicting user preference, it is necessary to calculate the user’s preference for an entity. The probability formula can be derived to express the user’s preference for an entity, and a data model can be evaluated and generated. The generation process is as follows: first, define the user set and the scenic spot set: define the user model as a set, which is used to representn users, and the set is U=u1,u2,⋯,un. Among them, uii∈n represents the user feature vector, and all the features are aggregated to represent a user feature vector. The scenic spot set is defined as A=a1,a2,⋯,am, which represents m users, where aii∈m represents the scenic spot feature vector. All features collectively represent an attraction record. The best choice is obtained by improving formula (5). The calculation formula of the user’s preference for the scenic spot is as follows:
(6)Paiuj=PaiPujaiPuj.


## 3.4. User Model Generated by Bayesian Network

The formula for calculating the user’s preference for scenic spots generated by the Bayesian network is reanalyzed to generate a user model.DefinitionPaiuj represents the probability of recommending a certain scenic spot to a user, that is, the user’s scenic spot recommendation degree. The attribute coincidence between users is defined, which is used to judge the similarity of users’ preference attributes for scenic spots. The calculation formula is as follows:
(7)Simbu,k=Nfu∩NfkNfu∪Nfk.DefineSimbu,k to represent the similarity of behavior between users, and its calculation formula is as follows:
(8)Simbu,k=∑a∈cu,kNsuaNska∑a∈cuNsua2∑a∈ckNska2.Cu,k represents the attractions visited by both user u and user k, Nsua represents the number of check-ins by user u at attraction a, Nska represents the number of times user k has checked in at attraction a, Cu is the number of attractions that user u has checked in, and Ck is the number of attractions that user k has checked in number. Definition Simu,k represents the similarity between user u and user k, including user behavior similarity and user attribute similarity. The calculation formula is as follows:
(9)Simu,k=bSimbu,k+1−bSimfu,k.b is a weighting factor used to adjust the similarity of user behavior and the similarity of user attributes, and the proportion of a certain factor is increased according to the actual situation. If the user is a new user without any information record, then define b=0 at this time, thus solving the problem that the new user has no data under the cold start problem. Define Ru,a to represent user u’s rating for attraction a, and its calculation formula is as follows:
(10)Ru,a=γNu,a∑j∈ANu,j.Nu,a represents the number of check-ins of user u at attraction a, ∑j∈ANu,j represents the number of check-ins of user u, and A table indicates the set of user attractions, and γ is the adjustment factor to prevent the value of Ru,a from being too small. So far, the user model has been created.


## 3.5. Introduction to Leapfrog Algorithm

Hybrid leapfrog algorithm be called SFLA for short belongs to artificial intelligence algorithm. The “frog” group is initialized, and information is transmitted according to the differentiated groups, and the global optimal solution of the problem is obtained by combining the deep subgroup search function and the overall global information exchange function of the frog group. The SFLA algorithm not only has the faster global optimization capability of the particle swarm optimization algorithm but also has the local optimization capability and can perform the evolutionary algorithm faster. The algorithm has the advantages of convenient implementation, fast optimization, and strong global search ability and has became one of the most popular research fields for researchers. The concept diagram of hybrid leapfrog search is shown in Figure6.Figure 6
Hybrid leapfrog search.In the SFLA algorithm, group of frogs is composed of several frog individuals, and each group is divided into several subpopulations containing a random number of frogs. The data of frog individuals in different subpopulations are different, and each frog in the subpopulation has certain special data, which will affect other individuals. Then, after the local search is performed, data is exchanged in each subpopulation, and the local optimal solution can be found in the subpopulation.


## 3.6. Improved Hybrid Recommendation Algorithm Based on Artificial Intelligence

The SFLA algorithm in the artificial intelligence algorithm and the collaborative filtering algorithm are introduced for fusion and improvement to generate a hybrid recommendation algorithm. The mathematical model of the algorithm can be interpreted as: all kinds of substitutes and measurement relations used by the algorithm during the execution process will automatically organize the data into a mathematical model, which is conducive to the analysis of the algorithm. Next, analyzing and explaining the mathematical model of the SFLA algorithm: randomly generateP frog individuals to form the initial frog population Q=F1,F2,⋯,Fp, and the ith frog in Q is denoted as F1xi1,xi2,⋯,xil. This formula represents a solution to the problem, where l refers to the dimension of the solution space. Arranging all the frogs in the population in descending order of fitness and dividing the population into m subpopulations, each subpopulation has n frogs, and the initial total number P of frogs satisfies P=m×n. When the population is divided into subpopulations, the rules described by the formula are used to divide, where Fk refers to the kth frog subpopulation.
(11)Fk=Fk+mj−1∈P1≤j≤n,1≤k≤m.Local search is carried out in each subpopulation and iteratively updated, that is, the position of the frogFw with the worst fitness in each subpopulation is continuously updated iteratively. The updated rules are as follows:
(12)Di=rand0,1×Fb−FW,(13)newFw=Fw+Di−Dmax≤Di≤Dmax.In the formula,rand0,1 refers to a random number between 0 and 1, while Di refers to the distance movement value in the i direction, and Dmax refers to the upper limit of the single position movement of each frog. After the location update operation is performed, if the fitness of newFw is better than that of Fw, use newFw instead of Fw. The fitness of newFw is not as good as that of Fw, replacing Fg with Fb and performing the update operation again.The normal distribution theory is introduced to solve the optimization problem of local minima. The basic theory of normal distribution is as follows: a random variablex that obeys the normal distribution of mathematical expectation is u, and the variance is σ2 which can be expressed as N (u, σ2), and the standard normal distribution is the normal distribution when σ=1, u=0. Its probability density function is as follows:
(14)fx=12πσexp−x−u2σ2.A variation factor that follows a normal distribution is added to the update strategy of the worst frog, whereN0,1 refers to the standard normal distribution. The improved strategy is as follows:
(15)newFw=Fw+N0,1×Di−Dmax≤Di≤Dmax.The mutation strategy of the fittest is added to the SFLA algorithm to improve the lower limit of the quality of the population. The addition of the variation factor can reduce the blindness of optimization, thereby improving the execution speed of the algorithm.(16)newFmij=Fmij+N0,1mij×Fmij.On this basis, the winning mutation mechanism is added to make the population move towards a better solution, and it is easier to find the optimal solution. The winning mutation strategy can be expressed as:(17)newFbj=Fbj∗1+ξN0,1bj.The similarity value of the target useru and the U′ element in the nearest neighbor set can be used as the fitness function, and the final expression of the algorithm is obtained as follows:
(18)fFk=∑n=1Nxknsimu,u′.In order to verify whether the algorithm is effective, two high-dimensional unimodal functions, the Sphere function and the Rosenbrock function, are selected to test the performance of the algorithm. The detailed mathematical formulas and characteristics of the functions are as follows.The Sphere function is often used to measure the accuracy of an algorithm. In the value range, the function only obtains the globally unique optimal value 0 when the point is (0,0,…,0). That is to say, the optimal value of the function isf0,0,⋯,0=0.(19)f1X=∑i=1nxi2,xi∈−100,100.The Rosenbrock function has the characteristics of nonconvex and asymmetric and is generally used to measure the operating efficiency of the algorithm. The function only obtains the globally unique optimal value 0 when the point is (1,1,…,1). In other words, the optimal value of the function isf1,1,⋯,1=0.
(20)f2X=∑i=1n−1xi+1−xi22+xi+12,xi∈−30,30.


## 4. Data Sources

Taking the data obtained online as a dataset, records of 1000 users and 2851 tourist attractions were obtained. User attributes include user ID, gender, age, location, and check-in time; scenic spots include scenic spot identification, user ID, scenic spot description, scenic spot location, scenic spot label, and check-in times. The process of processing the dataset is as follows: first, the operation of prescreening and processing the dataset is carried out; the purpose is to decompose the users who generate a very low number of travel records, so as to improve the accuracy of recommendation. Then, according to the ratio of 8 to 2, the dataset is divided into training set and test set. The training set is used to construct the tourist attraction recommendation algorithm model, and the test set is used to verify the accuracy of the tourist attraction recommendation algorithm.


## 5. Experiment of Recommendation Algorithm

The improved algorithm was named PISICAR, performing experimental analysis on the dataset after processing the data required for the experiment. According to the proposed tourist attraction recommendation algorithm and experimental analysis, it is concluded that the mean absolute error of the algorithm recommendation results is associated with the amount of relevant factors selected as users in the experiment. Therefore, this experiment accepted a different number of adjacent user selections and used PISICAR as a collaborative user filtering-based attractions recommendation algorithm, as well as element-based collaborative filtering and content-based algorithms used in the comparative experiments for comparison. U-CF is used to present a recommendation algorithm for tourist attractions based on joint user filtering, Item-CF is used to present a recommendation algorithm for filtering objects of joint tourist attractions, and Content is a content-based tourism used to present the details of attractions. This paper presents the strength of the algorithm performance by calling the parameters of the mean absolute error value. The specific experimental results are shown in the figure.Neighboring user sets are called for comparison of mean absolute error values in the experiments. The number of its calls is different, and the corresponding mean absolute error value will also change, but the whole is gradually stable with the amount of the growth of the users of the mean absolute error value. By comparing the difference of the number of adjacent user parameters of different algorithms in Figure7, the average absolute error value of the recommendation algorithm proposed in this paper is much lower than that of the other three algorithms.Figure 7
The effect of the number of adjacent users on the mean absolute error.The accuracy comparison is shown in Figure8.Figure 8
Accuracy comparison.The recall comparison is shown in Figure9.Figure 9
Recall comparison.From Figures8 and 9, the precision rate and the recall rate increase with the number of recommendations. However, the accuracy rate reached an inflection point when the number of recommendations increased to a certain extent and then showed a downward trend. It is shown that the accuracy and recall of the algorithm change when the number of tourist attractions recommended to the user changes. A comparison of the algorithm proposed so far in this paper with three other commonly used unimproved algorithms shows that the algorithm proposed in this paper has higher precision and recall. Further analysis showed that the recommendation accuracy of this algorithm is 6.55% higher than that of the unimproved algorithm.


## 6. Conclusion

For a travel recommendation platform, a higher recommendation accuracy rate can bring users a better user experience. Based on big data and artificial intelligence algorithms, this paper improved the tourist attraction recommendation algorithm. There were still shortcomings in the research on the recommendation algorithm of tourist attractions. There are several aspects that can be improved:(1)
In the aspect of recommendation algorithm research, the method used to formulate label parameters for the user model lacks pertinence, and the multifaceted behavior patterns of users cannot be added to the user model. Also, there are not enough labels to cluster sights. Subsequent research will optimize these two aspects(2)
In this paper, the research depth of tourist attraction method based on big data and artificial intelligence algorithm is not enough. The next step is aimed at addressing new users and new attractions. In addition, it is also necessary to introduce scenario factors for scenario analysis to provide extensive and in-depth support for the recommendation of tourist attractions(3)
The big data processing platform still needs to be improved, and there is still a lot of room for improvement in the processing mechanism in the face of diverse and complex data. The next step is to optimize the data algorithm and add it to the data warehouse to better carry out the work of online analysis



---

*Source: 4461165-2022-08-03.xml*