<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>DOLAP</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nastaran Ebrahimi</string-name>
          <email>nastaranebrahimi2021@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zheying Zhang</string-name>
          <email>zheying.zhang@tuni.fi</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kostas Stefanidis</string-name>
          <email>konstantinos.stefanidis@tuni.fi</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Bundle Recommendation Systems, Diversity, Novelty</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tampere University</institution>
          ,
          <addr-line>Tampere</addr-line>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>27</volume>
      <abstract>
        <p>Recommendation systems help users navigate vast amounts of data, with bundle recommendation systems enhancing personalization and customized experience by grouping related items. However, many existing methods overemphasize relevance, leading to repetitive suggestions and user fatigue. This paper introduces two novel bundling methods-Bundle Partition and Bundle Function-designed to balance both diversity and relevance. These methods were evaluated using Amazon datasets on the Appliances, All_Beauty, and Luxury_Beauty categories. Results show a significant increase in diversity, as measured by Intra-List Diversity (ILD), while maintaining high relevance through average ratings. Furthermore, the novelty, assessed via Mean Inverse User Frequency (MIUF), indicates that these methods ofer a fresh and relevant experience. These findings emphasize the importance of diversity in enhancing user engagement.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In many recommendation contexts, particularly in online
shopping and travel package suggestions, users often
prefer to purchase a collection of items rather than a single
product. Therefore, recommending a set of related items
collectively, rather than individually, is more efective. This
strategy, known as bundle recommendation, involves
suggesting groups of complementary items to enhance
decisionmaking, align with real-world buying behavior, and boost
both satisfaction and sales [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        A significant advancement in recommendation system
development is the incorporation of diversification into the
recommendation process [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. While many
recommendation systems prioritize accuracy over diversity [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], diversity
is crucial in bundle recommendations for ofering varied
items that meet diferent customer preferences.
      </p>
      <p>This paper introduces a hybrid bundle recommendation
approach that balances relevance and diversity by
integrating collaborative and content-based filtering. It predicts user
preferences through collaborative filtering and refines
recommendations using item features. The approach includes
two diversity-aware bundling methods: Bundle Partition,
which selects diverse items aligned with user interests; and
Bundle Function, which ensures both user relevance and
variation among items. Utilizing NLP techniques to
calculate item similarities, this method enhances
recommendation quality by reducing redundancy.</p>
      <p>
        The proposed methods are evaluated using real-world
datasets from Amazon’s Appliances, All_Beauty, and
Luxury_Beauty, whose extensive metadata, including product
descriptions, categories, and user ratings, enabled advanced
natural language processing (NLP) analysis [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. The
effectiveness of the bundling approaches was assessed using
Intra List Diversity (ILD) and Mean Inverse User Frequency
(MIUF). The results showed that both the Bundle Partition
and Bundle Function methods successfully introduced
diversity, while maintaining relevance.
      </p>
      <p>Overall, the main contributions of this work are : (i) a
hybrid model that balances relevance and diversity in bundle
recommendations using collaborative filtering and
contentguages and Analytical Processing of Big Data, co-located with EDBT/ICDT</p>
      <p>CEUR</p>
      <p>ceur-ws.org
based techniques; (ii) the use of NLP to analyze item features,
providing more content-rich and diverse bundle
recommendations compared to existing user-centric or budget-focused
models; (iii) an evaluation of the proposed bundling
methods using ILD and MIUF metrics to illustrate the impact of
diversity and novelty on user engagement.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related</title>
    </sec>
    <sec id="sec-3">
      <title>Work</title>
      <p>
        Bundle Recommendations. In e-commerce, users often
purchase multiple items, making bundle recommendations
essential for suggesting sets of products rather than
individual ones [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Bundle sales serve as a cooperative marketing
strategy where multiple brands collaborate to expand their
reach and maximize impact [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. For instance, [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
introduces a model integrating collaborative filtering, demand
functions, and price modeling to optimize product selection
for revenue maximization. Efective bundle
recommendations should prioritize interconnected products, either
complementary or alternative, aligning with user preferences
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Traditional methods [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ] identify frequently
boughttogether items but often overlook personalization and
relevance. Techniques like integer programming [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] fail
to capture pairwise dependencies, treating cross-item
relationships as rigid constraints, while association analysis
[
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ] applies uniform rules that lack personalization [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
Diversity in Bundle Recommendations. Diversity and
novelty are key to improving recommendation
efectiveness [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], with diversity ensuring variation among
recommended items [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ] and novelty introducing unfamiliar
but relevant suggestions [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Studies have sought to
balance relevance and variety, with [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] proposing
the Bundle Generation Network (BGN), which leverages
Determinantal Point Processes (DPPs) to enhance diversity
in bundle recommendations.
      </p>
      <p>This article presents techniques for generating diverse
and relevant bundles, evaluated using metrics like ILD and
MIUF. Unlike approaches that balance relevance and
diversity with budget constraints—potentially compromising
eficiency or diversity—this method optimizes novelty and
user satisfaction while reducing computational costs. It
achieves this through dynamic similarity-based bundling,
randomized partitions, and strategic item selection.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Bundling Methodology</title>
      <p>In this paper, we address the challenge of creating product
bundles that balance diversity and relevance based on user
preferences, aiming to reduce redundancy and enhance the
user experience. we propose a hybrid approach to ensure
both relevance and diversity while keeping relevant items
within each bundle. The method combines collaborative
ifltering using SVD to identify user interests and a
contentbased approach to select suitable items for each bundle.
Determining User Preferences. First, we identify user
preferences to ensure bundles align with individual interests.
The SVD algorithm is used to generate personalized
recommendations based on interaction data, and the top-rated
item is selected as the ”target” item for bundling. Bundling
involves selecting items that not only align with user
preferences and but also add value through diversity. After
choosing the target item, additional items are selected based
on distinct features to ensure variety and relatedness,
aiming to create a well-rounded bundle that avoids redundancy
and enhances user satisfaction. For example, if a user’s
toprated item is a smartphone, the bundle may include a phone
case, screen protector, or wireless earbuds. These items are
selected based on the user’s interest in technology (from
the SVD-based analysis) and are diverse enough to ofer a
broader experience. This prevents repetition and ensures
each item adds value in a diferent way. The process uses
content-based filtering to assess item features, maximizing
diversity within the bundle.</p>
      <p>Computing Similarities. Once the target item  is
identified, the next step is to locate items that share similar
features to enhance recommendation relevance and user
satisfaction. Each item  in the dataset can be represented
by a feature vector f = [ 1 ,  2 , … ,   ], where each  
represents a specific feature, such as brand or category. The
similarity between the target item  and another item  is
calculated using a similarity function, sim(f , f ). Items with
the highest similarity scores are chosen, ensuring that the
recommendations align closely with user preferences.</p>
      <p>Finding similar items is crucial for creating efective
product bundles, as it ensures relevance and increases the
likelihood of high user ratings, enhancing engagement and
satisfaction. To calculate item similarity, metadata is processed
and vectorized using NLP techniques like TF-IDF, which
converts text into numerical vectors, assigning greater
importance to key terms. Cosine similarity is then used to
measure the similarity between items by calculating the
cosine of the angle between their feature vectors. Items with
high similarity scores are considered closely related to the
target item and are selected as potential recommendations,
ensuring relevance and higher user satisfaction.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Bundle Generation</title>
      <p>This section outlines three methods for forming product
bundles. The first method focuses on item similarity, grouping
highly similar items with user preferences without
considering diversity. The second method introduces diversity
by selecting a mix of related but varied items, ensuring a
balance between relevance and diversity using pairwise
dissimilarity and randomization. The third method aims to
maximize intra-bundle diversity by choosing items that
differ from both the target item and each other, providing a
broader set of recommendations to enhance user experience.
Similarity-based Bundling. The similarity-only bundling
method creates product bundles based on items similar to
those previously liked by the user, assuming similar items
will be well-received. This method serves as the base model
to compare with two diversity-aware models. The
algorithm generates a list of items similar to the target item,
identified from the user’s preferences, by comparing it with
other items in the metadata. While this approach ensures
relevance, the resulting bundles may lack variety, leading
to repetitive suggestions. Despite this, it provides a useful
baseline for comparing more diverse bundling strategies.
Partition and Randomization Method. Formally, let
 represent the target item, and let  = { 1,  2, … ,   } be
the set of items similar to  , determined based on the
cosine similarity. The objective is to find items within 
that maximize dissimilarity to  and place them in a list
 :  = {  ∈  ∣ maximize dissimilarity(  ,  )} . This way, we
ensure that the final bundle includes varied items that still
reflect the user’s preferences, reducing redundancy.</p>
      <p>After constructing the list  , the items are shufled and
divided into partitions. A random selection is made from
each partition to add unpredictability, increasing novelty
while maintaining relevance. This approach guarantees a
fresh combination of items for each bundle, resulting in a
dynamic and engaging recommendation process.</p>
      <p>To measure diversity, TF-IDF vectors of item features
are used, and Euclidean distance serves as the metric. This
helps maintain a balance between similarity and diversity
in the item list. For two points P = ( 1,  2, … ,   ) and
Q = ( 1,  2, … ,   ) in a 2-dimensional space, the Euclidean
distance  is: ( P, Q) = √( 1 −  1)2 + ( 2 −  2)2. Euclidean
distance helps identify items that are both relevant and
diverse. This is an ideal measure in this work due to its
simplicity and efectiveness in distinguishing diverse items,
especially when using data like TF-IDF vectors. After
generating the list, the items are shufled and divided into
segments. One item is randomly selected from each segment:
diversity and unpredictability in the final bundle.
 = {  ∣   ∈ random(segment )}. This approach ensures</p>
      <p>Algorithm 1 begins by retrieving and filtering texts of
similar items, then computes TF-IDF vectors for these texts and
the target item. It calculates Euclidean distances between
the target item and similar items, shufles the list of similar
items, and divides it into partitions. One item is randomly
selected from each partition to form bundles, with the first
bundle including the target item.</p>
      <p>Bundle Function Method. The Bundle Function method
aims to curate bundles by strategically selecting items that
are distinct from each other while still aligning with user
preferences. Items similar to the target item  are
identified from a pre-constructed list  = { 1,  2, … ,   }, using
precomputed similarities, like cosine similarity. The goal
is to create a bundle from list  , ensuring each successive
item is as dissimilar as possible to previously selected items.
This is achieved by calculating Euclidean distances between
their feature vectors. Let f and f represent feature vectors
of items   and   in  . The Euclidean distance ( f , f ) is
−   )2. The algorithm
segiven by: ( f , f ) = √</p>
      <p>∑=1 ( 
lects items with the largest Euclidean distances to ensure
variety:  = { 1,  2, … ,   } ∣ maximize ( f , f ), ∀,  ∈ ,  ≠ 
This selection ensures that the items within the bundle are
.
not just variations of the same product, but instead represent
diverse choices that cater to user preferences.</p>
      <p>Algorithm 2 analyzes target items and finds similar ones
dle_idx ← [ _[0]]
3: Create a dictionary asin_idx mapping ASINs to their
indices in</p>
      <sec id="sec-5-1">
        <title>4: Map  to their indices in  , resulting in S_idx</title>
      </sec>
      <sec id="sec-5-2">
        <title>5: Create an empty list bundles</title>
        <p>6: for each  ∈ {1, 2, … , }
do
Start the bundle with the most similar item,
bun</p>
      </sec>
      <sec id="sec-5-3">
        <title>Remove the first item from S_idx,  _ ←</title>
        <p>_[1 ∶
10: while |bundle_idx| &lt;  and  _ ≠ ∅
do</p>
        <sec id="sec-5-3-1">
          <title>Set last_idx ← bundle_idx[−1]</title>
        </sec>
        <sec id="sec-5-3-2">
          <title>Retrieve  last ←  [ last_idx]</title>
        </sec>
      </sec>
      <sec id="sec-5-4">
        <title>Compute</title>
      </sec>
      <sec id="sec-5-5">
        <title>Euclidean distances:</title>
        <p>← [euclidean( last,  [ idx]) ∀ idx ∈  _]
dists
Identify index of max distance: max_dist_idx ←
Add  _[</p>
        <p>max_dist_idx] to bundle_idx and remove
17: Convert bundle_idx to ASINs using  and append to
arg max(dists)
it from  _
16: end while</p>
        <p>bundles
18: return bundles</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Experimental results</title>
      <p>The 2018 Amazon dataset provides rich user-item
interactions and detailed metadata, making it valuable for
recom14: for each bundle (10 total bundles) to select items do
if it is the first bundle then</p>
      <sec id="sec-6-1">
        <title>Make 4 partitions to select items (since the target item is included)</title>
        <p>else
end if
22: end for
23: return list of bundles</p>
      </sec>
      <sec id="sec-6-2">
        <title>Make 5 partitions to select items</title>
      </sec>
      <sec id="sec-6-3">
        <title>Randomly select one ASIN from each partition</title>
      </sec>
      <sec id="sec-6-4">
        <title>Create the bundle with the selected ASINs</title>
        <p>users, ratings, and timestamps, with 371,345, 5,722,988, and
602,777 ratings for the All_Beauty, Luxury_Beauty, and
Appliances categories, respectively. The metadata file includes
product information like title, features, description, price,
brand, and category. The All_Beauty and Luxury_Beauty
categories, with 32,992 and 12,308 products, were combined
as the beauty dataset, while the Appliances dataset, with
30,459 products, was also analyzed.</p>
        <p>
          Evaluating Diversity. In experiments, the Intra-List
Diversity (ILD) metric [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] is calculated for each bundle generated
using one of the three proposed methods. By evaluating
ILD scores across diferent bundling techniques, we aim to
determine how each method impacts diversity in
recommendations. ILD is defined as the average pairwise distance
between items within a set of recommended items.
Formally, ILD = ||(||−1)
1
∑∈
∑∈
(, ) , where || represents
the number of items in the recommendation set  , and (, )
is the distance between two items  and  within the set. ILD
is flexible, as the distance measure (, )
can be defined in
various ways based on the recommendation system’s
context and requirements. We use cosine similarity to calculate
(, ) , defined as the complement of similarity, 1 − sim(, ) .
        </p>
        <p>
          In Table 1, you can see the improvement in diversity by
the use of the methods Bundle Partition and Bundle Function
for beauty and appliances. The Bundle Partition method
consistently shows high ILD values ranging from 0.93 to
0.98, with an average of 0.96, indicating that it efectively
introduces diversity and prevents redundancy in the bundles.
Similarly, the Bundle Function method achieves high ILD
scores ranging from 0.87 to 0.99, with an identical average
of 0.96, suggesting that both methods are equally efective
in ensuring item diversity and enhancing user engagement.
Evaluating Relevance. The Average Rating (AVGr)
represents the mean of ratings for items within a bundle. In
recommendation systems, each item receives a rating, either
from user feedback or predictive algorithms. Based on the
idea in [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], we propose using item ratings as a relevance
score to improve the accuracy of collaborative filtering
recommendations by predicting user preferences. The average
rating helps assess the overall quality or appeal of the items
within the bundle. It is calculated as: AVG = 
where  is the number of items in the bundle, and   is the
rating of item  in the bundle. A higher average rating
indicates that users generally like the items, suggesting the

1 ∑=1   ,
bundle’s likely success, while a lower average may imply
less appeal. Figures 1 and 2 show that both methods
maintain high relevance scores.
        </p>
        <p>Variance of Ratings (VAR) measures the spread of ratings
2 indicate that increasing diversity does not compromise
relevance or perceived quality.</p>
        <p>
          Evaluating Novelty. The Global Long-Tail Novelty [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]
is used to determine how novel an item is by assessing its
MIUF Scores for each method
        </p>
        <p>Bundles Appliances Dataset
defined as: IUF = − log2 ( || |  | ), where |  | is the number of
users interacted with  , and | | the number of users in the
system. For the average novelty of the recommended items,
the Mean Inverse User Frequency (MIUF) is calculated by
averaging the IUF values of all items in the
recommenda∑∈ log2 ( || |  | ), where  is the set of</p>
        <p>The MIUF score measures the novelty of recommended
items by assessing how uncommon they are across the user
base. To evaluate novelty, its distribution is analyzed,
revealing that 90% of items have a MIUF below 13.33. All
bundles generated by both methods meet or exceed this
threshold, indicating their relative novelty. The Bundle
Partition method achieves MIUF values between 13.00 and
18.54, demonstrating significant novelty, while the Bundle
Function method shows even stronger novelty with MIUF
values ranging from 15.50 to 18.54. Table 3 presents the
novelty scores for each dataset.</p>
        <p>Discussion. Bundle Partition and Bundle Function enhance
the recommendations’ diversity and novelty while
maintaining high relevance. ILD scores for both methods are high
in All_Beauty and Luxury_Beauty (0.93-0.98) and slightly
lower in Appliances (0.55-0.98), indicating varied
recommendations. For relevance, AVGr and VAR demonstrate users’
preferences alignment, with AVGr scores up to 4.0.
Novelty, measured by MIUF, is highest for the Bundle Function
method, showing that the methods provide user-relevant
bundles that outperform the Similarity-Based approach.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>6. Summary</title>
      <p>In this paper, we design, develop, and evaluate two bundling
methods, alongside a baseline solution. Our goal is to
improve product bundle recommendations by balancing
relevance and diversity. We implemented a hybrid approach
combining collaborative and content-based filtering, using
NLP to analyze item features. Both methods successfully
introduced diversity without sacrificing relevance, achieving
promising results in maintaining high ratings and
enhancing the overall diversity of recommendations.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Mia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>A survey of researches on personalized bundle recommendation techniques</article-title>
          , in: Hongyang,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qiben</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. X. C.</given-names>
            <surname>Xiaofeng</surname>
          </string-name>
          , Yan (Eds.),
          <source>Machine Learning for Cyber Security</source>
          , Springer International Publishing,
          <year>2020</year>
          , pp.
          <fpage>290</fpage>
          -
          <lpage>304</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kyriakidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ioannidis</surname>
          </string-name>
          ,
          <article-title>On achieving diversity in recommender systems</article-title>
          ,
          <source>in: Proceedings of the ExploreDB</source>
          <year>2017</year>
          ,
          <article-title>Association for Computing Machinery</article-title>
          , Inc,
          <year>2017</year>
          . doi:
          <volume>10</volume>
          .1145/3077331.3077341.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ntoutsi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rausch</surname>
          </string-name>
          , H. Kriegel, ”
          <article-title>strength lies in diferences”: Diversifying friends for recommendations through subspace clustering</article-title>
          ,
          <source>in: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management</source>
          ,
          <string-name>
            <surname>CIKM</surname>
          </string-name>
          <year>2014</year>
          , Shanghai, China, November 3-
          <issue>7</issue>
          ,
          <year>2014</year>
          , ACM,
          <year>2014</year>
          , pp.
          <fpage>729</fpage>
          -
          <lpage>738</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Fleder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Hosanagar</surname>
          </string-name>
          ,
          <article-title>Recommender systems and their impact on sales diversity</article-title>
          ,
          <source>EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce</source>
          (
          <year>2007</year>
          )
          <fpage>192</fpage>
          -
          <lpage>199</lpage>
          . URL: https://dl.acm.org/ doi/10.1145/1250910.1250939. doi:
          <volume>10</volume>
          .1145/1250910. 1250939.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Christophides</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Efthymiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <article-title>Entity Resolution in the Web of Data, Synthesis Lectures on the Semantic Web: Theory and Technology</article-title>
          , Morgan &amp; Claypool Publishers,
          <year>2015</year>
          . doi:
          <volume>10</volume>
          .2200/ S00655ED1V01Y201507WBE013.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T. B.</given-names>
            <surname>Araújo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. E. S.</given-names>
            <surname>Pires</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nummenmaa</surname>
          </string-name>
          ,
          <string-name>
            <surname>T. P.</surname>
          </string-name>
          <article-title>da Nóbrega, Incremental blocking for entity resolution over web streaming data</article-title>
          , in: 2019 IEEE/WIC/ACM International Conference on Web Intelligence,
          <string-name>
            <surname>WI</surname>
          </string-name>
          <year>2019</year>
          , Thessaloniki, Greece,
          <source>October 14- 17</source>
          ,
          <year>2019</year>
          ,
          <year>2019</year>
          , pp.
          <fpage>332</fpage>
          -
          <lpage>336</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Drumwright</surname>
          </string-name>
          ,
          <article-title>A demonstration of anomalies in evaluations of bundling</article-title>
          ,
          <source>Marketing Letters</source>
          <volume>3</volume>
          (
          <year>1992</year>
          )
          <fpage>311</fpage>
          -
          <lpage>321</lpage>
          . URL: https://doi.org/10.1007/ BF00993916. doi:
          <volume>10</volume>
          .1007/BF00993916.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Beladev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          ,
          <article-title>Recommender systems for product bundling</article-title>
          ,
          <source>Knowledge-Based Systems</source>
          <volume>111</volume>
          (
          <year>2016</year>
          )
          <fpage>193</fpage>
          -
          <lpage>206</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.knosys.
          <year>2016</year>
          .
          <volume>08</volume>
          . 013.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y. L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. H.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>Market basket analysis in a multiple store environment, Decision Support Systems 40 (</article-title>
          <year>2005</year>
          )
          <fpage>339</fpage>
          -
          <lpage>354</lpage>
          . doi:
          <volume>10</volume>
          .1016/J. DSS.
          <year>2004</year>
          .
          <volume>04</volume>
          .009.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.</given-names>
            <surname>Garfinkel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gopal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tripathi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Design of a shopbot and recommender system for bundle purchases</article-title>
          ,
          <source>Decision Support Systems</source>
          <volume>42</volume>
          (
          <year>2006</year>
          )
          <fpage>1974</fpage>
          -
          <lpage>1986</lpage>
          . doi:
          <volume>10</volume>
          .1016/J.DSS.
          <year>2006</year>
          .
          <volume>05</volume>
          .005.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. V.</given-names>
            <surname>Lakshmanan</surname>
          </string-name>
          , P. T. Wood,
          <article-title>Breaking out of the box of recommendations: From items to packages</article-title>
          ,
          <source>RecSys'10 - Proceedings of the 4th ACM Conference on Recommender Systems</source>
          (
          <year>2010</year>
          )
          <fpage>151</fpage>
          -
          <lpage>158</lpage>
          . URL: https://dl.acm.org/doi/10.1145/1864708.1864739. doi:
          <volume>10</volume>
          .1145/1864708.1864739/SUPPL_FILE/ RECSYS2010-29092010-08-
          <fpage>01</fpage>
          .MOV.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <article-title>Personalized travel package recommendation</article-title>
          ,
          <source>in: Proceedings - IEEE International Conference on Data Mining</source>
          , ICDM,
          <year>2011</year>
          , pp.
          <fpage>407</fpage>
          -
          <lpage>416</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICDM.
          <year>2011</year>
          .
          <volume>118</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T. C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <article-title>Comparison of product bundling strategies on diferent online shopping behaviors</article-title>
          ,
          <source>Electronic Commerce Research and Applications</source>
          <volume>5</volume>
          (
          <year>2006</year>
          )
          <fpage>295</fpage>
          -
          <lpage>304</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.elerap.
          <year>2006</year>
          .
          <volume>04</volume>
          .006.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V. L.</given-names>
            <surname>Miguéis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Camanho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F. E.</given-names>
            <surname>Cunha</surname>
          </string-name>
          ,
          <article-title>Customer data mining for lifestyle segmentation</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>39</volume>
          (
          <year>2012</year>
          )
          <fpage>9359</fpage>
          -
          <lpage>9366</lpage>
          . doi:
          <volume>10</volume>
          .1016/ j.eswa.
          <year>2012</year>
          .
          <volume>02</volume>
          .133.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Lauw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <article-title>Basket-sensitive personalized item recommendation</article-title>
          , in: C.
          <string-name>
            <surname>Sierra</surname>
          </string-name>
          (Ed.),
          <source>Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI</source>
          <year>2017</year>
          , Melbourne, Australia,
          <source>August 19-25</source>
          ,
          <year>2017</year>
          , ijcai.org,
          <year>2017</year>
          , pp.
          <fpage>2060</fpage>
          -
          <lpage>2066</lpage>
          . URL: https://doi.org/10.24963/ijcai.
          <year>2017</year>
          / 286. doi:
          <volume>10</volume>
          .24963/IJCAI.
          <year>2017</year>
          /286.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Vargas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <article-title>Rank and relevance in novelty and diversity metrics for recommender systems</article-title>
          ,
          <source>in: Proceedings of the fith ACM conference on Recommender systems</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>109</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>C.-N. Ziegler</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>McNee</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Konstan</surname>
          </string-name>
          , G. Lausen,
          <article-title>Improving recommendation lists through topic diversification</article-title>
          ,
          <source>in: Proceedings of the 14th international conference on World Wide Web</source>
          ,
          <year>2005</year>
          , pp.
          <fpage>22</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hurley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vargas</surname>
          </string-name>
          ,
          <article-title>Novelty and diversity in recommender systems</article-title>
          ,
          <source>in: Recommender systems handbook</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>603</fpage>
          -
          <lpage>646</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>An</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <article-title>Personalized bundle list recommendation</article-title>
          ,
          <source>in: The World Wide Web Conference</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>60</fpage>
          -
          <lpage>71</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Z.-P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kudo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Murai</surname>
          </string-name>
          , Y.-G. Ren,
          <article-title>Enhancing recommendation accuracy of item-based collaborative filtering via item-variance weighting</article-title>
          ,
          <source>Applied Sciences</source>
          <volume>9</volume>
          (
          <year>2019</year>
          )
          <year>1928</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Kuscsik</surname>
          </string-name>
          , J.-G. Liu,
          <string-name>
            <given-names>M.</given-names>
            <surname>Medo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Wakeling</surname>
          </string-name>
          , Y.-C.
          <article-title>Zhang, Solving the apparent diversity-accuracy dilemma of recommender systems</article-title>
          ,
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>107</volume>
          (
          <year>2010</year>
          )
          <fpage>4511</fpage>
          -
          <lpage>4515</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>