A Point-of-Interest Recommender System for Tourist Groups Based on Cooperative Location Set Cover Problem

Abstract

Trip recommendation for groups of tourists (TRGT) is a challenging task in tourism since many tourists travel in groups, inducing social interaction and bringing various social benefits. However, TRGT must address various real-life constraints such as limited time for touring, cost, etc. TRGT aims to design personalized tours that meet the preferences of all group members by addressing a variety of tourists’ requirements that may sometimes result in conflicts and stress for the group members. TRGT should satisfy that both the preferences of group members need to be achieved as much as possible and the preferences of group members need to be achieved as evenly as possible. In this paper, we present a methodology for tackling the TRGT problem by reducing it to the Cooperative Location Set Cover Problem (CLSCP), formulated as an integer linear program. The CLSCP aims to select a group of facilities that can satisfy, in aggregate, all demand points. To tackle the CLSCP, we present a new method based on detecting frequent patterns. We also demonstrate the efficiency of the proposed methodology by presenting extensive experimental tests.

1. Introduction

Nowadays, trip recommendation is one of the most important intelligent services for improving user experiences and reducing labor costs in the tourism industry. Trip recommendation is guided by tourist interests and aims to relieve the great number of users/tourists (over one billion tourists travel each year, according to the 2015 annual report of the United Nations World Tourism Organization) from the time and efforts needed to plan visiting places of interest (POIs) by recommending sequences of POIs based (i) on users’ profiles and preferences, (ii) on POIs’ characteristics, (iii) on previous users’ trips, and on other contextual factors. Since tourists abandon standard tour packages in favor of personalized travel itineraries [1,2], the growing importance of POI recommender systems has recently been recognized [3], since arranging independent tours based on tourist guidebooks and/or websites takes a long time.

A lot of models are proposed in the literature to learn the impact of such constraints. Most of them assume a single tourist and aim to recommend personalized itineraries. In the literature, such recommendations are provided by intelligent systems [4,5], although there are other approaches, e.g., recommendations provided by information sharing [6]. However, many tourists travel in groups since traveling together induces social interaction and brings various social benefits, such as family and social capital [7]. Also, traveling in a group supports sustainable tourism.

On the other hand, one of the biggest challenges for traveling in a group is to design personalized tours that meet the preferences of all the members of the group by addressing a variety of tourists requirements that may sometimes result in conflicts and stress for the group members [8]. Trip recommendation for groups of tourists (TRGT) is a complex and time-consuming task. Besides choosing the POIs, several constraints should be satisfied. Such constraints include time constraints, budget constraints, and diversity constraints (visiting POIs from different categories). This constraint satisfaction problem is computationally intractable, and usually it is reduced to the orienteering problem [9].

An early approach to tackling the TRGT is based on aggregating all members’ preferences into a virtual member profile and then transforming the problem to its single member version. This approach is applied to various domains, adopting various aggregation strategies, such as the average strategy [10] or the least misery strategy [11], which assumes a group tends to be as happy as its least happy member.

Most methodologies proposed in the literature for the TRGT problem are based on reducing it to the orienteering problem, the traveling salesman problem, or the vehicle routing problem [12]. These problems have origins in the operational research community, where the objective is to find the optimal path according to a metric of optimality. The principal aim, though, is to consider the personalized interests of the members of the group and not a generalized metric concept.

In this paper, we consider the customized preferences of each member of a group, and we tackle the TRGT problem by reducing it to the cooperative location set cover problem (CLSCP), defined within the operational research field and formulated as an integer linear program [13]. The CLSCP aims to select a group of facilities that can satisfy, in aggregate, all demand points. This problem differs from the well-known location set cover problem (LSCP) in the fact that each demand point is not covered by its closest facility (individual coverage) but by the cooperation of some of the available facilities (cooperative coverage), and a demand point is considered satisfied when the aggregate coverage level exceeds a given threshold. To tackle the CLSCP, we present a new method based on association rule mining that detects frequent itemsets.

The proposed method is suitable for situations in which tourists know the list of must-visit and preferred points. Also, tourists should be aware of their restrictions and budgets (in terms of money, distance, and time).

In what follows, we first present the related work. Then, we present the definition of the cooperative location set cover problem and the proposed methodology. Finally, we present experimental tests and conclude.

2. Related Work

