2021
DOI: 10.1109/access.2020.3047264
|View full text |Cite
|
Sign up to set email alerts
|

Intelligent Tourism Recommendation Algorithm based on Text Mining and MP Nerve Cell Model of Multivariate Transportation Modes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 58 publications
(191 reference statements)
0
8
0
Order By: Relevance
“…A good recommender system can not only provide users with personalized information service needs, but also allow users to have a high degree of trust in it and improve user stickiness. Whenever users cannot clarify their needs, they think of the recommender system [2]. Recommender systems have been widely used in many fields, among which the most typical and promising application field is digital marketing.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A good recommender system can not only provide users with personalized information service needs, but also allow users to have a high degree of trust in it and improve user stickiness. Whenever users cannot clarify their needs, they think of the recommender system [2]. Recommender systems have been widely used in many fields, among which the most typical and promising application field is digital marketing.…”
Section: Introductionmentioning
confidence: 99%
“…With replacement, n samples are extracted, and m decision trees are trained with these n samples, and finally, the prediction classification is obtained. Multiple random variables are usually calculated using the chain rule, as shown in equation (2).…”
Section: Introduction To Random Forest Algorithmmentioning
confidence: 99%
“…As can be seen from equation (5), there are mainly 4 parameters that determine the probability of path selection: pheromone value τ ij (t) of the edge (i, j) at time t , heuristic function η ij (t), information heuristic factor α, and expectation heuristic factor β.…”
Section: Solution Process Of Weighting Algorithmmentioning
confidence: 99%
“…In order to select the appropriate heuristic factor α and expected heuristic factor β, we use Oliver 30 in TSPLIB as test data. e default values of parameters are as follows: pheromone intensity Q 100, pheromone volatilization coe cient P 0.3, maximum number of iterations of the algorithm N c−max 100, weighted quantity m 30, and the combination of heuristic factor α and expected heuristic factor β is (α, β) ∈ (1, 3), (1,4), (1,5), (2, 3), (3, 4), (2, 5) { }. Each group of combinations is solved 10 times, and the mean value is obtained.…”
Section: Parameter Selectionmentioning
confidence: 99%
See 1 more Smart Citation