Otwarty dostęp

Traveling Route Generation Algorithm Based On LDA and Collaborative Filtering


Zacytuj

Figure 1.

LDA travel route recommendation algorithm based on KDE and classification
LDA travel route recommendation algorithm based on KDE and classification

Figure 2.

Collaborative filtering travel route recommendation algorithm based on KDE and Classification
Collaborative filtering travel route recommendation algorithm based on KDE and Classification

Figure 3.

Travel city topic model based on LDA
Travel city topic model based on LDA

Figure 4.

The experimental results of different values of hyperparameter α
The experimental results of different values of hyperparameter α

Figure 5.

The experimental results of different values of hyperparameter β
The experimental results of different values of hyperparameter β

Figure 6.

The experimental results of different number of topic K
The experimental results of different number of topic K

Figure 7.

The experimental results of different number of iterations n
The experimental results of different number of iterations n

Figure 8.

The route correlation rate of LDA travel route recommendation algorithm based on KDE and classification
The route correlation rate of LDA travel route recommendation algorithm based on KDE and classification

Figure 9.

The route correlation rate of collaborative filtering travel route recommendation algorithm based on KDE and classification
The route correlation rate of collaborative filtering travel route recommendation algorithm based on KDE and classification

ROUTE BASIC ATTRIBUTE TABLE

 idnameplan_idtypehoursdaysep
meaningCity idCity nameRoute idRoute typePlaying timeThe flag of end of day
Value typestringstringstringstringlistbool
example‘263’‘Osaka’‘3799’‘place’[4.0,8.0]true

INPUT AND OUTPUT OF TRAVEL CITY TOPIC MODEL BASED ON LDA

input: preprocessed and classified travel route text set (one route for one line) The number of topic K, hyperparameters α and β
output:1. Topic number assigned to each word of each text2. Topic probability distribution θ for each text3. Characteristic city probability distribution for each topic4. Word id mapping table in the program5. Top-N feature city words sorted from top to bottom for each topic

THE EXPERIMENTAL RESULTS OF DIFFERENT VALUES OF HYPERPARAMETER A

α5101520253035404550
log4.724.164.023.383.213.163.824.124.685.16
p(e)0.2820.2540.2360.1920.1660.1710.1790.2160.2490.288

THE EXPERIMENTAL RESULTS OF DIFFERENT NUMBER OF ITERATIONS N

n300400500600700800900100011001200
log6.155.864.023.983.823.643.123.313.413.53
p(e)0.3320.3080.2750.2620.2360.2140.1610.1720.1810.194

THE EXPERIMENTAL RESULTS OF DIFFERENT VALUES OF HYPERPARAMETER B

β0.010.050.100.150.200.250.300.350.400.50
log5.624.424.023.324.235.105.825.926.587.21
p(e)0.2820.2540.2360.1720.1980.2160.2320.2990.3280.356

THE OUTPUT RESULTS OF DIFFERENT ALGORITHM

The input of algorithmtotal days of travel7
cities that user wants to goOsaka, Nagoya
The output of algorithmNo improved LDA recommended algorithm[Naoshima: 2.5, Yamanashi: 1.8, Osaka: 56.4, Nagoya: 29.8]
No improved collaborative filtering recommendation algorithm[Yakushima: 12.5, Naoshima: 8.6, Osaka: 42.8, Nagoya: 26.2]
LDA travel route recommendation algorithm based on KDE and classification[Kyoto: 42.4, Nakafurano-cho: 3.9, Osaka: 15.5, Nagoya: 16.5]
collaborative filtering travel route recommendation algorithm based on KDE and classification[Kyoto: 24.2, Tokyo: 20.3, Osaka: 15.5, Nagoya: 16.5]

THE EXPERIMENTAL RESULTS OF DIFFERENT NUMBER OF TOPIC K

k46810121416182022
log5.624.424.023.323.265.105.825.926.587.21
p(e)0.2230.2140.2050.1960.1820.2260.2650.3140.4080.516
eISSN:
2470-8038
Język:
Angielski
Częstotliwość wydawania:
4 razy w roku
Dziedziny czasopisma:
Computer Sciences, other