<?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">Employing User-Generated Tags to Provide Personalized as well as Collaborative TV Recommendations</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Andreas</forename><surname>Thalhammer</surname></persName>
							<email>andreas.thalhammer@sti2.at</email>
						</author>
						<author>
							<persName><forename type="first">Günther</forename><surname>Hölbling</surname></persName>
							<email>hoelblin@fim.uni-passau.de</email>
						</author>
						<author>
							<persName><forename type="first">Dieter</forename><surname>Fensel</surname></persName>
							<email>dieter.fensel@sti2.at</email>
						</author>
						<author>
							<affiliation key="aff0">
								<orgName type="institution">Semantic Technology Institute</orgName>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="institution">University of Innsbruck Technikerstraße</orgName>
								<address>
									<postCode>21a, 6020</postCode>
									<settlement>Innsbruck</settlement>
									<country key="AT">Austria</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<orgName type="department">Chair of Distributed Information Systems</orgName>
								<orgName type="institution">University of Passau</orgName>
								<address>
									<addrLine>Innstraße 43</addrLine>
									<postCode>94032</postCode>
									<settlement>Passau</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff3">
								<orgName type="institution">Semantic Technology Institute</orgName>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff4">
								<orgName type="institution">University of Innsbruck Technikerstraße</orgName>
								<address>
									<postCode>21a, 6020</postCode>
									<settlement>Innsbruck</settlement>
									<country key="AT">Austria</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Employing User-Generated Tags to Provide Personalized as well as Collaborative TV Recommendations</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">E5C06EC242F6CC6ADC8EB9B7D005F0D6</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T01:23+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>H</term>
					<term>3</term>
					<term>3 [INFORMATION STORAGE AND RETRIEVAL]: Information Search and Retrieval-Information filtering; H</term>
					<term>5</term>
					<term>1 [INFORMATION INTERFACES AND PRESENTA-TION]: Multimedia Information Systems HUMAN FACTORS, MEASUREMENT</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Within the Web, the annotation of content has become a common way to provide efficient navigation and recommendation of resources. In the future, TV sets with integrated Web capabilities will offer tagging as a tool for content organization in the realm of home entertainment. The recommendation of TV content is a challenging task as a system has to consider each user's individual preferences without getting too specific. We present a strategy which employs user-generated tags in a flexible way to address this issue. Our approach provides two different ways of semantic ranking for TV program lists: The first allows a higher ranking of programs that fit well to the user's personal likings. The second introduces collaborative aspects and therefore promotes a community-driven approach rather than an individual way of recommendation.</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>In recent years, the fusion of television and the Web has already begun. In this context, the integration of content from the Web into television and vice versa are two important and not yet completed tasks. Considering the characteristics of both information sources, the following turns out: while television is consumed mostly passively, Web content usually offers a high degree of user interaction. However, in the next years, this distinction will become more and more blurred. In particular, television will offer common ways of interaction that are currently only well known from the Web, especially social annotation of content.</p><p>Our approach applies user-generated tags in order to provide recommendation of TV content. As a result of an information filtering process, we provide two rankings of a program list, each of which is based on the same databut employs different ways of user modeling. The personalized ranking focuses on the semantic similarity between the user's preferences for certain tags and the annotations of upcoming programs. The collaborative ranking measures the similarity between tag clouds in the same way, but from a community point of view as it considers tags from other users as well.</p><p>Both approaches are meant to address the problem of overspecialization (that occurs in solely content-based systems <ref type="bibr" target="#b0">[1]</ref>) through social discovery: tags are user-generated and describe the semantics of an item. As a matter of fact, the semantics of a TV program do not necessarily correlate with the descriptions from the metadata.</p><p>Note that, in this paper, the terms "personalized" and "collaborative" are used in the context of social annotation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">TAG-BASED TV RECOMMENDATION</head><p>The field of recommendation uses two common kinds of ratings, implicit (extracted from user transactions) and explicit (the user is explicitly asked) ones <ref type="bibr" target="#b0">[1]</ref>. As for the latter, instead of using the common numerical ratings, Sen et al. <ref type="bibr" target="#b3">[4]</ref> suggest using tags in order to provide a more individual and accurate way of expressing what users like about a specific item. Thus, by employing tags, we switch from the "degree of the user's preference" point of view to the level of "what actually are the user's preferences (in her own words)".</p><p>In <ref type="bibr" target="#b4">[5]</ref>, it is suggested that resource recommendation should be performed by applying traditional collaborative filtering methods on user-item, user-tag, and item-tag datasets. In our system we refine this idea for the television domain by focusing on the item-tag data in combination with different representations of a single user profile.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1">Input data</head><p>As input for the recommendation approach, we consider two entities: The first is an upcoming program, which has not been tagged yet. The second is a user profile that contains the history of previously watched programs along with the tags assigned by the users.</p><p>Finding tags for an upcoming program, which is a candidate for recommendation, is a non-trivial task as users commonly assign tags after and not before media consumption. There exist various options to tackle this problem: Keywords can be extracted from the program descriptions (as it is done by tvister 1 ) and reused as tags. Furthermore, a professional team could tag upcoming programs in advance. It is clear that the creation of tag clouds in both of these ways differs from the dynamic process of community tagging. In <ref type="bibr" target="#b1">[2]</ref>, we found a feasible way to address this issue by applying a machine learning approach in combination with a client-server architecture. We use this approach in order to provide an efficient prediction of tags that are very similar to the ones that real users assign. Table <ref type="table" target="#tab_0">1</ref> exemplifies the result of our tag prediction step by showing generated tags and their weights for three TV programs.</p><p>For the personalized and the collaborative part of recommendation, we use two different representations of the same user profile (containing the tagging history). To accentuate this, we refer to table 2, which shows a small user profile that is present in our dataset <ref type="bibr" target="#b1">[2]</ref>. The tag cloud of each TV program contained in the user history is presented in different ways. The personalized approach does not consider tags from other users, but only the ones the current user assigned. This results in a binary representation, as a user either assigns a particular tag for a program, or not. To address this issue, we weight each tag by the user's individual preference for it (total number of usages in her profile). An example is provided by the left side of table 2. The collaborative approach incorporates the tags of all users that annotated one specific program and weights each tag by its total number of usages for a specific program. This way of presenting tag clouds is the most common one within the Web. The right column of table 2 exhibits an example of this notation.</p><p>The comparison of upcoming programs with the personalized version of the user profile and also with the collaborative one, results in two different program rankings.</p><p>In the following, we refer to the user profile as either the personalized or the collaborative representation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2">Similarity Measure</head><p>A similarity measure is used to compare the tag clouds of the programs in the user profile to the ones of the upcoming programs. We represent tag clouds as vectors in a similar way as items are represented as vectors of user ratings in the collaborative filtering domain <ref type="bibr" target="#b0">[1]</ref>: each dimension represents a single tag and each entry denotes the respective weight. These vectors can be compared to each other by measuring their degree of similarity. With the use of generated tags </p><p>[2] we discovered a discrepancy between the tag weights of the upcoming programs (predicted) and the ones of the programs in the user profiles (accumulated). This deviation is related to the different perception of the same rating scale in user-item scenarios that is explained in <ref type="bibr" target="#b2">[3]</ref>. Therefore, we decided to employ Pearson correlation as a similarity measure to mitigate this effect. For two programs p, q ∈ P , having attached the tags Tpq with the weight w, this results in the following formula:</p><formula xml:id="formula_1">sim(p, q) = 1 2     t∈Tpq (wp,t − wp)(wq,t − wq) t∈Tpq (wp,t − wp) 2 t∈Tpq (wq,t − wq) 2 + 1    </formula><p>The value wk stands for the average tag weight of the program k:</p><p>1</p><formula xml:id="formula_2">| k| t∈T k w k,t</formula><p>Note that the resulting similarity score lies between 0 and 1 with a neutral point at 0.5 and equality at 1.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3">Score Aggregation</head><p>After having measured the similarity of the new program to all programs in the user profile, we need to aggregate these scores to a final one for each upcoming program. It does not make sense to aggregate the similarity scores of all programs in the profile as users do often like more than one program genre. Hence, we only aggregate the similarity scores of the k-nearest neighbors (k-NN) in order to aim at specific genres the user prefers. This helps to obtain more accurate results as inter-genre measurements often result in a neutral similarity score that would be incorporated in every aggregation. For the aggregation of the scores of the k-NN, we use a weighted average approach with the scores The aggregated score of an upcoming program can be interpreted as the user's degree of preference for it. In our approach, this value is used to provide a ranking within the list of upcoming programs.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">PROOF OF CONCEPT</head><p>By using the upcoming programs of table 1 and the profile of table 2 as input data, we do now exemplify how the aforementioned profile representations can provide different scores and rankings. It needs to be pointed out that, for the reasons of clarity and brevity, the chosen user profile is very small (only seven tagged programs) and also the short list of upcoming programs does not relate to a real case scenario (usually more than 200 concurrent programs).</p><p>The personalized as well as the collaborative rankings, shown in table <ref type="table" target="#tab_2">3</ref>, demonstrate that a top-N recommendation is possible with only few ratings. By considering tags, similarities between TV programs can be determined although they are not strongly correlated through content or metadata. In our case, the Asterix movie nearly gets the same score (on both sides) as the upcoming Simpsons episode although it has no direct correlation (through TV metadata or content) to one of the user's previously watched programs. In contrast, the upcoming Simpson episode does have this link: the user has already watched two episodes before. Therefore the reasonably high score of the Asterix movie indicates that, even with a small profile, the use of tags as semantic descriptors might help to overcome the common problem of overspecialization. This also underlines our efforts to provide collaborative semantic tag prediction <ref type="bibr" target="#b1">[2]</ref>.</p><p>It is apparent that the ranking of the three programs in table <ref type="table" target="#tab_2">3</ref> is the same for the personalized and for the collaborative representation of the user profile. However, as the differences between the scores in both lists indicate, the ranking would strongly differ taken a larger and more realistic number of upcoming programs (&gt; 200) into account. The similarity scores of the collaborative ranking highlight the community factor of the ranking. The personalized part of the recommender system highly relies on the user's taste and therefore implements her individual preferences.</p><p>For a single top-N listing, it is possible to linearly combine both types of scores for each program.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">CONCLUSION AND OUTLOOK</head><p>This paper presents two feasible and promising approaches to provide top-N recommendations through collaborative tagging. Moreover, it is demonstrated that the utilization of user-generated tags might help to overcome the problem of overspecialization in the emergent domain of TV recommendation.</p><p>For the future work, we plan to conduct a thorough evaluation of the proposed approach that also includes a user survey. Furthermore, the similarity measurements can be enhanced through lemmatization of tags in combination with ontology matchings between tag clouds.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 :</head><label>1</label><figDesc>Predicted tags and their weights for upcoming programs.</figDesc><table><row><cell>Alarm für Cobra 11 -Die Autobahnpolizei</cell></row><row><cell>action (3.937), polizei (1.999), krimi (1.995), spannend</cell></row><row><cell>(1.990), autos (0.989), aufregend (0.898), aktion (0.896),</cell></row><row><cell>serie (0.879)</cell></row><row><cell>Asterix -Sieg über Cäsar</cell></row><row><cell>film (1.617), comic (1.613), geschichte (1.597), spielfilm</cell></row><row><cell>(0.859), spass (0.859), comik (0.859), lustig (0.859), zei-</cell></row><row><cell>chentrick (0.858)</cell></row><row><cell>Die Simpsons</cell></row><row><cell>zeichentrick (6.357), homer (3.653), comedy (3.552), kult</cell></row><row><cell>(3.535), lustig (3.434), humor (2.529), serie (1.957), car-</cell></row><row><cell>toon (1.773), simpsons (1.711), entspannung (1.549),</cell></row><row><cell>amerika (1.498), fun (0.761), marge (0.899), james brooks</cell></row><row><cell>(0.824), chillen (0.750), neue folgen (0.736), bart (0.726)</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2 :</head><label>2</label><figDesc>Two different representations of a single user profile.</figDesc><table><row><cell>Die Simpsons</cell><cell></cell></row><row><cell>comic (1), satire (2), spass</cell><cell>zeichentrick (1), satire (1),</cell></row><row><cell>(1)</cell><cell>lustig (1), comic (1), spass (1)</cell></row><row><cell>Broken comedy</cell><cell></cell></row><row><cell cols="2">fun (1), lustig (3), satire (2) fun (1), lustig (1), satire (1)</cell></row><row><cell>Navy CIS</cell><cell></cell></row><row><cell>spannend (2)</cell><cell>gerichtsmedizin (1), spannend</cell></row><row><cell></cell><cell>(1), ncis (1), navy (1)</cell></row><row><cell>Die Simpsons</cell><cell></cell></row><row><cell>cartoon (1), lustig (3)</cell><cell>cartoon (1), lachen (1), chillen</cell></row><row><cell></cell><cell>(1), lisa (1), homer (1), lustig</cell></row><row><cell></cell><cell>(1), kult (2), bart (1)</cell></row><row><cell>Stargate</cell><cell></cell></row><row><cell>sci-fi (1)</cell><cell>sci-fi (1)</cell></row><row><cell>Verführung einer Fremden</cell><cell></cell></row><row><cell>spannend (2), thriller (1)</cell><cell>spannend (1), thriller (1)</cell></row><row><cell>switch reloaded</cell><cell></cell></row><row><cell>lustig (3) , verarsche (1)</cell><cell>parodie (1), verarsche (1),</cell></row><row><cell></cell><cell>satire (1), lustig (1), tv</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3 :</head><label>3</label><figDesc>Personalized vs. Collaborative: 3-NN and the aggregated scores (gray) of the upcoming programs.</figDesc><table><row><cell></cell><cell></cell><cell></cell><cell></cell><cell>Personalized</cell><cell>Collaborative</cell></row><row><cell></cell><cell></cell><cell></cell><cell cols="2">Die Simpsons (0.677)</cell><cell>Die Simpsons (0.742)</cell></row><row><cell cols="2">Die Simpsons</cell><cell></cell><cell cols="2">switch reloaded (0.651)</cell><cell>Die Simpsons (0.702)</cell></row><row><cell></cell><cell></cell><cell></cell><cell cols="2">Broken Comedy (0.636)</cell><cell>Broken Comedy (0.611)</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell>0.655</cell><cell>0.690</cell></row><row><cell></cell><cell></cell><cell></cell><cell cols="2">Die Simpsons (0.648)</cell><cell>Die Simpsons (0.776)</cell></row><row><cell cols="3">Asterix -Sieg über Cäsar</cell><cell cols="2">Die Simpsons (0.619)</cell><cell>Broken Comedy (0.572)</cell></row><row><cell></cell><cell></cell><cell></cell><cell cols="2">switch reloaded (0.619)</cell><cell>switch reloaded (0.554)</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell>0.629</cell><cell>0.650</cell></row><row><cell></cell><cell></cell><cell></cell><cell cols="2">Navy CIS (0.679)</cell><cell>Navy CIS (0.588)</cell></row><row><cell cols="3">Alarm für Cobra 11 -</cell><cell cols="2">Verführung einer Fremden (0.659)</cell><cell>Verführung einer Fremden (0.626)</cell></row><row><cell cols="3">Die Autobahnpolizei</cell><cell cols="2">Stargate (0.499)</cell><cell>Stargate (0.499)</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell>0.623</cell><cell>0.576</cell></row><row><cell cols="5">being the weight (what results in squaring the similarity</cell></row><row><cell cols="5">scores). For the programs within the k-nearest neighbors</cell></row><row><cell cols="5">kN N ⊆ P rof ile and the upcoming program pnew this leads</cell></row><row><cell cols="3">to the following formula:</cell><cell></cell><cell></cell></row><row><cell>agg(pnew) =</cell><cell>p∈kN N</cell><cell>1 sim(pnew, p)</cell><cell>p∈kN N</cell><cell>sim(pnew, p) 2</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">tvisterhttp://www.tvister.de/</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions</title>
		<author>
			<persName><forename type="first">G</forename><surname>Adomavicius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tuzhilin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. on Knowl. and Data Eng</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="734" to="749" />
			<date type="published" when="2005-06">June 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Content-based tag generation to enable a tag-based collaborative TV-Recommendation System</title>
		<author>
			<persName><forename type="first">G</forename><surname>Hölbling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Thalhammer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Kosch</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">8th Int&apos;l Conf. on Interactive TV&amp;Video</title>
				<imprint>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="273" to="282" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Programming collective intelligence</title>
		<author>
			<persName><forename type="first">T</forename><surname>Segaran</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2007">2007</date>
			<publisher>O&apos;Reilly</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Tagommenders: connecting users to items through tags</title>
		<author>
			<persName><forename type="first">S</forename><surname>Sen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Vig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">18th Int&apos;l Conf. on World Wide Web</title>
				<imprint>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="671" to="680" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Tag-aware recommender systems by fusion of collaborative filtering algorithms</title>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">H L</forename><surname>Tso-Sutter</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">S.-T</forename><surname>Lars</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. of the 2008 ACM symposium on Applied computing, SAC &apos;08</title>
				<meeting>of the 2008 ACM symposium on Applied computing, SAC &apos;08</meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page" from="1995" to="1999" />
		</imprint>
	</monogr>
</biblStruct>

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