<?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">Topical Video-On-Demand Recommendations based on Event Detection</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Tobias</forename><surname>Dörsch</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DAI-Labor</orgName>
								<orgName type="institution">TU Berlin</orgName>
								<address>
									<addrLine>Ernst-Reuter-Platz 7</addrLine>
									<postCode>D-10587</postCode>
									<settlement>Berlin</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Andreas</forename><surname>Lommatzsch</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DAI-Labor</orgName>
								<orgName type="institution">TU Berlin</orgName>
								<address>
									<addrLine>Ernst-Reuter-Platz 7</addrLine>
									<postCode>D-10587</postCode>
									<settlement>Berlin</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Christian</forename><surname>Rakow</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DAI-Labor</orgName>
								<orgName type="institution">TU Berlin</orgName>
								<address>
									<addrLine>Ernst-Reuter-Platz 7</addrLine>
									<postCode>D-10587</postCode>
									<settlement>Berlin</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Topical Video-On-Demand Recommendations based on Event Detection</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">7B5106917E01E4AE4538107DC81BA723</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-19T15:21+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>recommender</term>
					<term>event detection</term>
					<term>privacy preserving recommender</term>
					<term>Linked Open Data</term>
					<term>video on demand</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Recommender systems help users to discover relevant items. Traditionally, recommender systems rely on both detailed knowledge of the domain and an extensive user profile. However, small numbers of users, privacy concerns, or a very specific domain limit access or availability to this information. In this work, we present an approach for recommending items based on events relevant to the target group of our system. We exemplify the approach with the aid of a Video-On-Demand platform specialized in independent and art-house movies. Our recommender analyzes domain-specific blogs and news. It extracts current events that can be used for triggering topical recommendations. We show that our approach successfully identifies relevant events and provides highly relevant results without requiring detailed user profiles.</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 rapidly growing amount of items in online shops and entertainment services make it very hard for users to find relevant items. Recommender systems have been developed for supporting users to discover items potentially unknown and matching the user preferences. A widely used approach is user-based collaborative filtering computing the similarity between users and suggesting items that users with similar interests liked. A weakness of collaborative filtering is that current trends and temporal aspects are not taken into account. In many scenarios the context and seasonality have a high influence on the user preferences. Traditionally, experts (e.g. "curators") compile topical recommendations in video shops or libraries taking into account new releases, trends as well as current events. This motivates us to develop a recommender that scans several different news streams, detects relevant events, and uses this information for computing recommendations.</p><p>Video-on-Demand (VoD) systems allow users to watch almost any movie at any time. The challenge for a VoD recommender system is not only identifying items matching the user preferences but also computing when to recommend an item. In the past, curators knowing the typical seasonal user preferences and the relevant events (awards ceremonies, holidays, etc.) created a schedule when to broadcast a movie. We bring this principle to the VoD recommender. The recommender determines events and trends relevant to a specific target group. Based on these events we compute topical recommendations, which can be weighted by individual preferences. The event-based recommendations are often helpful for escaping the filter bubble and for suggesting items related to current trends. We develop a recommender system for a VoD service focused on independent and art-house movies. In contrast to main stream VoD services, our portal does not offer blockbuster movies but a carefully selected catalog of films tailored to the needs of a niche market. A remarkable fraction of the offered films are documentaries and films related to current political topics. The requirements in the scenario are providing new relevant recommendations every day without relying on user profiles. We build our system on the idea that recognizing events relevant to our target group is a valuable basis for recommending relevant movies.</p><p>The identification of events suitable for recommending items leads to several challenges. To extract events, suitable sources must be identified and appropriate ways of processing and storing the contained information must be developed. This task requires learning algorithms able to identify events in streams of news data suitable for recommending items (films). Dependent from the different events types, adequate methods are needed for the event recognition and for linking events and films. In addition, explanations for the suggested items should be provided for improving the trust in the suggestions since recommendations based on news events are still unfamiliar for most users.</p><p>The remaining paper is structured as follows. Sec. 2 summarizes related work and discusses the connection to relevant research domains. Our approach is presented in Sec. 3. In Sec. 4 we evaluate our approach and discuss the strengths and weaknesses of our approach. Finally, a conclusion and an outlook to future work are given in Sec. 5.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Related Work</head><p>The task of recommending films on a daily basis is related to different domains.</p><p>CF-based Recommender Most movie recommender system focus on collaborative filtering (CF) <ref type="bibr" target="#b3">[4]</ref>. CF-based approaches analyze the ratings users assign to items. The predictions are calculated by computing the similarity between either users ("userbased CF") or the similarity between items ("item-based CF"). A requirement for getting high-quality recommendations is that a sufficient number of ratings for every user and every item are available. Well-known problems of CF-based approaches are the popularity bias <ref type="bibr" target="#b5">[6]</ref> and the cold start problem <ref type="bibr" target="#b0">[1]</ref>. CF-based algorithms tend to suggest popular, often already known items.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Context and Event Detection</head><p>Beside the individual user preferences several different aspects influence the perceived relevance of movies, e.g. seasonality or the relation to events. Studies analyzing the messages in social networks show that holidays and recent events have a high impact on the discussed topics <ref type="bibr" target="#b1">[2]</ref>. The detection of events and the aggregation of messages related to the events are research topics in the analysis of social networks and news streams. Hennig et al. <ref type="bibr" target="#b2">[3]</ref> applied clustering algorithms to news streams for identifying events in the news. The focus of the work lies on extracting and tracking topics but not on recommending items. Macedo et al. <ref type="bibr" target="#b4">[5]</ref> developed a system that recommends social events. Based on the analysis of the user's past behavior, the proposed system recommends events based on social distance, and both location and time preferences.</p><p>Discussion Contexts and events have a high impact on the interest of users. Hence, building recommender systems computing recommendations based on relevant events is a promising approach helping users to escape the filter bubble and to find items related to the current topics of interest.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Approach</head><p>We develop a recommender system implementing a 4-layered architecture. The first layer collects news from heterogeneous sources. The second layer aggregates the collected data and extracts potentially relevant events. In addition, semantic data collections are integrated in order to consider expert-defined events (such as birthdays or memorial days). The third layer computes recommendations based on the events relevant to the target group. In the 4th layer, the recommendations are enriched and optimized for presentation. Explanations are generated for improving the trust in the relevance of the recommendations. The architecture of the system is visualized in Fig. <ref type="figure" target="#fig_0">1</ref>. In the next paragraphs, we explain the implemented components in detail.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Collecting Data for Detecting Events</head><p>The crawlers continuously collect data being the basis for the identification of events. In order to focus on the events relevant to the target group, we carefully select the sources. In our scenario, we are especially interested in the domains art house, festivals, and documentaries. We analyze the RSS feeds of portals reporting on the domains. In addition, we crawl the TWITTER messages of an expert-defined set of accounts (using the TWITTER streaming API). In addition, we collect tweets from the major news portals for tracking the most relevant topics in the domain of politics. The selection of sources grants us access to up-to-date knowledge from domain experts. These experts typically write about the most relevant events and current trends. In our system we monitor º 800 TWITTER accounts and º 15 RSS feeds.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Recognition of Relevant Events</head><p>We consider two types of events. "Static" events such as birthdays, anniversaries, and memorial days are imported from semantic data collections. "Dynamic" events such as won awards, politic events, or the death of a director are detected in the news streams. Knowledge Source for Events The "static" events are separated into two groups. The first group is formed by person-and movie-related events. The second group is built by holidays and memorial days typically related to specific keywords and genres.</p><p>Relevant Persons: Based on the movie catalog we know the persons related to the potentially relevant movies. We link the persons with DBPEDIA in order to collect all available birthdays of persons related to the movies. The same procedure is done for movie release days and awards won by the movie. The challenge in the task is the ambiguity of names and titles. We address this issue by computing a matching score taking into account context data. We only connect persons with DBPEDIA if the confidence score is above a threshold in order to prevent false positive matches. The score is calculated using the attributes of the entities (occupation, age, synopsis). User feedback is incorporated in order to correct and extend the automatically created links.</p><p>Relevant Holidays: In contrast to persons directly listed in the meta-data describing movies, the relations between holidays and movies are computed based on the textual description of the holidays. For this purpose we search the name of the holiday in the movie description and compute the textual similarity between the descriptions of the holidays (retrieved from DBPEDIA) and the synopsis of the movie. If the relatedness is above a threshold (optimized on a training dataset) the movie is linked to the holiday. Discussion: Aggregating the different types of events, we find on average of about 20 events for each day of the year. This number of potentially relevant events allows us to filter out the most relevant events taking into account feedback from users and experts. In addition, the number of potentially relevant events allows us to ensure the diversity of events (e.g. with respect to actors, directors, composers as well as birthday, anniversaries). Static events are related for a specific day and typically recalled on the date of occurrence. However, some users may still be interested in the event a few days earlier or later (e.g. if they do not use the portal during the week). In order to make these recommendations available to those users, the relevance of static events degrades slowly over the course of 5 days.</p><p>Identifying Events in Tweets and RSS Feeds For recognizing events in news streams, we analyze how often a relevant person (listed in the movie catalog) is mentioned in the news or tweets on a daily basis. An event is detected if a person is much more frequently mentioned than during an "average" day. Due to the large differences in popularity of movies and people, we implemented a 3-dimensional model: The popularity of a topic is identified by a long-and a short-term change in mentions as well as by the number of sources in that the topic is recognized. Since we do not compare topics against each other, each topic must fulfill criteria that are specific to its own time series. This leads to higher diversity in the recommended movies as well as to a broad spectrum of movies. In general, trend-detection for popular persons works more reliably than for unpopular persons. This is due to the fact that an increase of mentions of a popular topic is larger and thus easier to separate from noise.</p><p>Discussion The detection of the events and the linking of events with entities is the central component of the recommender. The recognition of static events is computed in advance when new movies are added to the catalog. The linking of dynamic events is done on a daily basis. The process is based on several text mining and similarity computations. A regular desktop computer suffices to complete the computations within minutes as the catalog is of limited size.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3">Computing Recommendations</head><p>Even though our database contains a large number of events, each type of event should optimally trigger its own set of recommended movies. On the other hand, some topics and events are very well connected in the movie database. In some cases, this leads to a number of recommended movies too large for a recommendation set. In other cases, too few movies are available to fill a type-specific set (i.e. recommendations based on birthdays). In those cases, our system mixes sets together based on the types' similarity (e.g. birthdays and days of death) to achieve a suitable size for a single set. If we have too many candidates for a set (e.g. 20 birthdays on the same day), we lower the number of allowed movies per event or select the set of trigger events randomly for each user.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4">Presentation of results</head><p>In our VoD scenario, we present the recommendations computed based on the recognized topics on the front page of the VoD portal and in daily newsletters to registered users.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>The topical recommendation of the front page:</head><p>The landing page of the VoD service presents the sets of recommended movies. A header shows the type of event used for this set and creates the topical connection between each movie. To initially spike the users interest in a recommended movie, the trigger event is presented together with a short description of the event and, if available, context information on the related topic.</p><p>Theme-focused Newsletters: The VoD service already sends out a daily newsletter to registered users. This newsletter contains a set of 5 movies that have a deep topical connection. This connection is represented by a motto, for example, "Directors Inspired by Quentin Tarantino" or "Dream of a Better Life". In order to build newsletter automatically, we compute the most relevant event of the day and compute related movies. In the next step we try to fill templates created for the newsletters, such as "Today is the birthday of &lt;X&gt;. His best movies here on &lt;name of the portal&gt;". Discussion The implemented system is based on components and can be easily extended by integrating additional sources or by integrating components tailored to new types of events. The service interface allows the integration in existing recommender system.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Evaluation</head><p>We analyze the recommendations computed by our system. First, we evaluate the recommendations depending on the type of event used to trigger them. Secondly, we analyze the relevance of the recommendations and the acceptance of the suggested movies. The relevance of recommendations is analyzed based on the web server log of the VoD platform (currently only using content-based item-to-item recommendations) as well as feedback from experts (curators working for the VoD portal).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Recommendations based on News</head><p>The system looks for trending topics by analyzing search log of the VoD system. Tab. 1 shows an overview of the number of events the recommender extracted based on trending topics for 9 days in January 2015. Analyzing detected events reveals that several trends in news feeds are correlated with "static" events. After the death of a popular actor, the time-series of mentions of that actor oftentimes spikes to an all-time high indicating that people are generally interested in this type of event. For other events, for example festivals and awards ceremonies, the number of mentions of the event increases during certain points in time. Awards ceremonies are often mentioned shortly after nominees for prices are announced, during the award ceremony itself, and for a short period of time after the event, then oftentimes together winners of awards. Overall 20% of detected trends can be linked to "static" events. However, due to the large number of stored events, only 5% of events are covered by trends. Presenting trends together with a recommended movie proves to be difficult, if no knowledge is available on what event triggered the trend. Test users of our web application reacted positively to the most-popular approach, e.g. presenting the tweet with the highest "favorite" count.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Recommendations based on Static Events Holidays and memorial days days such as</head><p>Veterans Day or Mother's Day are linked to movies based on the similarity between the description of the holiday and the list of assigned term (retrieved from DBPEDIA) and the movie description. In our scenario, we considered 706 holidays related to at least one of the movies in our catalog. Analyzing the impact of these days on the user behavior, we observed a high variance for country-specific holidays: Displaying the trigger event together with recommended movie caused users to click 8 times more often. Confessional holidays increased clicks only by a factor of 1.7, while international holidays and memorial days increased clicks by a factor of 2.4. Our birthday database contains 2,570 entries listing on average 7.02 birthdays per day. These events are related to 3,291 distinct movies. Tab. 1 shows the statistic of relevant birthdays for the first days in January 2015. In order to evaluate the relevance of computed recommendations we check the recommendations against the spikes in the web server log. We found that 23% of recommendations derived from birthdays could be recognized by an increased movie related activity in the log file. In this paper we present our system providing topical film recommendations based on different types of events. We discussed how to detect potentially relevant events from news and social media streams as well as the integration of semantic knowledge sources. In our analysis we found that birthdays of artists have only a very small influence on the user behavior. Events detected in news streams are better suited for recommending movies.</p><p>In contrast to traditional CF-based approaches, the developed approach helps users to discover new films. The relevance of suggestions is based on the similarity with current events instead of the similarity with entries in the user profile. We currently work on two personalization approaches. We combine the relevance scores computed using collaborative filtering ensuring that the identified events are matching the individual user preferences. In addition, we plan to allow users to add own sources ( feeds). This ensures that the news streams providing the basis for recognizing the relevant event meet the user needs.</p><p>Furthermore, we work on combining Named Entity Recognition algorithms and similarity computations based on semantic graphs for detecting movies related to current news. The weighted aggregation of several different relevance measures ensures a higher significance of recommended movies and provides the basis for more detailed explanations. The presented concept for recommending movies can be easily adapted for many additional scenarios, such as online shops. The use of the recent news (or weather data) is a promising new paradigm providing relevant recommendations without requiring detailed user profiles. A careful selection of sources analyzed for detecting events ensures that the recommendations are relevant for specific target groups. Based on the feedback we received for the implemented prototype there is a high potential in this approach.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .</head><label>1</label><figDesc>Fig. 1. The main components of our recommender system.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>The statistic of events recognized in news and semantic data.</figDesc><table><row><cell></cell><cell cols="3">number number example person</cell><cell>number of</cell><cell cols="3">number number example</cell><cell>number of</cell></row><row><cell></cell><cell>of</cell><cell>of</cell><cell>related to</cell><cell>films related</cell><cell>of</cell><cell>of</cell><cell>person</cell><cell>films related</cell></row><row><cell></cell><cell cols="3">relevant related one of the</cell><cell cols="4">to the example relevant related whose birthday</cell><cell>to this</cell></row><row><cell>date</cell><cell>trends</cell><cell>films</cell><cell>trending topics</cell><cell>person</cell><cell cols="3">birthdays films this is</cell><cell>person</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_0">Jan 1, 2015  </note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Acknowledgments The work has been partially done in the EEGoF project supported by the German Federal Ministry for Economic Affairs and Energy. The research leading to these results was performed in the CrowdRec project, which has received funding from the EU 7th Framework Programme FP7/2007-2013 under grant agreement No. 610594.</p></div>
			</div>

			<div type="annex">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Death-Days: Compare to birthdays, our database provides a significant smaller number of dates of death. The dataset contains 581 entries covering 286 days of the year. These events are related to 729 distinct movies. Similar to the birthday recommender, most death-days are not recognizable as peaks in the web server log. The death of a person (detected in the news stream) results in an increased user interest. The dates of death retrieved from DBPEDIA relate to dates several years in the past. This explains the different impact of death dates retrieved from the semantic database from death dates detected in the news.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Discussion</head><p>We showed that our approach allows us to provide useful recommendations without having access to user profiles. The impact of the recommendations depends on the type of the identified event. In general, the relevance of dynamically recognized events (death of an actor, an award won by an actor) is more relevant than "static" events retrieved from a knowledge data base. "Big" birthdays of popular persons are more relevant than "usual" birthdays. Nevertheless "static" events are valuable since these events ensure that we reliably provide a fixed number of recommendations and diversify the result set.</p><p>Recommending movies based on events is often unexpected to users. In our discussions with users and the experts from the VoD portal we got positive feedback for the approach. In order to accept the recommendations it is important that users know or at least are interested in the events because the relevance of the events is crucial for the acceptance of the movie recommendations. On the other hand, our approach helps users to discover new content by recommending items based on events users usually would not be aware of.</p></div>			</div>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">A collaborative filtering approach to mitigate the new user cold start problem</title>
		<author>
			<persName><forename type="first">J</forename><surname>Bobadilla</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ortega</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hernando</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bernal</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Know.-Based Syst</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="page" from="225" to="238" />
			<date type="published" when="2012-02">Feb. 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">From classification to quantification in tweet sentiment analysis</title>
		<author>
			<persName><forename type="first">W</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Sebastiani</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Social Network Analysis and Mining</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="22" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">SPIGA -multilingual news aggregator</title>
		<author>
			<persName><forename type="first">L</forename><surname>Hennig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Ploch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Prawdzik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Armbruster</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Düwiger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">W</forename><surname>De Luca</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Albayrak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Procs. of GSCL 2011</title>
				<meeting>s. of GSCL 2011</meeting>
		<imprint>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Evaluating collaborative filtering recommender systems</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">L</forename><surname>Herlocker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Konstan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">G</forename><surname>Terveen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">T</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Inf. Syst. (TOIS)</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="5" to="53" />
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Context-aware event recommendation in event-based social networks</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Q</forename><surname>Macedo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">B</forename><surname>Marinho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Santos</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Procs. of the 9th ACM RecSys Conf</title>
				<meeting>s. of the 9th ACM RecSys Conf<address><addrLine>NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Item popularity and recommendation accuracy</title>
		<author>
			<persName><forename type="first">H</forename><surname>Steck</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Procs. of the 5th ACM Conf. on Recommender Systems</title>
				<meeting>s. of the 5th ACM Conf. on Recommender Systems<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="125" to="132" />
		</imprint>
	</monogr>
</biblStruct>

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