<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Representing Perceptual Product Features in Databases</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joachim Selke Institut für Informationssysteme</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Technische Universität Braunschweig Braunschweig</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <fpage>13</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>Many modern goods have both factual and perceptual features. While factual features such as technical specifications can easily be handled by existing database technology, perceptual features such as design or usage experience are very hard to deal with. However, with the huge success and growing market share of online shopping, retailers face the need to provided detailed and structured information about perceptual product features to their customers. In this paper, we analyze why dealing with perceptual product features in databases is difficult and summarize our current efforts on tackling this problem.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Marketing theory distinguishes between two types of product
features: Factual and perceptual ones [
        <xref ref-type="bibr" rid="ref4 ref8">4, 8</xref>
        ]. Factual features are those
that can easily be named and specified. Typical factual features
are technical specifications (e.g., length, height, and weight) and
traditional publication metadata (e.g., authors, number of pages and
year of publication). Perceptual features are those that usually are
hard to describe and tend to involve an emotional reaction or
physical contact to the respective product. Typical perceptual features
are artistic or stylistic properties such as the mood of songs, the
sophistication of novels, and the character depth in movies.
      </p>
      <p>While factual product features can easily be represented and
managed by existing database technology (e.g., by introducing a
database attribute per feature), working with perceptual product
features is much more complicated. This is mainly because
perceptual features tend to be vague and defy precise definitions (e.g. the
borders of literary genres). However, paradoxically, there are
established ways to express perceptual features using natural language
(e.g., sporty car or clunky cell phone), which surprisingly mostly are
not a matter of taste but are based on general agreement. Therefore,
we strongly believe that established database technology is indeed
able and suited to store, process, analyze, and answer queries based
on perceptual product features. We just have to find out how this
can be done in practice.</p>
      <p>In this paper, we survey existing approaches to handling
perceptual product features in databases, point out their limitations, and
summarize our own recent work towards solving this problem. In
particular, we present a series of use cases illustrating the benefits
of our approach.</p>
      <p>
        In this following, we use movies as a running example. Movies
are particularly suited for this task as they appeal to a wide range
of people and provide a large variety of both factual and perceptual
features. In addition, movies perfectly illustrate the problem of
lacking support for perceptual features in databases: It has been
shown that, when selecting movies, consumers rely far more on
perceptual movie features (funny, romantic, scary, . . . ) than factual
ones (actors, directors, release year, . . . ) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. However, the ideas
and results presented in this paper can easily be transferred to other
types of products.
2.
      </p>
    </sec>
    <sec id="sec-2">
      <title>EXISTING APPROACHES</title>
      <p>In this section, we take a close look at existing approaches to
handling perceptual product features in information systems. We
identified three different groups of approaches: those based on
explicit data provided by experts, those based on textual data provided
by users, and special-purpose approaches that implicitly deal with
perceptual product features. In addition, in domains where
products can be represented in digital form (e.g., music or movies),
(low-level) features can be extracted automatically.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Explicit Modeling by Experts</title>
      <p>
        Besides the traditional classification of movies into a small
number of major genres [
        <xref ref-type="bibr" rid="ref2 ref9">2, 9</xref>
        ], many movie databases recently adopted
more refined classification schemes. While some just introduced a
larger number of possible genres (e.g., the rental service Netflix1
expanded its simple genre list into a taxonomy covering 485
genres), others decided to describe movies using generally applicable
description attributes. Popular examples are the metadata provider
AllMovie2, which classifies its 440,000 movies with respect to more
than 5,000 different moods, themes, tones, and types (e.g., Ensemble
Film, Haunted By the Past, and Intimate), and the recommendation
service Clerkdogs3, which rates each movie with respect to 37
different attributes (e.g., Character Depth, Geek Factor, and Violence)
on a 12-point scale. Essentially, all these approaches try to
capture a movie’s perceptual features by means of a set of predefined
databases attributes, which can either contain binary values (as in
AllMovie) or numbers (as in Clerkdogs).
      </p>
      <p>Although this approach looks rather straightforward and seems