Trip recommendation systems for groups have been proposed for various application domains, such as music [14], TV programs [10], etc. For example, McCarthy [15] proposes a situated restaurant recommender system for recommending restaurants to groups of people all desiring to dine together, based both on the location of these people as well as their culinary preferences. Restaurants/POIs are stored in a database as feature-value pairs. The features represent information for the restaurant. Individual user profiles consist of preferences indicating how important each restaurant feature is to the user. Recommendation is extracted by a heuristic arbitration algorithm, which first ranks restaurants for each user based on comparison to the average preferences of this user over all restaurants and then calculates the group preference for each restaurant by simply summing the individual preferences of the users of the group.

There are only a few methodologies proposed in the literature for the TRGT problem. Ardissono, Goy [16] propose a recommender system that recommends attractions/POIs by considering the preferences of heterogeneous tourist groups. Attractions/POIs are stored in a database as feature-value pairs. Preferences are not described for each member of the group but for homogeneous subgroups, whose members have similar characteristics and are represented by subgroup models. A subgroup model consists of (i) the socio-demographic information of its members, (ii) the system’s estimates of the subgroup requirements on the features of attractions/POIs, (iii) the evaluation/rank of features of attractions/POIs, and (iv) the probability distribution that specifies the likelihood that the subgroup prefers an attraction/POI given a certain feature-value pair. When the user asks for the list of attractions/POIs corresponding to a certain selection criterion, the system displays a recommendation list ranked according to generated subgroup models by using fuzzy evaluation functions. The recommendations are grounded in explanations addressing the possibly conflicting requirements of the group members. Finally, after the user selects certain attractions/POIs from the recommendation list, the system offers an interactive agenda for the user to schedule a tour complying with constraints.

Kinoshita and Heisuke [17] propose a methodology that tries to satisfy two objectives: the preferences of group members need to be achieved as much as possible (total utility of the group—TUG objective), as well as the preferences of group members need to be achieved as evenly as possible (fairness of individual members—FIM objective). The methodology, by using an evolutionary algorithm, first automatically generates a large number of combinations of attractions/POIs, then evaluates these combinations based on attractions/POIs’ characteristics stored in a database, and finally outputs several high scoring combinations as Pareto optimal solutions. Attractions’/POIs’ characteristics stored in the database are expressed as evaluation scores based on certain adjectives. The evaluation scores represent whether the preferences of the group members are achieved. The methodology is not able to handle the FIM objective properly, and it is not able to handle the sequencing and time allocation for each attraction/POI.

Garcia, Sebastia [18] propose a recommender system that recommends a list of tourist activities for a single tourist or group of tourists in a city by maintaining a group profile and combining individual user profiles via intersection or aggregation mechanisms.

Anagnostopoulos, Atassi [19] propose a methodology aiming at meeting the overall group’s tastes (the FIM objective) as well as satisfying a given time and budget constraint. The methodology is based on a generalization of the orienteering problem.

Zheng and Liao [20] propose a methodology that considers a spatial-temporal route structure for handling the known two potential conflicting objectives, i.e., TUG and FIM. The methodology includes POI selection and sequencing, represented by discrete variables, as well as the time spent in POIs, represented by a continuous variable. The methodology is based on a heuristic algorithm in which ant colony optimization (ACO) and a differential evolution algorithm (DEA) evolve discrete and continuous variables, respectively. The methodology optimizes multi-objective solutions by adopting Pareto optimality.

In [21,22,23], a methodology is proposed that is based on the negotiation of tourists in the group. Each user in a group is represented by a personal agent, who knows the user’s preferences and acts on her behalf when trying to agree on items (POIs) with other agents. In order to reach agreements, the agents engage in a cooperative negotiation process.

A current aim of research in group trip recommendations is to provide tour recommendations that include POIs from different categories to avoid “sensory overload” and address conflicting preferences of the members of a group. Most of the work presented in the literature concerns recommendations for single tourist itineraries. For example, in Gionis, Lappas [24], the authors take into account the POI’s categories and consider some relaxed constraints for the POI’s sequential ordering. In Bolzoni, Helmer [25], the authors proposed an algorithm that groups POIs into categories by considering their proximity and maximizes the utility score of recommended POIs by selecting a subset of individual POIs from each POI’s cluster, thus limiting the number of times that each POI category is visited. Considering POI categories is also important for the TRGT problem. For example, in Kargar and Lin [26], a heuristic greedy algorithm is proposed that recommends multi-day tours to a group of tourists meeting requirements regarding distance, time, monetary budget, and POI categories. The main objective is to cover an equal (and maximum) number of preferred POIs for all tourists, i.e., TUG and FIM objectives. Also, the algorithm can handle cases when some tourists in the group (like parents) might have weaker preferences versus other tourists in the group (like children).

