<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">In time recommendations through an Associative Classifier and LookBackApriori: a case study</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Anna</forename><surname>Dalla Vecchia</surname></persName>
							<email>anna.dallavecchia@univr.it</email>
							<affiliation key="aff0">
								<orgName type="department">Dept. of Computer Science</orgName>
								<orgName type="institution">University of Verona</orgName>
								<address>
									<settlement>Verona</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Niccolò</forename><surname>Marastoni</surname></persName>
							<email>niccolo.marastoni@univr.it</email>
							<affiliation key="aff0">
								<orgName type="department">Dept. of Computer Science</orgName>
								<orgName type="institution">University of Verona</orgName>
								<address>
									<settlement>Verona</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Elisa</forename><surname>Quintarelli</surname></persName>
							<email>elisa.quintarelli@univr.it</email>
							<affiliation key="aff0">
								<orgName type="department">Dept. of Computer Science</orgName>
								<orgName type="institution">University of Verona</orgName>
								<address>
									<settlement>Verona</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">In time recommendations through an Associative Classifier and LookBackApriori: a case study</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">D40596AA7122949610E312618A646B33</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:17+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Recommendations</term>
					<term>Associative classifier</term>
					<term>Explanation</term>
					<term>Data Mining</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Recommender systems are becoming essential tools in many scenarios, as they help users extract hidden knowledge and useful insights from datasets. In many real domains, the temporal order between events, combined with their contextualization, improves the accuracy of provided suggestions. In this paper, we introduce a framework designed to mine personalized, in time, contextual, and explainable sequential rules useful to provide recommendations for a predefined target parameter.</p><p>Specifically, this framework is composed of the 𝐿 3 Associative Classifier and LookBackApriori, a modification of Apriori algorithm. Our proposal takes historical data and contextual information as input and generates two sets of rules: the first set comprises rules that allow enhancement of the target parameter, and the second makes it worse. The proposed technique is applied to a real-world scenario involving data collected by Fitbit wearable devices to improve the user's sleep score after performing fitness activities in different contexts. The idea has been evaluated on two real datasets, and the results confirm the positive effects of the combination of 𝐿 3 with LookBackApriori.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>The widespread popularity of sensors and wearable devices, like smartwatches and fitness trackers, has increased the amount of available data that can be leveraged to monitor and enhance various aspects of their users' well-being. Such devices are often equipped with intuitive apps for activity tracking that mainly provide aggregate parameters and trend analysis, thus leaving room for more personalized and insightful suggestions to raise the end-users' awareness about what affects certain monitored parameters and habits.</p><p>To achieve advanced insights, historical data, possibly integrated with external information describing the user context, needs to be analyzed for each user to offer tailored and context-aware suggestions to improve their life beyond generic recommendations.</p><p>In this work, we propose a framework that aims to give personalized, and in time, contextual suggestions to a specific user to improve a target parameter (e.g., sleep quality) along with an explanation about the provided suggestions. To achieve this goal we integrate monitored data with contextual information, e.g., current weather conditions in the user location and holidays.</p><p>More in detail, our use case is based on data gathered with Fitbit and focuses on suggesting the intensity of physical activities and rest periods to carry out during the current day to sleep better. This is done by mining the historical contextualized physical activities during a specified temporal window, which represents the number of consecutive observation days taken into account.</p><p>We use two datasets consisting of activity logs from Fitbit wearable devices: PMDataset <ref type="bibr" target="#b0">[1]</ref> and a Custom dataset. The latter has been collected from four willing participants in the past two years to integrate more specific information about the user context.</p><p>The main aim of this paper is the construction of a novel recommender system that combines the strengths of two algorithms: the 𝐿 3 associative classifier <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref> and LookBackApriori (LBA) <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b4">5,</ref><ref type="bibr" target="#b5">6]</ref>. The first one allows us to predict a specific target parameter based on associative classification. It takes as input all the historical physical activity and the related contextual information (i.e., the context at the time the physical activity was performed) and outputs the predicted sleep score. We leverage the second algorithm to provide an explainable recommendation about what activity to do and what to avoid to increase the predicted sleep quality and not decrease it.</p><p>With this framework, we overcome the limitations of the two algorithms and, in particular, the state explosion problems of LBA when managing wide temporal windows are less severe in L 3 . In addition, LBA allows the production of explainable recommendations; indeed, since LBA is based on Apriori, it mines sequential rules that contain in their antecedent the explanation of the provided sleep score present in the consequent.  The document is organized as follows: Section 2 outlines the architecture of our recommender system, while Section 3 presents the case study. Section 4 reports the validation of the proposed framework, and Section 5 explores related work. Finally, Section 6 summarizes the main contributions and outlines future directions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Prediction</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Explanation</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Data at time zero</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Architecture</head><p>The framework proposed in this paper combines an associative classifier, 𝐿 3 , to predict the value of a target parameter (e.g., the sleep score for the current day, the stress level) and an algorithm based on Apriori, called LookBackApriori (LBA), to generate timely and explainable contextual recommendations helpful to suggest what to do to improve the predicted value (i.e. the fitness activities to undertake in the current day to increase the sleep score, whenever it is possible).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Associative classifier</head><p>The first part of our framework comprises the 𝐿 3 associative classifier <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref>. 𝐿 3 uses a technique of lazy pruning to discard those rules that classify training data incorrectly.</p><p>Then, the classification of unlabeled data is executed in two steps: first, by considering a subset of high-quality rules for the classification process, and second, by adding a larger set of rules when it fails to find rules for certain data points.</p><p>In the green section of Fig. <ref type="figure" target="#fig_0">1</ref>, we show the classifier component, which is employed for predicting the value of a target parameter, represented in our scenario by the sleep score for the current day. It takes historical data (i.e., the user's log of their fitness activities and sleep scores) as input and integrates it with past contextual information, including the context of the current day at the time of the prediction.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>LookBackApriori</head><p>The second part of our framework uses the LBA algorithm, which was initially proposed in <ref type="bibr" target="#b3">[4]</ref> and extended in <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6]</ref>. It is an algorithm based on Apriori that mines totally ordered sequential rules and provides timely and explainable recommendations. More in detail, LBA mines association rules where the antecedent is a sequence of itemsets that represent past events or actions by the user with an explicit relative order w.r.t. the current itemset (representing current day events and actions).</p><p>For our specific scenario related to wearable devices, a rule can be formalized as follows:</p><formula xml:id="formula_0">𝑟 : 𝐼 −(𝜏𝑤 −1) ∧ • • • ∧ 𝐼−2 ∧ 𝐼−1 ∧ 𝐼 𝑓 0 → 𝐼 𝑠 0 [𝑠𝑖, 𝑐𝑖]</formula><p>The rule 𝑟 consists of a sequence of itemsets, each representing either fitness activities (𝐼 𝑓 ), sleep quality (𝐼 𝑠 ), or both (𝐼), for a specific day, where 0 represents the current day. The parameter 𝜏𝑤 defines the temporal window, that is, the number of consecutive days that the algorithm can consider and thus may be present in a rule.</p><p>The antecedent can contain all the itemsets up to 𝐼−1 (the day before the current one) or some of them (i.e., the sequence may be incomplete), while only the physical activity data is present for the current day. Indeed, this itemset, 𝐼 𝑓 0 , represents the physical activity suggested to the user by our framework to improve their sleep score for the same night, represented in the consequent as 𝐼 𝑠 0 . The associative classifier 𝐿 3 is used for historical data processing and prediction to address memory-related issues faced by LBA that stem from the size of the input. After the sleep score prediction step, LBA is used to provide explainable positive and negative recommendations thanks to the form of the mined rules. To this end, the antecedent contains the sequence of events that will lead to the sleeping score in the consequent; thus, it provides an explanation for the recommendation.</p><p>Three possible rules mined by the LBA Algorithm are the following:</p><formula xml:id="formula_1">𝑟 1 : {𝐻𝐴 : 3, 𝐿𝐴 : 2} −1 ∧{𝐻𝐴 : 3, 𝐿𝐴 : 2} 0 → {𝑆𝐿 : 1} 0 𝑟 2 : {𝐻𝐴 : 2, 𝑅 : 3} −2 ∧ {𝐿𝐴 : 1} −1 → {𝑆𝐿 : 3} 0 𝑟 3 : {𝐻𝐴 : 2, 𝑅 : 3} −2 ∧ {𝑀 𝐴 : 1} 0 → {𝑆𝐿 : 3} 0</formula><p>𝑟1 states that if yesterday the user performed a high level of heavy physical activity (𝐻𝐴 : 3) and a medium level of light activity (𝐿𝐴 : 2), and today they perform the same activities, the resulting sleep score will have a low value (𝑆𝐿 : 1). 𝑟2 is an incomplete rule since it does not contain information about the physical activity the user should perform during the current day. Although the rule is valid, it is not helpful for making a recommendation to improve sleep quality, as it does not have any itemset labeled 0 in the antecedent. 𝑟3 is another incomplete rule, but it gives us information about the physical activity the user should do during the current day to sleep well; thus, it can be used to provide a recommendation.</p><p>In the orange part of Fig. <ref type="figure" target="#fig_0">1</ref>, we show the contribution of LBA to our framework. Firstly, it mines a set of rules 𝑅 using the Rule Generator, which takes as input the current context, also used by 𝐿 3 for the prediction step, and data at the time of the prediction. Secondly, taking advantage of the label produced by the classifier, the rules generated are split into two sets: those that improve the target parameter value w.r.t. the predicted one is labeled 𝑅+, and those that do not are labeled 𝑅−. Then, the rules in both sets are ordered according to the completeness of the rule antecedent, confidence, and support. The rules recommended to the user are the most complete ones with the highest confidence and support.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">A case study</head><p>Our experiments focus on wearable device data: their logs contain information about daily physical activity levels and sleep scores. Whenever possible (i.e., when we have enough data about the user), we integrate such logs with additional information, e.g., holidays, day of the week, and weather conditions related to the user's location, to better contextualize the gathered fitness and sleep quality data.</p><p>We consider two datasets for this domain: PMdata [1] and Custom. PMdata consists of logs from 16 users, 13 male and 3 female, all aged 23 to 60 years old. The data was collected for 149 days between November 2019 and March 2020.</p><p>The Custom dataset was collected from 4 users specifically for this study, the earliest of which started recording in August 2021 and ended in September 2022. The participants are evenly split between males and females; their ages vary from 16 to 55.</p><p>From both datasets, we make use of the logs about "light", "medium", and "heavy" activity, along with rest periods and the sleep score for each day. Fitbit records these features as minutes spent in each activity type; thus, we discretize them to obtain categorical data as described in <ref type="bibr" target="#b3">[4]</ref>. During this discretization process, the activity levels and sleep scores are further split into three sublevels according to set thresholds, e.g., a heavy activity (𝐻𝐴) can be encoded into three possible labels: 𝐻𝐴 : 1, 𝐻𝐴 : 2, and 𝐻𝐴 : 3. These represent, respectively, a low level, medium level, and high level of heavy activity, all decided by the amount of time spent undertaking the specific physical activity during the day.</p><p>Regarding the context, for both datasets, we also have information on whether a day falls on a weekend (𝑊 𝐸) or not (𝑊 𝐷).</p><p>In addition, for the Custom dataset, we integrate the information about the user's vacations (𝑉 𝐴/𝑛𝑜𝑉 𝐴) and the weather conditions. For this last aspect, we have simplified its representation as follows: if there has been rain, snow, fog, or other bad weather conditions, the label is 𝐵𝑎𝑑. In all the other cases, it is 𝐺𝑜𝑜𝑑. Regarding the temperature, we use the average daily temperature as a feature, and the result is labeled into 𝐶𝑜𝑙𝑑 or 𝐻𝑜𝑡, using the yearly average temperature as a threshold.  Some examples of mined rules are the following:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Practical example</head><formula xml:id="formula_2">𝑟 1 : {𝐶𝑜𝑙𝑑, 𝐺𝑜𝑜𝑑, 𝑊 𝐷, 𝐻𝐴 : 1, 𝐿𝐴 : 2} 0 → {𝑆𝐿 : 1} 0 𝑟 2 : {𝐵𝑎𝑑, 𝑊 𝐷, 𝐿𝐴 : 2, 𝑀 𝐴 : 3} 0 → {𝑆𝐿 : 3} 0</formula><p>Rule 𝑟1 tells us that on a weekday with clear weather, if the user performs low levels of heavy activity (𝐻𝐴 : 1) and medium levels of light activity (𝐿𝐴 : 2), their sleep score for the same night will be low. Whereas rule 𝑟2 states that, in the case of a stormy weekday, the user will sleep well after performing medium levels of light activity (𝐿𝐴 : 2) and high levels of medium activity (𝑀 𝐴 : 3).</p><p>Thanks to the sleep score obtained by the associative classifier, it is possible to split the rules into those that increase or decrease the predicted sleep score. At this stage, the user can explain why their sleep quality may improve or not by looking at the antecedent of the rules.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Evaluation</head><p>To test the validity of our framework, we have performed several experiments on the following aspects:</p><p>• verifying the relevance of historical data and their context in the ability to predict the value of a target parameter, i.e., the sleep score. • testing the performance of the two algorithms used by the framework w.r.t. execution time and memory consumption.</p><p>• testing the efficacy of the proposed framework on 𝐿 3 w.r.t. to its ability to predict the value of the predefined target parameter.</p><p>For all the experiments, we have reserved the first 80% of the Fitbit logs of each user as a training set and the remaining 20% of the data for testing. Due to the sequential nature of the problem, we cannot randomize the sampling of the two sets. Thus, we maintain the sequential order based on the timestamp of the logs and select the last 20% of the dataset for the tests.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Relevance of historical data</head><p>To conduct this part of the experiments, we use the 𝐿 3 associative classifier to predict the sleep label related to the current day 𝑡_0.</p><p>First, we perform the prediction by selecting only the physical activity and context of the current day as input to the classifier without considering historical data. An example of input data for a Custom user is:</p><formula xml:id="formula_3">(𝐺𝑜𝑜𝑑_𝑡0, 𝐻𝑜𝑡_𝑡0, 𝑊 𝐷_𝑡0, 𝑉 𝐴_𝑡0, 𝐿𝐴_3_𝑡0, 𝑀 𝐴_1_𝑡0, 𝐻𝐴_1_𝑡0, 𝑅_2_𝑡0)</formula><p>This can be interpreted as: on clear weather and hot weekdays during a holiday, the user performs a high level of light physical activity, low levels of both medium and heavy activity, and a medium level of rest.</p><p>Then, we add the historical data (i.e., physical activity, context, and sleep score of the past days) to the input used for the first set of experiments.</p><p>Fig. <ref type="figure">3</ref> depicts the recorded accuracies of these two experiments for each user in both PMdata and Custom datasets. These results show that for 77% of users, using historical data instead of only using data from the current day improves the accuracy of the classifier.</p><p>Fig. <ref type="figure" target="#fig_2">4</ref> shows that, regardless of the presence of contextual information, having historical data improves the accuracy of most users. The performance of the algorithm decays quickly as the temporal window increases, especially in the absence of contextual data. Thus, it seems clear that sleep quality does not depend on data that is temporally distant from the current day. Additionally, the accuracy value obtained by some users increases gradually in the presence of contextual information as the length of the temporal window increases. One example is shown in Fig. <ref type="figure" target="#fig_3">5</ref>, where we can also confirm that sleep does not depend on the activities performed six days earlier. We can also observe that contextual information improves the final result. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Time and memory performance</head><p>Despite LBA's intrinsic capability to provide explainable recommendations for achieving a better sleep score, we still employ the associative classifier 𝐿 3 to process historical data. Thanks to the associative classifier, we can process significantly larger volumes of data, e.g., longer sequences of data with their contextual information, without the risk of memory errors. Additionally, 𝐿 3 is significantly faster in obtaining the results. Fig. <ref type="figure" target="#fig_4">6</ref> and Fig. <ref type="figure" target="#fig_5">7</ref> depict the elapsed time and the memory consumption of the framework when using data from one of the users of the Custom dataset, showing the important contribution of 𝐿 3 . During the experiments, the input is the physical activity log and the available contextual information of the chosen user. We maintain the same support and confidence and gradually increase the temporal windows, i.e., increase the historical data given in input. LBA shows an exponential trend for memory consumption and time elapsed, until its memory allocation fails when the temporal window reaches value 4. On the other hand, 𝐿 3 can manage at most a temporal window of 6, maintaining a relatively constant trend.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Evaluation of the framework</head><p>The last set of experiments performed is on the complete framework, as explained in Sec. 3.1. The idea is to validate, on real user logs, the prediction of 𝐿 3 enriched with the recommendation produced by LBA. In order to validate the results of the whole framework, the best approach would be to ask for inputs directly from the users. Due to time constraints, the evaluation of the framework is strictly empirical. As before, we use the first 80% of the dataset to train both 𝐿 3 and LBA. The first step is setting the length of the temporal window, which is done empirically by analyzing the experiments in the previous case study. The input of the classifier is composed of the physical activities, contextual information, and sleep score of the past days and the contextual information of the current day. The classifier then predicts the sleep score on the current day.</p><p>Separately, the rule generator produces a set of rules correlating the physical activities and contextual information for the current day (antecedent) and the related sleep score (consequent).</p><p>At this point, a trained classifier and a set of rules exist for each user. To test the complete framework, we take from the remaining 20% of the dataset a temporal window of observation at a time: all the past data, together with the current context (i.e., the contextual information of the current day), are used by the associative classifier to predict the sleep score.</p><p>In Fig. <ref type="figure" target="#fig_6">8</ref>, we report both the accuracy of the classifier, without any knowledge about physical activity for the current dayIt can be noted that the accuracy of 𝐿 3 for most users is less than 0.45.</p><p>The output of 𝐿 3 produced is used as a threshold to separate the rules mined by the Rule Generator in the two sets 𝑅+ and 𝑅− of positive and negative recommendations, respectively. Due to the nature of the problem at hand, it would not be accurate to use historical data to check whether the recommendation given by the framework will actually result in a change in sleep score.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Related Work</head><p>With the spread of smart devices and the availability of their large datasets, we have the possibility to extract both explicit and implicit knowledge about monitored parameters. For this reason, there are many intelligent techniques proposed in the literature to improve the customization of data exploitation. Recommender Systems (RS) offer suggestions on items, services, or news that may interest users and affect their decisions based on their profile, history, and preferences <ref type="bibr" target="#b6">[7]</ref>. For instance, in <ref type="bibr" target="#b7">[8]</ref>, the authors develop an RS that can suggest activities targeted to specific users to improve their health conditions starting from data collected by a Fitbit wearable device. The physical activity information collected by Fitbit is also used in <ref type="bibr" target="#b8">[9]</ref> to correlate daily physical activity levels with predictions of sleep quality. Neither of the mentioned works considers contextual information.</p><p>In the literature, there are many methodologies for sleep prediction. In particular, <ref type="bibr" target="#b9">[10]</ref> introduces an explainable sleep model that exploits the correlation between daily activities and sleep quality, providing recommendations to improve sleep quality. While the outcome of this framework aligns closely with our proposal, the approach does not account for sequences of events that occurred in the days leading up to the prediction intended for the user. Furthermore, the model presented fails to incorporate external contextual information beyond sensed humidity and temperature. As highlighted in Subsection 4.1, historical data are important to improve the quality of provided predictions.</p><p>In the state of the art, contextual information is often integrated into RS to improve the precision of recommendations. In general, user preferences may vary depending on the environment and the situation in which they are acting <ref type="bibr" target="#b10">[11,</ref><ref type="bibr" target="#b11">12]</ref>. Therefore, Context-Aware Recommender Systems (CARS) use contextual information, such as time, location, and social situation, to add knowledge during the recommendation process, thus improving the personalization and the relevance of the suggestion <ref type="bibr" target="#b12">[13]</ref>. A systematic literature review is proposed in <ref type="bibr" target="#b13">[14]</ref>, where the authors describe the integration of the context in RS, the main categories of contextual features, and the validation mechanism with respect to datasets, properties, metrics, and evaluation protocols.</p><p>In a lot of real scenarios, the history of events and their order is important and can be leveraged in the process of knowledge extraction. Sequential pattern mining aims to extract hidden sequential patterns in sequential databases. These patterns can be used as a first step to extract frequent sequential rules, usually formalized as 𝑋 → 𝑌 <ref type="bibr" target="#b14">[15,</ref><ref type="bibr" target="#b15">16,</ref><ref type="bibr" target="#b16">17]</ref>. These algorithms propose partially ordered sequential rules where the antecedent 𝑋 is composed of events that happened before the consequent 𝑌 and do not consider the relative order of the events. For this reason, we develop our approach where the antecedent is a sequence of events with a relative temporal label.</p><p>In general, when using algorithms based on Apriori to predict a target parameter, the dimension of sequences one can manage is limited. For this purpose, an analysis of classifiers is mandatory. In the literature, there are several associative classifiers, such as CBA <ref type="bibr" target="#b17">[18]</ref>, DeEPs <ref type="bibr" target="#b18">[19]</ref>, CMAR <ref type="bibr" target="#b19">[20]</ref>, CPAR <ref type="bibr" target="#b20">[21]</ref>, and iCAEP <ref type="bibr" target="#b21">[22]</ref>. However, these present two main drawbacks: either a loss of useful information due to an overpruned set of rules or, conversely, a significant growth of the rule set in case of limited rule pruning. For these reasons, we decided to use the 𝐿 3 associative classifier <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref>, which addresses both problems.</p><p>It has also been recognized that when users understand why certain items have been recommended, the suggestion becomes more persuasive. Hence, in recent years, explainable RSs have been applied in real-world scenarios <ref type="bibr" target="#b22">[23]</ref>. However, explanation techniques are often not compatible with some machine learning or deep learning approaches due to their black-box nature <ref type="bibr" target="#b23">[24]</ref>. Although there exist some studies on the explainability, interpretability, and trustworthiness of deep learning techniques <ref type="bibr" target="#b24">[25,</ref><ref type="bibr" target="#b25">26]</ref>, data mining techniques remain more effective in offering comprehensive explanations for the nature of the rules they are able to infer.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusion</head><p>In this paper, we have combined the 𝐿 3 associative classifier and the LBA algorithm to provide explainable recommendations. Such an approach helps give insights to users who desire to know what affects their sleep score and how to improve it when fitness and sleep parameters are monitored through wearable devices. As future work, we are extending the proposal to other domains, like the correlation of fitness activities with blood glucose levels.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: The main components in our framework</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :Figure 3 :</head><label>23</label><figDesc>Figure 2: An intuitive workflow of our framework</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Percentage of users that obtain higher accuracy with the use of historical data, with different lengths of temporal windows, w.r.t. the use of data of the current day</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Accuracy trend when we add more historical data, comparison with and without context</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: Execution time with different temporal windows for USER2 of Custom dataset.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Memory usage with different temporal windows for USER2 of Custom dataset.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 8 :</head><label>8</label><figDesc>Figure 8: Accuracy of the 𝐿 3 associative classifier</figDesc></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Pmdata: a sports logging dataset</title>
		<author>
			<persName><forename type="first">V</forename><surname>Thambawita</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Hicks</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Borgli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">K</forename><surname>Stensland</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Jha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">K</forename><surname>Svensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S.-A</forename><surname>Pettersen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Johansen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">D</forename><surname>Johansen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">D</forename><surname>Pettersen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 11th ACM Multimedia Systems Conference</title>
				<meeting>the 11th ACM Multimedia Systems Conference</meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="231" to="236" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A lazy approach to pruning classification rules</title>
		<author>
			<persName><forename type="first">E</forename><surname>Baralis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Garza</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICDM.2002.1183883</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE International Conference on Data Mining</title>
				<imprint>
			<date type="published" when="2002">2002. 2002. 2002</date>
			<biblScope unit="page" from="35" to="42" />
		</imprint>
	</monogr>
	<note>Proceedings.</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A lazy approach to associative classification</title>
		<author>
			<persName><forename type="first">E</forename><surname>Baralis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chiusano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Garza</surname></persName>
		</author>
		<idno type="DOI">10.1109/TKDE.2007.190677</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Knowledge and Data Engineering</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="page" from="156" to="171" />
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Explainable recommendations for wearable sensor data</title>
		<author>
			<persName><forename type="first">N</forename><surname>Marastoni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Oliboni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Quintarelli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">ternational Conference on Big Data Analytics and Knowledge Discovery</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="241" to="246" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">The synergies of context and data aging in recommendations</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Dalla</forename><surname>Vecchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Marastoni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Oliboni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Quintarelli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Big Data Analytics and Knowledge Discovery</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="80" to="87" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Mining totally ordered sequential rules to provide timely recommendations</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Dalla</forename><surname>Vecchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Marastoni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Migliorini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Oliboni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Quintarelli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">European Conference on Advances in Databases and Information Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="197" to="207" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Introduction to recommender systems handbook</title>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Rokach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Shapira</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Recommender systems handbook</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="1" to="35" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Recommender systems for health informatics: state-of-the-art and future perspectives</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Calero</forename><surname>Valdez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ziefle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Verbert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Felfernig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Holzinger</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Machine Learning for Health Informatics: State-ofthe-Art and Future Challenges</title>
				<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="391" to="414" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Sleep quality prediction from wearable data using deep learning</title>
		<author>
			<persName><forename type="first">A</forename><surname>Sathyanarayana</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Joty</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Fernandez-Luque</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ofli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Srivastava</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Elmagarmid</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Arora</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Taheri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">JMIR mHealth and uHealth</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="page">e125</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Personalized user modelling for context-aware lifestyle recommendations to improve sleep</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pandey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">D</forename><surname>Upadhyay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Nag</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">C</forename><surname>Jain</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">HealthRec-Sys@ RecSys</title>
				<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="8" to="14" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Towards a better understanding of context and context-awareness</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Abowd</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K</forename><surname>Dey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">J</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Davies</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Smith</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Steggles</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Handheld and Ubiquitous Computing, First International Symposium, HUC&apos;99</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">H</forename><surname>Gellersen</surname></persName>
		</editor>
		<meeting><address><addrLine>Karlsruhe, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1999">September 27-29, 1999. 1999</date>
			<biblScope unit="volume">1707</biblScope>
			<biblScope unit="page" from="304" to="307" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Incorporating contextual information in recommender systems using a multidimensional approach</title>
		<author>
			<persName><forename type="first">G</forename><surname>Adomavicius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sankaranarayanan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tuzhilin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Inf. Syst</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<biblScope unit="page" from="103" to="145" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Context-aware recommender systems</title>
		<author>
			<persName><forename type="first">G</forename><surname>Adomavicius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mobasher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tuzhilin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI Mag</title>
		<imprint>
			<biblScope unit="volume">32</biblScope>
			<biblScope unit="page" from="67" to="80" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Characterizing context-aware recommender systems: A systematic literature review</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">M</forename><surname>Villegas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Sánchez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Díaz-Cely</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Tamura</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Systems</title>
		<imprint>
			<biblScope unit="volume">140</biblScope>
			<biblScope unit="page" from="173" to="200" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A survey of sequential pattern mining</title>
		<author>
			<persName><forename type="first">P</forename><surname>Fournier-Viger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>.-W. Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">U</forename><surname>Kiran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">S</forename><surname>Koh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Data Science and Pattern Recognition</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="54" to="77" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Mining sequential patterns by pattern-growth: The prefixspan approach</title>
		<author>
			<persName><forename type="first">J</forename><surname>Pei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mortazavi-Asl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Pinto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Dayal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Hsu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Knowl. Data Eng</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page" from="1424" to="1440" />
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Mining sequential patterns: Generalizations and performance improvements</title>
		<author>
			<persName><forename type="first">R</forename><surname>Srikant</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advances in Database Technology -EDBT&apos;96</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">P</forename><forename type="middle">M G</forename><surname>Apers</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Bouzeghoub</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Gardarin</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1996">1996</date>
			<biblScope unit="volume">1057</biblScope>
			<biblScope unit="page" from="3" to="17" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Integrating classification and association rule mining</title>
		<author>
			<persName><forename type="first">B</forename><surname>Ma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Hsu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the fourth international conference on knowledge discovery and data mining</title>
				<meeting>the fourth international conference on knowledge discovery and data mining</meeting>
		<imprint>
			<date type="published" when="1998">1998</date>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="page" from="55" to="55" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Deeps: A new instance-based lazy discovery and classification system</title>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Dong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Ramamohanarao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wong</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Machine learning</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="page" from="99" to="124" />
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Cmar: Accurate and efficient classification based on multiple class-association rules</title>
		<author>
			<persName><forename type="first">W</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Pei</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings 2001 IEEE international conference on data mining</title>
				<meeting>2001 IEEE international conference on data mining</meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2001">2001</date>
			<biblScope unit="page" from="369" to="376" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Cpar: Classification based on predictive association rules</title>
		<author>
			<persName><forename type="first">X</forename><surname>Yin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Han</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2003 SIAM international conference on data mining, SIAM</title>
				<meeting>the 2003 SIAM international conference on data mining, SIAM</meeting>
		<imprint>
			<date type="published" when="2003">2003</date>
			<biblScope unit="page" from="331" to="335" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Information-based classification by aggregating emerging patterns</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Dong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Ramamohanarao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Intelligent Data Engineering and Automated Learning</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2000">2000</date>
			<biblScope unit="page" from="48" to="53" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Explainable recommendation: A survey and new perspectives</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Chen</surname></persName>
		</author>
		<idno type="DOI">10.1561/1500000066</idno>
	</analytic>
	<monogr>
		<title level="j">Found. Trends Inf. Retr</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="page" from="1" to="101" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Mining semantic knowledge graphs to add explainability to black box recommender systems</title>
		<author>
			<persName><forename type="first">M</forename><surname>Alshammari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Nasraoui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sanders</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page" from="110563" to="110579" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">A Survey of Methods for Explaining Black Box Models</title>
		<author>
			<persName><forename type="first">R</forename><surname>Guidotti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Monreale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ruggieri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Turini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Giannotti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Pedreschi</surname></persName>
		</author>
		<idno type="DOI">10.1145/3236009</idno>
	</analytic>
	<monogr>
		<title level="j">ACM Comput. Surv</title>
		<imprint>
			<biblScope unit="volume">51</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Interpretable, Trustworthy, Responsible, Ethical, Fair, Verifiable AI... What&apos;s Next?</title>
		<author>
			<persName><forename type="first">R</forename><surname>Meo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Nai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Explainable</forename></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-15740-0_3</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of 26th European Conference on Advances in Databases and Information Systems, ADBIS</title>
				<meeting>26th European Conference on Advances in Databases and Information Systems, ADBIS</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="25" to="34" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