to be easy to implement in practice, it comes with many problems.
First of all, clearly identifying and narrowing down the most relevant
1http://www.netflix.com
2http://www.allmovie.com
3http://www.clerkdogs.com
individual perceptual features tends to be difficult. However, even if
a comprehensive and generally understandable classification system
has been developed and experts have been trained how to use it
correctly and consistently, manually classifying all movies is a huge
amount of work.</p>
      <p>
        An even worse problem is the actual consistency of these movie
classifications. We recently compared the genre judgments made by
three major movie databases and found that the agreement among
them is moderate at best, being just slightly less directed towards
to completely random genre assignments than to perfect agreement
[
        <xref ref-type="bibr" rid="ref12 ref13">11, 12</xref>
        ]. As we restricted our analysis only to the most popular
movie genres, even worse results can be expected for less established
and/or more complex classification schemes.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Textual Descriptions by Users</title>
      <p>An alternative approach to making perceptual movie features
available to movie databases has been adopted by movie portals
such as the Internet Movie Database4 (IMDb) or Rotten Tomatoes5
(RT). Instead of trying to represent movies in a structured fashion
by means of explicit database attributes, they focus on textual
descriptions, usually in the form of reviews provided by arbitrary users
(IMDb) or (semi-)professional critics (RT).</p>
      <p>Although textual descriptions give users a comprehensive and
helpful characterization of each individual movie, it is difficult
to search for movies or provide targeted movie recommendations
given only textual data. One the the rare services offering movie
search based on movie reviews is Nanocrowd6, which applies
information retrieval methods to extract so-called nanogenres from
textual data. Each movie is characterized by a set of nanogenres,
where each nanogenre is represented by a three-word group (e.g.,
sports/ballpark/loves or chemistry/adorable/formulaic). However,
these nanogenres tend to be much less informative and
understandable than explicit database attributes that have been manually created
by experts.</p>
      <p>Another drawback of text-based movie descriptions is the lack
of data. While blockbusters are commented by a large number
people, less popular movies often receive just a very small number
of reviews, which tend to provide only a partial movie description
and are too short to effectively apply methods of text analysis.
2.3</p>
    </sec>
    <sec id="sec-5">
      <title>Implicit Modeling for Special Purposes</title>
      <p>
        The third major approach is collaborative filtering as used in the