3. Cooperative Location Set Cover Problem (CLSCP)

The CLSCP aims to select a group of facilities that can satisfy, in aggregate, all demand points. Recent papers on cooperative cover include Karatas [27], Bagherinejad, Bashiri [28], and Morohosi and Furuta [29].

Each facility emits a “signal”, which decays over the distance, and each demand point observes the aggregated signal emitted by all facilities. It is assumed that a demand point is covered if its aggregated signal exceeds a given threshold; thus, facilities cooperate to provide coverage, as opposed to the classical coverage location model, where coverage is only provided by the closest facility (individual coverage). The aspect of cooperation may also refer to alternative choices when there is a facility failure or congestion.

Consider that facilities represent POIs and demand points represent tourists. Let $N$ be the discrete set of tourists that want to travel together, with $i\in N$. Let $X$ be the set of points of interest, with $j\in X$. The distance between $j\in X$ and $i\in N$ is represented by $d_{ij}$.

$\phi \left(d_{ij}\right)$ represents the preference (signal emitted) of a tourist $i\in N$ at a distance $d$ from the point of interest $j$. The overall preference level of tourist $i\in N$ for points of interest vector $x=\left\{1, 2,\dots ,p\right\}$, where $x\subseteq X$ and $p$ is the total number of selected points of interest (decision variable) or is a pre-defined parameter, is given as:

$${\mathsf{\Phi }}_i\left(x\right)=\sum _{j=1}^p\phi \left(d_{ij}\right)$$

(1)

Let $T$ be the threshold preference level, which indicates that the tourist is considered satisfied. A tourist $i\in N$ is considered satisfied by the points of interest vector $x$, if ${\mathsf{\Phi }}_i\left(x\right)\ge T$. Therefore, in the case of the TRGT problem, the aim is to find the appropriate subset of points of interest (POIs) that satisfy the predefined level of preferences of each tourist $i\in N$.

4. Proposed Methodology

The proposed methodology tries to satisfy both the TUG objective (the preferences of group members need to be achieved as much as possible) and the FIM objective (the preferences of group members need to be achieved as evenly as possible). Moreover, the proposed methodology tries to meet requirements regarding time, monetary budget, and diversity of POI’s categories. Every member of a group of tourists has some preferences in common with the other members of the same group (e.g., destination, budget, duration of the trip, preferred means of transport, etc.). However, conflicting preferences may also exist between members of the same group, and the tour itinerary recommendation must address many of them.

The proposed methodology is based on reducing the TRGT problem to the CLSCP described above. A cooperative location set cover problem is considered such that a group of tourists (demand points) are satisfied by observing the aggregated signal “emitted” by a set of POIs (facilities). POIs are divided into categories based on their similarity level. A tourist is covered if her/his aggregated signal exceeds a user-defined threshold concerning each specific criterion (e.g., time, budget, preference, etc.); thus, POIs cooperate to provide coverage to the group of tourists.

We have developed a new heuristic algorithm for tackling the CLSCP problem instead of using an exact method as in Berman, Drezner [13]. This is due to reduced complexity. The developed algorithm is based on extracting frequent items, which is the base task of association rule mining. Similar heuristic techniques have already been used for other location analysis problems [30,31].

A lot of algorithms have been presented in the literature for extracting frequent items with various time complexities (see Chee, Jaafar [32] for a survey). The choice of such an algorithm is not critical to the proposed methodology. We used the apriori algorithm during the tests.

The proposed methodology is presented below:

• Input Matrices:
  • POI’s classification matrix (a matrix that shows which POI category each POI belongs to, such as Table 1).
  • Preference Matrix (a matrix that shows the preference values assigned to each POI by each group member, such as Table 2).
  • Binary Matrix: a matrix derived by discretization of the preference matrix based on a user-defined threshold. Each cell value that is below this threshold equals 0, otherwise 1, as in Table 3.
• User-defined thresholds:
  • Preference threshold (the values depend on the input dataset). The FIM objective could be adjusted by defining a maximum value for this threshold.
  • The binary threshold is used to discretize the preference matrix into a binary matrix. A high value guarantees that the extracted frequent itemsets consist of POIs that are highly ranked.

• Phase 1.

Form the binary matrix that is used as input to the association rule mining algorithm deference.

• Phase 2.

Perform association rule mining to “Binary Matrix” in order to extract the set of frequent items.

• Phase 3.

Select the most frequent itemset by calculating the number of users (rows) that it covers and, also, by selecting columns that belong to different classes based on the “POI’s classification matrix”.

• Phase 4.

Find the users (rows) that are satisfied during Phase 3 and add the assigned preference values stored in the “Preference Matrix” for each of them, by using the “Preference threshold”.

• Phase 5.

Remove the rows (users) that are satisfied during Phase 4 and then go to Phase 2, considering for each frequent itemset only the columns that have not been already selected in previous iterations.

• Phase 6.

Terminate the process when all rows (users) are satisfied based on the “Preference threshold” or there are no frequent itemsets to consider.

Formally, the input to the methodology is an $T\times P$ matrix $tp$, where T is the number of tourists in a group and P is the number of POIs. Each cell $c_{i,j}$ of $tp$ holds:

(1)

the preference (${pref}_{i,j}$) of tourist $i$ for the POI $j$

(2)

the time (${time}_{i,j}$) the tourist $i$ wishes at least to spend at POI $j$

(3)

the budget (${budg}_{i,j}$) that the tourist $i$ wishes at most to spend for POI $j$.

The Algorithm 1 that implements the proposed methodology is as following:

Algorithm 1 The proposed methodology

Input $tr\left\{ \right\},poi\left\{ \right\}, tp\left\{ \right\}, discr, pthres,tthres, bthres$

Discretize ${pref}_{i,j}$ values based on $discr$ into binary values

Extract frequent itemsets $fitp=\left\{{fi}_1,\dots ,{fi}_m\right\}$ of $tp$ based on discretized ${pref}_{i,j}$ values

Step 1. Do until all tourists are covered

Step 2. For each frequent itemset ${fi}_i=\{c_1,\dots ,c_n\}\in fitp$ do

Step 3.    For each tourist $t\in tr$ do

Step 4.     For each column $c_k\in {fi}_i, 1\le k\le n$ do

${pref[t,fi}_i]+=tp[t,c_k,1]$

${time[t,fi}_i]+=tp[t,c_k,2]$

${budg[t,fi}_i]+=tp[t,c_k,3]$

End for

End for

End for

Step 5. For each frequent itemset ${fi}_i\in fitp$ do

If ${pref[t,fi}_i]>pthres \wedge {time[t,fi}_i]>tthres \wedge {budd[t,fi}_i]<bthres$

Then ${count[fi}_i]++$

End for

Step 6. Find frequent itemset ${fi}_i\in fitp$ where $\mathit{arg}max\left\{{count[fi}_i\right]\}$

Detailed Example

In what follows, we present an analytic example of the proposed methodology. Table 1 is a matrix that contains the category (class) that each POI belongs to. POIs are divided into classes based on similarity levels. All POIs that belong to a specific class have common characteristics. The similarity between POIs that belong to the same class might depend on diverse factors, and hence, in some cases, classes might be wider and might contain less similar POIs, whereas, in other cases, POIs of the same class might be more similar. Given a group of tourists and a set of POIs for which the tourists have expressed their level of preference (Table 2), we apply the apriori algorithm to extract the frequent itemsets (e.g., [POI_1, POI_2], [POI_1, POI_3], etc.). A user-defined binary threshold is used to transform Table 2 into a binary matrix (Table 3) that can be used as input to the apriori algorithm. The binary threshold is set to 4, i.e., any value in Table 2 higher or equal to 4 is transformed to 1, while any other value is transformed to 0. The value of the binary threshold depends on the given dataset and the user’s preferences. The minimum support parameter of the apriori algorithm (i.e., the minimum accepted percentage of records in a dataset that contain a frequent item) represents the percentage of tourists in a group that have expressed positive preference for a specific combination of POIs (i.e., a frequent item). The minimum support threshold is set to 30, and the frequent itemsets extracted by applying the apriori algorithm are shown in Table 4 along with their corresponding support values. Frequent itemsets represent combinations of POIs for which some tourists have expressed positive preference (Table 4).

Table 1. POI’s Classification Matrix.

POI	Class
POI_1	Class_1
POI_2	Class_2
POI_3	Class_1
POI_4	Class_1
POI_5	Class_2

Table 1. POI’s Classification Matrix.

POI	Class
POI_1	Class_1
POI_2	Class_2
POI_3	Class_1
POI_4	Class_1
POI_5	Class_2

Table 2. Preferences Matrix.

	POI_1	POI_2	POI_3	POI_4	POI_5
Tourist_1	10	2	10	4	1
Tourist_2	2	9	2	5	6
Tourist_3	8	5	1	3	10
Tourist_4	1	2	3	2	6
Tourist_5	5	7	8	1	4