area of recommender systems [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Here, the only data available
about movies are numerical ratings provided by users (e.g., on a
scale ranging from one to five stars), where each user assigns just a
single number to each movie he rated. As rating movies is an almost
effortless task, usually there is a large number of ratings from many
different users available. For example, in IMDb, there are about
a hundred times more ratings than reviews, while even relatively
unknown movies still receive a substantial number of ratings.
      </p>
      <p>So far, this kind of data has only been used for special problems
such as similarity search (finding those movies that are most similar
to a given one) or recommendations (providing a list of movies
that are likely to appeal to a given user). Here, the basic idea is to
analyze the ratings for systematic patterns indicating similar taste
across a group of users or similar properties in a group of movies.
For example, to provide recommendations to some user u, one might
first look for other users who rated most of the movies rated by u in
a similar way, and then recommend those movies to u that have been</p>
      <sec id="sec-5-1">
        <title>4http://www.imdb.com 5http://www.rottentomatoes.com 6http://www.nanocrowd.com</title>
        <p>liked by most of these other users. In a way, movie features and user
tastes are modeled implicitly when using collaborative filtering.</p>
        <p>
          Recently, a series of recommendation algorithms has been
developed that try to decompose the rating matrix (movies are rows,
users are columns, and ratings are entries) into the product of two
smaller matrices [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. These so-called factor models have an
important by-product, which usually is neglected by recommendation
algorithms: the representation of each movie as points in some
abstract coordinate space. Here, movies with similar coordinates
tend to be rated similarly by different users, whereas users with very
different coordinates tend to be perceived very differently. From
this perspective, one can think of these coordinates as a embedding
of movies into some abstract semantic space.
        </p>
        <p>
          Our own analysis of the semantic spaces produced by recent
recommender algorithms showed that these spaces indeed capture
major perceptual features of movies [
          <xref ref-type="bibr" rid="ref10 ref12 ref13">10, 11, 12</xref>
          ]. However, the main
problem of semantic spaces hindering their use for general purpose
database applications is the total lack of intuitive understandability.
To illustrate this problem, Table 1 show the first three dimensions of
a 100-dimensional semantic space extracted from the Netflix Prize
ratings data set7 (about 20k movies, 500k users, and 100M ratings).
For each dimension, we listed the those popular movies that received
the five highest and five lowest scores with respect to this dimension.
Clearly, these axes do not offer any intuitive interpretation. However,
the relative positions in semantic spaces are indeed meaningful. To
give an example, Table 2 shows the five nearest neighbors of three
popular movies.
2.4
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Content-Based Feature Extraction</title>
      <p>In some domains, one can provide a (near-)complete description
of each product in digital form. Prime examples are images, music,
and movies. In these cases, it is possible to automatically derive
so-called low-level features from the products itself, thus avoiding
any dependence on external product descriptions. For example,
common low-level features of images are color histograms,
symmetry properties, and measures for contrast. Low-level features are
contrasted by high-level features (concepts), which describe those
aspects of content objects a user is interested in.8 For example,
high-level features of images are the types of objects (sun, beach,
mother, child, . . . ), events (playing, talking, . . . ), or abstract
concepts (family, fun, . . . ) associated with a photo. The multimedia
content description standard MPEG-7 defines a large number of
lowlevel features and also provides a language to annotate multimedia
content with custom-defined high-level features.</p>
      <p>
        In state-of-the-art content-based multimedia retrieval systems,
low-level features are usually extracted automatically from the
available content, whereas the use of high-level features tends to require
a significant amount of human interaction. Although there are initial
approaches to automatically derive selected high-level features from
low-level features, there is still a large discrepancy between the
limited information that one can extract from the available multimedia
data and the interpretation that the same data has for users [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This
problem is usually referred to as semantic gap.
      </p>
      <p>When comparing content-based feature extraction to the three
approaches discussed previously, we see that low-level features loosely
correspond to semantic spaces and high-level features to explicitly
modeled attributes. However, there are important differences:</p>
      <p>As low-level features must be extracted by means of
spe</p>
      <sec id="sec-6-1">
        <title>7http://www.netflixprize.com</title>
        <p>
          8Sometimes, the distinction into low-level and high-level features
is refined to a 10-layer pyramid structure for classifying different
feature types of multimedia content [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
cialized extraction algorithms, they are tied to a particular
representation of the original content. Consequently,
lowlevel features extracted from images cannot be compared to
low-level features extracted from songs. In contrast, semantic
spaces are derived from user feedback which can be provided
for any product type in the same way, thus enabling the direct
comparison of images and music. In addition, the design of
effective low-level extraction algorithms is a complex task,
which must be hand-crafted for each product domain under
consideration.
        </p>
        <p>Semantic spaces are derived directly from human feedback
(e.g., star ratings), which is turn is based on the most
relevant perceptual product properties. Low-level features only
capture statistical properties of the data representation such
as color histograms. Therefore, the semantic gap between
semantic spaces and user perception can be expected to be
lower than the semantic gap present in current content-based
multimedia retrieval systems.</p>
        <p>For these reasons, we decided to put aside content-based
feature extraction for the moment and focus on the three remaining
approaches discussed above. However, in future work we plan to
compare the ideas presented in this paper to existing methods from
content-based multimedia retrieval where this is possible.
2.5</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Conclusion</title>
      <p>We can draw the following conclusions from the findings
presented in this section:</p>
      <p>Modeling perceptual movie features by explicit attributes
requires a huge amount of manual work but still leads to data
of questionable quality. However, users can easily understand
the meaning of these attributes.</p>
      <p>Capturing perceptual movie features by means of textual
descriptions is helpful for users when looking for information
about each individual movie. However, this kind of data is
difficult to process automatically, cannot be understood as
easily as explicit attributes, and the amount of available data
is scarce for less popular movies.</p>
      <p>Semantic spaces created from a large number of user-provided
ratings capture major perceptual features of movies. However,
semantic spaces as such do not offer any intuitive
interpretation and thus cannot be used to communicate with users.
3.</p>
    </sec>
    <sec id="sec-8">
      <title>PROPOSED SOLUTION</title>
      <p>At first view, the result of our above analysis is rather
disillusioning. Intuitively understandable models of perceptual movie
properties are expensive to create and lack data quality, semantically
meaningful models cannot be understood, and the third option seems
to combine both disadvantages.</p>
      <p>
        However, there is still hope. In [
        <xref ref-type="bibr" rid="ref12">11</xref>
        ] we introduced a data model
that tries to combine the strengths of the approaches mentioned
above. To be more precise, we propose to represent each movie by
three different types of database attributes:
      </p>
      <p>A. attributes describing factual movie properties,
B. attributes making a selected number of perceptual properties
explicit (manual classification), and
C. attributes containing the movie’s coordinates in some
semantic space.</p>
      <p>
        This approach brings several advantages. Probably most
important is that the three different types of attributes can work together to
reduce the weaknesses of each of them. In the following, we show a
series of examples illustrating this idea (for technical details, please
see [
        <xref ref-type="bibr" rid="ref12">11</xref>
        ]).
      </p>
      <p>Enhancing the data quality in type-B attributes.</p>
      <p>By aligning the manual classification of movies as expressed in
type-B attributes to the semantic space, we are able to detect are
large number of possibly misclassified movies. The basic idea is
that movies that are classified into the same category should also
be located close together in the semantic space. If we find a movie
m that has the same value with respect to some type-B attribute but
is very different from other movies having this value with respect
to the semantic space, then m is likely to be misclassified by the
experts. By identifying such movies and giving human experts</p>
      <sec id="sec-8-1">
        <title>Drama Romance Spor t</title>
      </sec>
      <sec id="sec-8-2">
        <title>Action Adventure Mystery Sci-Fi</title>
        <p>
          a chance carefully re-check problematic movies, the data quality
can be increased. In our experiments on genre classifications [
          <xref ref-type="bibr" rid="ref12">11</xref>
          ],
we have been able to detect possibly misclassified movies with
a mean precision of about 55% and a mean recall of about 25%,
which is significantly better than drawing random samples (the only
alternative approach available). In summary, with the help of type-C
attributes we are able to reduce a significant weakness of type-B
attributes (data quality).
        </p>
        <p>Saving manual work in creating type-B attributes.</p>
        <p>
          To significantly reduce the amount of work required to manually
classify all movies with respect to the type-B attributes, automatic
classification can be applied. Here, given a binary type-B attribute
(e.g., the genre Action), a human experts provides a small number
(e.g., 10) of clearly positive examples (i.e., typical Action movies)
and the same number of clearly negative examples (i.e., obvious
non-Action movies). Using a support vector machine classifier that
categorizes all remaining movies based on the training data and the
type-C semantic space representation of movies, we have been able
to produce results being only of slightly lower quality than those
created by human experts [
          <xref ref-type="bibr" rid="ref12">11</xref>
          ]. By means of the method described
previously, the data quality can easily be increased incrementally.
In summary, with the help of type-C attributes we are able to reduce
another significant weakness of type-B attributes (amount of work).
Enriching type-B attributes.
        </p>
        <p>
          Again, by comparing type-B attributes to the semantic space
represented by type-C attributes we are able to determine to what degree
a type-B attribute value applies to each movie. For example, IMDb
only assigns binary genre judgments to its movies, which leads
to the classification Drama/Romance/Sport for the movie Rocky
(1976) and Action/Adventure/Mystery/Sci-Fi for the movie Star
Trek (1976). Although this classification is justified, there are
several problems: Rocky contains romantic elements but it is a highly
untypical Romance movie. It is most well-known for being a typical
sports movie with dramatic activities. Similarly, Sci-Fi is widely
recognized as Star Trek’s most prominent genre, while it is a rather
untypical Mystery movie. By analyzing the semantic space for
where typical movies of genre X are located, we are able to judge
how typical an assigned genre for each movie really is. To illustrate
this, Figure 1 depicts a “genre clouds” for the above two movies. We
automatically generated it from IMDb’s binary genre assignments
(type B) in combination with a semantic space extracted from ratings
(type C) [
          <xref ref-type="bibr" rid="ref12">11</xref>
          ].
        </p>
        <p>Enabling conceptual queries.</p>
        <p>
          When describing their movie preferences, users often refer to
factual movie properties as means attributes that approximately
characterize an intuitive concepts that they are unable to express
otherwise. For example, movies in the style typically associated
with the director Quentin Tarantino could be called Tarantino-ish
movies. In fact, Google counts 4530 Web pages mentioning this
term. We refer to database queries in this style as conceptual queries.
We are able to answer such queries by first finding out where movies
directed by Quentin Tarantino are typically located in the semantic
space (by identifying a small continuous region in space), and then
looking for other movies that are located close to the center to this
region. By applying a simple weighting scheme, we are able to
produce a, say, top-10 list of the most Tarantino-ish movies. To
give an example, Table 3 shows our results for Tarantino and two
popular actors. Here, we used a support vector machine to learn
where movies directed by Tarantino tend to be located in semantic
space and used this information to find very similar movies that have
not been directed by Tarantino [
          <xref ref-type="bibr" rid="ref12">11</xref>
          ]. Apart from minor exceptions
(in particular, The Professional and Dragon: The Bruce Lee Story),
these results look very promising. In summary, we have been able to
understand users’ implicit concepts by of mapping type-A attributes
to the semantic space.
4.
        </p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>CONCLUSION AND OUTLOOK</title>
      <p>In this paper, we have discussed the problem of representing
perceptual product features in databases. We concluded that each
existing approach alone does not provide an acceptable solution to
this problem as it comes with severe disadvantages. However, by
combining several methods into a joint data model, we have been
able to reduce the weaknesses of each individual approach and boost
its strengths. Our examples show promising results, which we are
going to analyze in detail in future work. In addition, as already
indicated in Section 2.4, we plan to compare our work to approaches
from content-based multimedia retrieval. For example, for genre
classification tasks, it would be interesting to compare semantic
spaces derived from ratings to low-level features extracted from the
actual movies.
Tarantino-ish</p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgments</title>
      <p>I am very grateful to Prof. Dr. Wolf-Tilo Balke for providing
valuable guidance and supervising my doctoral thesis, which will be
based partly on the work presented in this paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <article-title>Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>17</volume>
          (
          <issue>6</issue>
          ):
          <fpage>734</fpage>
          -
          <lpage>749</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chandler</surname>
          </string-name>
          .
          <article-title>An introduction to genre theory</article-title>
          ,
          <year>1997</year>
          . Available from http://www.aber.ac.uk/media/Documents/intgenre.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Cooper-Martin</surname>
          </string-name>
          .
          <article-title>Consumers and movies: Some findings on experiential products</article-title>
          .
          <source>In Advances in Consumer Research</source>
          , volume
          <volume>18</volume>
          , pages
          <fpage>372</fpage>
          -
          <lpage>378</lpage>
          .
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Hirschman</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. B.</given-names>
            <surname>Holbrook</surname>
          </string-name>
          .
          <article-title>Hedonic consumption: Emerging concepts, methods and propositions</article-title>
          .
          <source>Journal of Marketing</source>
          ,
          <volume>46</volume>
          (
          <issue>3</issue>
          ):
          <fpage>92</fpage>
          -
          <lpage>101</lpage>
          ,
          <year>1982</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Jörgensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaimes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Benitez</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.-F.</given-names>
            <surname>Chang</surname>
          </string-name>
          .
          <article-title>A conceptual framework and empirical research for classifying visual descriptors</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          ,
          <volume>52</volume>
          (
          <issue>11</issue>
          ):
          <fpage>938</fpage>
          -
          <lpage>947</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Bell</surname>
          </string-name>
          .
          <article-title>Advances in collaborative filtering</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <fpage>145</fpage>
          -
          <lpage>186</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Lu, and W.-Y. Ma.
          <article-title>A survey of content-based image retrieval with high-level semantics</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>40</volume>
          (
          <issue>1</issue>
          ):
          <fpage>262</fpage>
          -
          <lpage>282</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Nelson</surname>
          </string-name>
          .
          <article-title>Information and consumer behavior</article-title>
          .
          <source>Journal of Political Economy</source>
          ,
          <volume>78</volume>
          (
          <issue>2</issue>
          ):
          <fpage>311</fpage>
          -
          <lpage>329</lpage>
          ,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Preston</surname>
          </string-name>
          .
          <article-title>Film genres</article-title>
          . In W. Donsbach, editor,
          <source>The International Encyclopedia of Communication. Blackwell</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Selke</surname>
          </string-name>
          and W.-T. Balke.
          <article-title>Extracting features from ratings: The role of factor models</article-title>
          .
          <source>In Proceedings of M-PREF</source>
          <year>2010</year>
          , pages
          <fpage>61</fpage>
          -
          <lpage>66</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Universal</given-names>
            <surname>Soldier</surname>
          </string-name>
          (
          <year>1992</year>
          )
          <string-name>
            <surname>Commando</surname>
          </string-name>
          (
          <year>1985</year>
          )
          <article-title>Missing in Action (1984) Red Heat (</article-title>
          <year>1988</year>
          )
          <article-title>Raw Deal (</article-title>
          <year>1986</year>
          )
          <string-name>
            <surname>Bloodsport</surname>
          </string-name>
          (
          <year>1988</year>
          )
          <article-title>The Last Boy Scout (</article-title>
          <year>1991</year>
          )
          <article-title>The Running Man (</article-title>
          <year>1987</year>
          )
          <string-name>
            <surname>Kickboxer</surname>
          </string-name>
          (
          <year>1989</year>
          )
          <article-title>The Delta Force (</article-title>
          <year>1986</year>
          )
          <article-title>True Romance (</article-title>
          <year>1993</year>
          )
          <article-title>GoodFellas (</article-title>
          <year>1990</year>
          )
          <article-title>The Usual Suspects (</article-title>
          <year>1995</year>
          )
          <string-name>
            <surname>Casino</surname>
          </string-name>
          (
          <year>1995</year>
          )
          <string-name>
            <surname>Desperado</surname>
          </string-name>
          (
          <year>1995</year>
          )
          <article-title>The Professional (</article-title>
          <year>1994</year>
          )
          <article-title>Killing Zoe (</article-title>
          <year>1994</year>
          )
          <article-title>Full Metal Jacket (</article-title>
          <year>1987</year>
          )
          <article-title>2 Days in the Valley (</article-title>
          <year>1996</year>
          )
          <string-name>
            <surname>Go (1999) EDtv (1999) Innerspace</surname>
          </string-name>
          (
          <year>1987</year>
          )
          <string-name>
            <surname>Bedazzled</surname>
          </string-name>
          (
          <year>2000</year>
          )
          <article-title>Cadillac Man (</article-title>
          <year>1989</year>
          ))
          <article-title>Pleasantville (1998) Dragon: The Bruce Lee Story (</article-title>
          <year>1993</year>
          )
          <article-title>Honey, I Shrunk the Kids (1989) Alive (1993) Shallow Hal (</article-title>
          <year>2001</year>
          )
          <string-name>
            <surname>Punchline</surname>
          </string-name>
          (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Selke</surname>
          </string-name>
          and W.-T. Balke. TEAMWORK:
          <article-title>A data model for experience products</article-title>
          .
          <source>ifis technical report, Institut für Informationssysteme at Technische Universität Braunschweig</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Selke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Homoceanu</surname>
          </string-name>
          , and W.-T. Balke.
          <article-title>Conceptual views for entity-centric search: Turning data into meaningful concepts</article-title>
          .
          <source>In Proceedings of BTW 2011</source>
          , pages
          <fpage>327</fpage>
          -
          <lpage>346</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>