Table 2. Preferences Matrix.

	POI_1	POI_2	POI_3	POI_4	POI_5
Tourist_1	10	2	10	4	1
Tourist_2	2	9	2	5	6
Tourist_3	8	5	1	3	10
Tourist_4	1	2	3	2	6
Tourist_5	5	7	8	1	4

Table 3. Binary Matrix.

	POI_1	POI_2	POI_3	POI_4	POI_5
Tourist_1	1	0	1	1	0
Tourist_2	0	1	0	1	1
Tourist_3	1	1	0	0	1
Tourist_4	0	0	0	0	1
Tourist_5	1	1	1	0	1

Table 3. Binary Matrix.

	POI_1	POI_2	POI_3	POI_4	POI_5
Tourist_1	1	0	1	1	0
Tourist_2	0	1	0	1	1
Tourist_3	1	1	0	0	1
Tourist_4	0	0	0	0	1
Tourist_5	1	1	1	0	1

Table 4. Frequent Itemsets.

Frequent Itemset	Minimum Support
[POI_1, POI_2]	40
[POI_1, POI_3]	40
[POI_1, POI_2, POI_5]	40
[POI_1, POI_5]	40
[POI_2, POI_5]	60

Table 4. Frequent Itemsets.

Frequent Itemset	Minimum Support
[POI_1, POI_2]	40
[POI_1, POI_3]	40
[POI_1, POI_2, POI_5]	40
[POI_1, POI_5]	40
[POI_2, POI_5]	60

In each iteration, the proposed method tries to select the best frequent itemset, i.e., the frequent itemset with the highest minimum support that satisfies as many members of the group of tourists as possible. In this example, the frequent itemset [POI_2, POI_5] has the highest support value (ms = 60%). Each tourist is considered satisfied if the aggregate preference calculated by adding the values stored in the “Preference Matrix”, is greater than the “Preference threshold” which is set to 10 (see

Table 5. Proposed Method.

	POI_2	POI_5	Aggregate Preference
Tourist_1	2	1	2 + 1 = 3
Tourist_2	9	6	15
Tourist_3	5	10	15
Tourist_4	2	6	8
Tourist_5	7	4	11
Satisfied tourists based on preference threshold (pthres = 10)			3

). As a result, 3 out of 5 tourists are satisfied by the selection of [POI_2, POI_5], and the next step considers only the tourists that remain unsatisfied. In the next iteration, the frequent itemset with the highest minimum support is selected, excluding those that were already selected during previous iterations.

At the same time, the proposed method tries to provide diverse results and avoid selecting POIs that belong to the same group as POIs selected in previous iterations. During the second iteration, there are four frequent itemsets with the same minimum support, i.e., 40%, and the selection is based on the diversity of the categories of POIs. During the previous iteration, POIs that belong to Class_2 were selected, since POI_2 and POI_5 belong to Class_2. Therefore, during the second iteration, the frequent itemset containing POIs that belong to Class_1 will be preferred [POI_1, POI_3]. The procedure stops when all tourists are satisfied, i.e., all rows are covered.

5. Performance Evaluation

We have conducted experimental tests to demonstrate the efficiency of the proposed methodology. More specifically, we have evaluated the proposed approach by using:

• The LearNext dataset [33], which is usually used as a benchmark in group tourism recommendations [19,34]. This dataset contains:
  • The POIs in three different Italian cities (Florence, Pisa, and Rome) are divided into categories, from which we can produce the POI’s classification matrix and
  • the trajectories of users, which consist of the user IDs, the POIs’ IDs, and the number of photos taken. In order to form the preference matrix, we consider the preference level for a POI as the number of photos taken in that POI, which is already used as a method in [19].
• A subset of this dataset concerning Pisa is formed by randomly selecting 50 tourists and 50 candidate POIs for recommendation.
• Synthetic data are generated by the ΙΒΜ quest market-basket synthetic data generator, with 20 rows and 50 columns forming transactions of 10 POIs on average.

In the group tourist recommendation literature, the performance evaluation of proposed methods is usually based on the average and the standard deviation of the utility over all members of a group [35]. We enriched the list of evaluation metrics by considering not only the average utility of a group but the individuals’ utility level as well, as well as the well-known precision and recall evaluation metrics. In the presented experimental tests, we formed groups of tourists of different sizes, ranging from 20 to 13,412 members.

More specifically, given the list of all POIs, $poi=\left\{{POI}_1,\dots ,{POI}_m\right\}$ and the list of recommended POIs by the proposed methodology $rpoi=\left\{R{POI}_1,\dots ,{RPOI}_k\right\}$, where $K\subseteq M$, we evaluate the proposed method by using the following metrics (

Table 6. Evaluation Metrics.

Metric	Definition	Explanation	Objective
Initial average preference per tourist	$iappt=\frac{{{\sum }_i\sum _j{pref}_{i,j}, pref}_{i,j}>discr, \forall {POI}_j \in poi}{n}$	It represents the average sum of preferences for the POIs selected by each tourist.	Aggregate given preference for each tourist
Recommended average preference per tourist	$rappt=\frac{{{\sum }_i\sum _j{pref}_{i,j}, pref}_{i,j}>discr, \forall {RPOI}_j \in rpoi}{n}$	It represents the average sum of preferences for the POIs recommended by the system	Aggregate suggested preference for each tourist
Initial variation of preference per tourist	$ivppt={{STD}_i({\displaystyle \sum _j}{pref}_{i,j}, pref}_{i,j}>discr, \forall {POI}_j \in poi)$	Preference is denoted as the sum of preferences for POIs selected by each tourist, while the amount of variability is calculated by using standard deviation.	How evenly the preferences of group members are achieved in the input Preferences Matrix.
Recommended variation of preference per tourist	${{rvppt=STD}_i({\displaystyle \sum _j}{pref}_{i,j}, pref}_{i,j}>discr, \forall {RPOI}_j \in rpoi$	Preference is denoted as the sum of preferences for POIs recommended by the system, while the amount of variability is calculated by using standard deviation.	How evenly the preferences of group members are achieved in the recommendation
Average precision per tourist	$appt=\frac{{\sum }_i\raisebox{1ex}{$\left(rpoi \cap poi\right)$}\!\left/ \!\raisebox{-1ex}{$rpoi$}\right. }{n},where \forall poi\left[j\right],rpoi\left[j\right]\Rightarrow { pref}_{i,j}>discr$	Τhe fraction of POIs recommended by the system that are also preferred by a tourist.	How relevant are the proposed instances.
Average recall per tourist	$arpt=\frac{{\sum }_i\raisebox{1ex}{$\left(rpoi \cap poi\right)$}\!\left/ \!\raisebox{-1ex}{$poi$}\right. }{n}, where \forall poi\left[j\right],rpoi\left[j\right]\Rightarrow { pref}_{i,j}>discr$	The fraction of POIs preferred by a tourist that are also recommended by the system	In what proportion the relevant instances are retrieved

) concerning the TUG objective:

Experimental tests consider only preference constraints and not cost or time constraints, since the LearNext dataset does not provide such information. Therefore, only the ${pref[t,fi}_i]>pthres$ criterion is used during Step 5 of the proposed algorithm presented in the previous section.

Figure 1, Figure 2, Figure 3 and Figure 4 present the evaluation of the proposed method based on the above-mentioned six evaluation measures for the synthetic data. Figure 1 shows the average preference per tourist and the average variation of preference per tourist, both in the initial set and the recommended set, with respect to the preference threshold (pthres). The binary threshold (discr) is set to 0 for all the experiments, i.e., all the POIs ranked by a tourist are considered, because of the sparsity of the datasets. It is shown that iappt and rappt tend to be identical, i.e., the preferences of group members are achieved as much as possible both in the initial preference matrix and in its submatrix formed by the recommended POIs (the minimum support threshold is set to 10%). As far as the variation of preferences is concerned, the recommended set obtained by the proposed method has always a lower value for the recommended set of POIs, which means that the preferences of group members are achieved as evenly as possible (FIM objective), exhibiting lower variation than in the initial preference matrix (the minimum support threshold is set to 10%). Figure 3 shows the precision and recall levels with respect to the pthres. Precision (appt) is always 1, which means that the proposed method recommends POIs that the tourists prefer, while recall (arpt) is high (0.95), which means that the method recommends almost all POIs that are explicitly preferred by the tourists.

Figure 2 and Figure 4 show the values of the six evaluation measures with respect to the minimum support threshold (the preference threshold is set to 500). Note that the ideal values of both the preference threshold and the minimum support threshold depend on the input dataset. Figure 2 and Figure 4 show that the performance of the proposed method is quite stable for a range of minimum support threshold values. It is obvious, though, that a great difference, e.g., $ms=5\%$ vs. $ms=50\%$, would affect the performance because of the decrease in extracted frequent patterns.

Figure 5, Figure 6, Figure 7 and Figure 8 present the corresponding evaluation of the proposed method based on the above-mentioned six evaluation measures for the subset of the LearNext dataset, containing 50 rows (tourists) and 50 columns (POIs) concerning Pisa. The results show the effectiveness of the proposed approach, and we should highlight the fact that precision (appt) and recall (arpt) equal 1.

Figure 9, Figure 10, Figure 11, Figure 12, Figure 13, Figure 14, Figure 15, Figure 16, Figure 17, Figure 18, Figure 19 and Figure 20 present the corresponding evaluation of the proposed method based on the above-mentioned six evaluation measures for the entire LearNext dataset, which contains data for three different Italian cities (Florence, Pisa, and Rome). The obtained results in this large-scale dataset are affected by the fact that the LearNext dataset [33] is quite sparse. For instance, concerning the Florence subset, which consists of 7000 users and 918 POIs, less than 5 of them are ranked by a tourist on average. In such cases, there are many methods proposed in the literature [36,37,38] that can handle sparsity problems even in cases where there are no records for a user (the cold-start recommendation problem). Therefore, by using such methods, the results can be further improved.

Figure 15, Figure 16, Figure 17, Figure 18, Figure 19 and Figure 20 show the corresponding precision and recall levels. Based on the experimental results, it seems that in large data sets, the preference and minimum support thresholds do not significantly affect the performance.

Figure 9, Figure 10, Figure 11, Figure 12, Figure 13 and Figure 14 show the average preference and variation in preference per tourist both in the initial entire set of Pisa’s, Rome’s, and Florence’s POIs and for the subset formed by using the recommended set of POIs. Note that the metrics are calculated for the entire set of tourists in the LearNext dataset (up to 13,412 tourists concerning Rome), while usually in the literature the performance evaluation is based on a subset of tourists, e.g., tourists who have visited at least a minimum number of POIs [19]. Figure 9, Figure 11 and Figure 13 show the performance with respect to preference threshold given a specific minimum support threshold, and Figure 10, Figure 12 and Figure 14 show the performance with respect to minimum support threshold given a specific preference threshold.

The above results show that the proposed method efficiently handles such cases since iappt and rappt metrics are quite similar. The latter also holds for the ivppt and rvppt metrics. Also, appt and arpt metrics show that, on average, most of the recommended POIs are preferred by the tourists in the group, while, on average, most of the POIs preferred by the tourists are recommended by the system.

6. Discussion

The proposed reduction of the TRGT problem to the CLSCP problem has proven to be efficient based on the experimental results. We used a diverse set of evaluation metrics that showed the efficacy of our method both on large datasets and on smaller ones. We used measures that either have been used for evaluating similar methods or are introduced in this paper to evaluate the proposed method.

Also, the proposed method appears to be efficient for very sparse input preference matrices. To tackle the problem of sparse input preference matrices, some researchers evaluate similar methods based on a subset of tourists, e.g., tourists who have visited at least a minimum number of POIs [19].

It seems that the proposed method satisfies both the TUG objective, i.e., preferences of group members achieved as much as possible both in the initial preference matrix and in its submatrix formed by the recommended POIs, and the FIM objective, i.e., preferences of group members achieved as evenly as possible both in the initial preference matrix and in its submatrix formed by the recommended POIs. Also, most of the recommended POIs are preferred by the tourists in the group, while most of the preferred POIs are recommended by the system.

The proposed approach, based on the reduction of the TRGT problem to the CLSCP problem, can handle multiple constraints. The proposed method, as implemented by the algorithm presented in Section 4, can handle cost and time constraints, as well as POI’s category. Also, the proposed method adopts the SUM aggregation model (note that optimizing for the sum or the average are equivalent to each other). However, the proposed approach can handle any other model [39] by modifying Step 4 of the presented algorithm. For instance, the following code implements the LEAST MISERY model:

Step 4.	For each column $c_k\in {fi}_i, 1\le k\le n$ do
	$if {pref[t,fi}_i]>tp\left[t,c_k,1\right] Then {pref[t,fi}_i]=tp\left[t,c_k,1\right]$
	…
	End for

Most methodologies proposed in the literature for the TRGT problem are based on reducing it to operational research models (e.g., the orienteering problem), where the objective is to find the optimal path according to a metric of optimality. Therefore, such methodologies constitute hard problems. For instance, the orienteering problem is APX-hard [40] in general. On the other hand, with respect to the solution of linear programming models using variants of Simplex, it was shown theoretically that exponential cases exist within the class of network problems [41]. Thus, many researchers exploit soft computing, such as genetic algorithms and machine learning, to tackle the high complexity.

The proposed method is a suboptimal method that reduces time complexity while at the same time efficiently satisfying multiple competing objectives, such as TUG and FIM objectives, as well as cost, time, and POI’s category constraints. The time complexity of the proposed method applied to an input binary preference matrix, pref(T,P), is dominated by the time complexity of extracting frequent itemsets. The time complexity of the used algorithm is $O\left(\left|T\right|*\left|P\right|*\left|C_1\cup C_2\cup \dots C_k\right|\right)$, where $C_1, C_2,\dots {,C}_k$ are the examined sets of candidate frequent itemsets (which can be further reduced by using more efficient techniques as in [42,43].

For instance, in

Table 7. Comparison with other methods.

Data Set	Recommended Average Preference per Tourist (rappt) = Average Solution Value				Execution Time (s)
	Proposed	BUMA	ACO	BR++	Proposed	BUMA	ACO	BR++
ROME (13,412)	~16				~22
FLORENCE (7000)	~14				~6
PISA (1718)	~8				~0.75
ROME (1872)		~45	~45	~45		~5530	~276	~53
FLORENCE (905)		~60	~60	~60		~1775	~1318	~89
PISA (134)		~50	~50	~50		~1051	~52	~10
ROME (1794)	~73				~165
FLORENCE (891)	~56				~27
PISA (103)	~47				~0.1
ROME (20)	~56 (average)				~0.03
FLORENCE (20)	~66 (average)				~0.6
PISA (20)	~37 (average)				~0.1

the quality of the solution and the execution time are presented for both the proposed approach and the approach presented in [19], both adopting the SUM aggregation model. The approach presented in [19] exhibits the best results by exploiting (1) the best user meta-algorithm (BUMA), (2) an ant-colony optimization algorithm (ACO), and (3) the best ratio plus plus (BR++) greedy heuristic [19]. It is very important to note that the group size for the proposed method is the entire set of tourists in the LearNext dataset (13,412/7000/1718), while it is only 20 for the approach presented in [19]. Also, the entire set of POIs is taken into consideration for the proposed approach. Moreover, the size of the datasets used during evaluation of the proposed method (13412/7000/1718) is considerably larger than those (1872/905/134) used during evaluation of the approach presented in [19]. Even using those smaller datasets, many algorithms checked in [19], including the optimal one, fail to terminate in a reasonable time [19].

Since the LearNext dataset [33] is quite sparse, we also form subsets of ROME, FLORENCE and PISA datasets, having 1794, 891, and 103 instances, respectively, that consist of those tourists that have ranked at least 10 POIs for both ROME and FLORENCE datasets and 8 for the PISA one. The results for the proposed method are shown in Table 4.

Finally, we randomly formed five subsets of each of ROME, FLORENCE, and PISA datasets. To compare with the method presented in [19], each such subset consists of only 20 tourists. The results for the proposed method are shown in Table 7.

Of course, since the proposed method is not optimal, it has limitations. For instance, some tourists (demand points) are not covered. The number of uncovered tourists depends on the number of tourists; for instance, it is 0% for small datasets (PISA subset and synthetic dataset) and 79% for the ROME dataset (pthres = 10). However, even in the latter case, the quality of the result (rappt) should be evaluated with respect to the initial average preference per tourist (iappt), as shown in the input preference matrix (see previous section).

7. Conclusions

It was proven that the proposed method is efficient based on the experimental results. The preferences of group members were achieved as much as possible and as evenly as possible. Also, most of the recommended POIs are preferred by the tourists in the group, while most of the preferred POIs are recommended by the system.

The accuracy of the proposed method achieved by the setup presented in this paper is grounds for applying it to extended problems, such as those considering more constraints. We plan to extend the proposed method in order to handle more constraints apart from cost, time, and POI category, such as the location of tourists in the group and POI sequencing.

Moreover, we plan to check the proposed method by exploiting more information about tourists, such as personal and demographic information data or feedback about the satisfaction of tourists regarding their previous interactions with the recommendation process. Also, we plan to exploit the method presented in [38] in order to tackle sparsity problems. The above extensions could further improve the results of the proposed method.

Thus, the proposed approach, based on the reduction of the TRGT problem to the CLSCP problem, is a new approach that can be easily extended for handling various constraints and aggregation models, while at the same time, as a suboptimal method, it exhibits low time complexity even for large datasets.