<!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>Data mining, interactive semantic structuring, and collaboration: A diversity-aware method for sense-making in search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mathias Verbeke</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bettina Berendt</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Siegfried Nijssen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, K.U. Leuven</institution>
          ,
          <addr-line>B-3001 Heverlee</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We present the Damilicious method and tool which help users in sense-making of the results of their literature searches on the Web: on an individual level, by supporting the construction of semantics of the domain described by their search term, and on the collective level, by encouraging users to explore and selectively re-use other users' semantics. We use a combination of clustering, classification and interactivity to obtain and apply diverse semantics of thematic areas, and to identify diversity between users. This tool can help users take different perspectives on search results and thereby reflect more deeply about resources on the Web and their meaning. In addition, the method can help to develop quantitative measures of diversity; we propose diversity of resource groupings and diversity of users as two examples.</p>
      </abstract>
      <kwd-group>
        <kwd>Diversity aware classification and clustering technology</kwd>
        <kwd>Diversity driven information aggregation technologies</kwd>
        <kwd>Semantic clustering</kwd>
        <kwd>Diversity aware search and semantic search</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Search is one of the main applications on today’s Web and other repositories,
and it is supported by more and more advanced techniques. However, these
techniques largely ignore an important component of search: the further processing of
search-result sets that humans invariably undertake when dealing seriously with
a list of documents provided by a search engine – and the diversity in which
this is done by different people. An important form of such further processing is
the grouping of result sets into subsets, which can be seen as investing an
undifferentiated list of results with “semantics”: a structuring into sets of documents
each instantiating a concept (which is a subconcept of the overall query). On the
Web, several search engines provide an automatic clustering of search results.
However, regardless of how good the employed clustering algorithm is, a
“globally optimal” clustering solution is generally impossible: There is no single best
way of structuring a list of items; instead, the “optimal” grouping will depend
on the context, tasks, previous knowledge, etc. of the searcher(s).</p>
      <p>On a truly Social Web, users should be empowered to see and work with a
diversity of possible structurings and their associated sense-makings. A
prerequisite for such diversity-aware tools is that users are able to perform individual
sense-making, structuring search result sets according to their needs and
knowledge. The problem that we study is thus how to make users aware of alternative
ways to group a set of documents. The approach that we take is to provide users
with a tool to cluster documents resulting from a query. In this tool,
Damilicious (DAta MIning in LIterature Search engines), the user can, starting from
an automatically generated clustering, group a search result document set into
meaningful groups, and she can learn about alternative groupings determined
by other users. To transfer a clustering of one set of documents to another
set of documents, the tool learns a model for this clustering, which can be
applied to cluster alternative sets of documents. We refer to this model as the
clustering’s intension, as opposed to its extension, which is the original,
unannotated grouping of the documents. This approach supports various measures
of diversity. Such measures can be used to make recommendations and present
new, possibly interesting viewpoints of structuring the result set. The domain of
literature search was chosen to ensure a high level of user interest in reflection
and meaningful results; the methods can easily be transferred to other domains.</p>
      <p>The paper is structured as follows: Section 2 gives a brief overview of related
work. In Section 3, we introduce the method of semantic clustering and
classification. In Sections 4 and 5, we describe the individual and collaborative uses of
the tool. Section 6 concludes with an outlook.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background and related work</title>
      <p>Our work extends theoretical and practical results from various areas.</p>
      <p>To present search results in a more meaningful way, search engines such as
www.clusty.com, www.kartoo.com or search.carrot2.org cluster search
results based on distance measures on documents. Subgroups are labelled based
on top keywords or phrases. However, users have no possibility of improving on
the quality or context-relatedness of the results. (Social-tagging applications
such as www.delicio.us, www.citeulike.org or www.bibsonomy.org are in a
sense the opposite: Users are completely free in grouping and labelling resources
they have found on the Web, but in general the only help they obtain from
machine intelligence are equality matches with other users’ tags or tag proposals.)</p>
      <p>
        In knowledge engineering, these problems are addressed by techniques for
semi-automatic ontology learning approaches where system-derived
clusters can be modified and annotated by users, e.g. in the tool [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]; see also [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In
CiteSeerCluster [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], we built on these ideas to improve the search for scientific
literature. This tool employs textual clustering methods and builds on established
bibliometric analyses and clustering algorithms, cf. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Users create, modify
and annotate groupings of the documents returned by a query, starting from an
automatic clustering, and they engage in sense-making of the domain.
      </p>
      <p>CiteSeerCluster has two limitations. First, each search episode stands alone:
The results (document groups as extensions and automatically derived keywords
as well as manually assigned labels and annotations as intensions of the concepts
created by a structuring activity) can be saved and loaded, but not re-used or
built on in new search episodes. Second, support for collaboration is therefore
also limited to the exchange of combined episode intensions and extensions, i.e.
“commented literature lists”, but not intensions separately.</p>
      <p>
        To overcome these limitations, we turned to recent work on conceptual
and predictive clustering [
        <xref ref-type="bibr" rid="ref16 ref4">4, 16</xref>
        ]. The key idea that we use from this work is
to a) form clusters of elements, then b) learn classifiers that reconstruct these
clusters, c) validate these classifiers by investigating the reconstruction quality,
and d) apply the classifier for further result sets.
      </p>
      <p>
        Research on ontology re-use, in particular adaptive ontology re-use [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
investigates the modelling and mapping steps needed for re-using given ontologies,
for whatever purpose. In contrast, we concentrate on re-use for
grouping/classifying new objects, and on how to find the most suitable ontologies for re-use.
Our aim is to derive, from this procedure, measures of diversity and to use
these to support search. We build on the notion of diversity of result sets as
used in recommender systems, e.g. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], and information retrieval, e.g. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and
on the notion of (cultural) diversity of people, cf. [
        <xref ref-type="bibr" rid="ref10 ref2">10, 2</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Semantic clustering, classification, and interactivity</title>
      <p>In this section, we describe the basic combination of clustering and classification
methods for deriving and re-using a semantics of search that has been created
by user and system together. We describe the system’s general workflow and our
measure of diversity between document groupings.</p>
      <p>
        Clustering, classification and regrouping proceed through five steps. All steps,
as well as the whole process, can be iterated:
1. Query: A user query is forwarded to a search engine or repository, and
the list of results is shown in the Damilicious interface. We use the CiteSeerX
repository1 because of its broad coverage and rich structure, and also because it
offers an OAI interface.2 The output is a set of document IDs, document details
and their texts.
2. Automatic clustering: The system clusters the documents with the Lingo
algorithm3. For each of the resulting clusters, an intensional definition is
calculated, where the set of intensional definitions of the clusters is the intensional
definition of the clustering. These intensional definitions provide the criteria
based on which the documents are clustered. They can thus be seen as a
classifier, and can be used to classify new documents in the future.
3. Manual regrouping: Since the automatic clustering is only a suggestion
for the structure, each user can move and delete documents (the extensions)
between the different clusters.
4. Description of alternative ways of grouping: Different ways in which a
result set can be grouped are compared and shown.
5. Transfer: A grouping solution can be used to group an enlarged or a different
document set. This is done by applying the intension as a classifier. This re-use
1 http://citeseerx.ist.psu.edu/
2 an interface for harvesting metadata from separate repositories, see
www.openarchives.org
3 http://project.carrot2.org
can be done using groupings produced by the user herself (“individual”, see
Section 4), or produced by another user (“collaborative”, see Section 5).
Measures of grouping similarity and diversity Step 4 of the workflow requires a
measure of the similarity/diversity of groupings. We use normalized mutual
information, because it has desirable properties: it has a value between 0 and 1, and
it behaves well when calculated for clusterings with different numbers of clusters
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The normalized mutual information (specifically, NMI 4 [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]) of two
groupings F, G is defined as N M I(F, G) = (H(F ) + H(G) − H(F, G))/pH(F )H(G),
where H(G) is the entropy of grouping G and H(F, G) the joint entropy of F
and G together.4 For clustering algorithms like Lingo that can generate
overlapping clusters, the probabilities used in the entropy calculations are normalized
by division by the number of documents in each cluster. We treat N M I as a
measure of the pairwise similarity of groupings, and (1 − N M I) as a measure
of the (pairwise) diversity of groupings.
      </p>
      <p>
        One use of this measure was to choose the best clustering and classification
algorithms for step 2 of the workflow. Our aim was a choice that reconstructs
a “ground-truth” clustering as well as possible, i.e. has the highest N M I with
it. We investigated two settings experimentally. The first is a ‘sanity check’:
cluster document set D; learn a classifier, apply this classifier to D, compare the
classes with the clustering. The second setting models the basic case of re-use,
the issuing of the same query at a later time towards a grown database: cluster
document sets D0 and D ⊂ D0, to obtain clusterings G0 and G. Learn a classifier
from G, apply it to D0, compare the classes with G0. We compared k-means and
Lingo for clustering and top-10 TF.IDF words, Lingo phrases, and Ripper [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
rules for classification. The combination of Lingo with Lingo phrases gave the
best results and is therefore implemented in the Damilicious user interface.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Individual sense-making: Interactive semantics</title>
      <p>
        The use of Damilicious by one individual serves two goals: (1) to support
individual sense-making and (2) to re-use one’s own prior search episodes, more
specifically the semantics created in them. (1) is realized through steps 1–3 of
Section 3; results can be saved and re-loaded. Goal (2) is realized in step 5 by
applying a classifier obtained in a previous search episode of the user.5 Here,
we illustrate step 4: the use of interactive cluster graphs to show the current
(machine-generated or manually regrouped) extensions and intensions.
Example: Towards an individualised semantics of “web mining” Figure 1
illustrates how Damilicious supports conceptual thinking in search: As in other forms
of semi-automatic ontology learning such as [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the groups are viewed as
concepts, with the extension of the concept given by the set of documents in the
4 for clusters Ci and p the distribution of documents over them:
      </p>
      <p>
        H(G) = − PCi∈G p(i)log2p(i) and H(F, G) = − PCi∈F PCj∈G p(i, j)log2 p(i, j).
5 The resulting ‘stability’ of document groups was highly appreciated by the student
participants of a small user study.
group. The intensions of the concepts are given here by the Lingo phrases; in [
        <xref ref-type="bibr" rid="ref3 ref9">9,
3</xref>
        ], they are given by a combination of top TF.IDF terms and manually assigned
labels. The layout ensures that large, ‘important’ clusters that overlap with many
others are shown in the centre, while small and ‘isolated’ clusters move to the
margins. In the example, the system solution has identified “Web agents” as well
as “Web personalization” as subfields of the field specified by the query, “Web
mining”. Unavoidably, in this automatic solution the top content area is not
split up into subgroups by the same criterion; thus for example, “Clustering” (a
method which could well be used for building agents or doing personalization)
is another cluster. Users can improve on this structure: by moving and deleting
documents between groups, they can modify the groupings to better reflect their
intentions, background knowledge, interests, etc.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Collaborative sense-making: Diversity</title>
      <p>The collaborative use of Damilicious serves two goals: (1) to get an overview of
user diversity and to localise oneself in this space, and (2) to re-use other users’
semantics. (1) builds on steps 1–3 of Section 3. Goal (2) is realized in step (5),
more specifically, in the transfer of a foreign model to a new search episode. In
this section, we illustrate step 4: the use of a measure and description of user
diversity by a semantic space of users. First, the measure is explained; then one
possible depiction is described; an alternative is to use a series of cluster graphs
as in the previous section.</p>
      <p>A measure of user diversity Above, we have proposed to use 1 − N M I(F, G)
as a measure of the diversity between groupings F and G. In our setting, the
instance set is a set of documents returned by a search engine operating on a
given state of a database, in response to a query q. The grouping is either the
result of a clustering/classification algorithm A (with parameters set by a user
or optimised according to some strategy), or it is a manual regrouping done by a
user A. To emphasize these two determinants, we replace F (or G) by gr(A, q).</p>
      <p>From this, we derive the measure gdiv(A, B, q) of the diversity of users A, B
(with respect to the way in which they structure the search result of q) as
gdiv(A, B, q) = 1 − N M I(gr(A, q), gr(B, q)).
(1)</p>
    </sec>
    <sec id="sec-6">
      <title>Based on this, a measure of the (pairwise) diversity of users gdiv(A, B)</title>
      <p>can be defined by an aggregation over queries they both worked on. A simple
example of an aggregation operator is the average:
gdiv(A, B) = avgq:∃gr(A,q)∧∃gr(B,q)(gdiv(gr(A, q), gr(B, q)).
(2)
Example (contd.): Diversity in conceptualising “Web mining” To demonstrate
the use of the user-diversity measure, we simulated a small user study. Five users
searched for “web mining” and restricted Damilicious to retrieving 50 documents.
User U0 did not change the system clustering. User U1 regrouped documents
to produce a better fit of the document groups to the cluster intensions, with
a total of five document regroupings. User U2 attempted to move everything
that did not fit well into the remainder group “Other topics”, and in addition
performed some regroupings to achieve a better fit; this resulted in ten regrouping
operations. User U3 had the reverse goal: In a total of five regrouping operations,
she distributed documents from “Other topics” into matching real groups. User
U4 pursued a very different strategy, regrouping by author and institution; she
also performed five regrouping operations.</p>
      <p>For q = “web mining” and each pair of users A, B, N M I(gr(A, q), gr(B, q))
was computed. Applying equation 1, we obtain a 5 × 5 matrix of differences
gdiv(A, B, q). Values ranged from 0.52 to 0.58. Assuming q to be the only
commonly worked-on query and applying equation 2, these differences are equal to
gdiv(A, B) and together form the user-diversity matrix GDIV .</p>
      <p>
        This matrix can be interpreted as giving rise to a “semantic space of users”, in
which users who group in similar ways are close to one another, but far from users
who group differently. Neighbourhood and distribution in this semantic space
can be regarded as indicators of diversity: pairwise diversity (distances) between
users, as well as overall distribution of population diversity. Multi-dimensional
scaling (MDS) is a popular way for visualising such distance-based semantic
spaces, e.g. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Figure 2 (a) shows an MDS visualization6 of GDIV .
      </p>
      <p>At the bottom right-of-centre, user U0 is shown as “System” (the system
solution). The locations of the other users in this space can be interpreted as
follows. U2 produced the most different solution, possibly through her most
active re-grouping. U1’s regrouping differed more from the System’s than U3’s,
possibly because U1 took a high-level semantic view in his attempt to produce
better-fitting groups, while U3 was less ambitious in his focus on re-distributing
documents (only) from the “Other Topics” cluster. Interestingly, U4’s attempt
6 coordinates generated with Talisman, http://talisman.sourceforge.jp/mds
to regroup by bibliographical data on author and institution (based on
different data than the System that uses textual information from the document
abstracts) resulted in the grouping most similar to the System’s. It is possible
that this is due to the fact that the same authors will use very similar wordings
throughout their papers7, such that the textual similarity is higher than that of
other papers on the same subject (which was the focus of U1’s, U2’s and U3’s
restructurings). In addition to these pairwise observations, the results also show
a simple form of population diversity: U1, U2 and U3, who had similar intentions
when regrouping, appear in one “region” of this semantic space of user diversity
(in the MDS solution of Fig. 2: to the left of System), clearly distinct from U4
who appears in a region of her own (to the right of System).</p>
      <p>Figure 2 (b) and (c) show the diversities generated by the same user strategies
on a semantically related query (b: data mining) and on an unrelated query (c:
RFID). Interestingly, the more similar query (b) also appears to generate a
more similar user diversity space. Averaging over all three queries, (d) shows the
commonalities of all three: the similarity of U1 and U3 vs. U2 and U4.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusions and outlook</title>
      <p>In this paper, we have presented the Damilicious tool which helps users in
sensemaking of the results of their literature searches on the Web: on an individual
level, by supporting the construction of semantics of the domain described by
their search term, and on the collective level, by encouraging users to explore
the diversity of other users and to re-use other users’ semantics.</p>
      <p>
        Many open issues remain to be solved. They include (a) how to measure not
only the diversity in clustering of search results, but also the diversity in results
for different queries, and in general different result sets; (b) how to best present
diversity of groupings and users (should all users be shown, only the nearest
neighbour, or a ranking of neighbours? should other groupings rather than other
users be shown? should “aggregated groupings” be shown, and how can these
be defined? how should this functionality be integrated into a comprehensive
environment supporting user and community contexts [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]? how can
appropriate interpretations of MDS be supported and others discouraged [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]?); (c) how
to motivate users to take advantage of regrouping and diversity functionalities
7 cf. also the modelling, in CiteSeer(X), of specific forms of textual similarity in
sameauthor papers: http://citeseerx.ist.psu.edu/help/glossary
(specific literature-search tasks may be beneficial, as suggested by the
evaluation results of [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]); (d) how to find the best balance between similarity (“re-use
solutions from users like me”) and diversity (“re-use solutions from users unlike
me so I can broaden my horizon”); (e) which measures of grouping diversity are
most meaningful to users (our currently used measure N M I is purely
extensional or instance-based; more intensional, structure-based or hybrid measures
from the ontology matching field [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] could also be useful); and (f) which other
sources of user diversity to leverage (for example, affiliation or research area). In
future work, we aim to explore these issues theoretically and in user studies.
Acknowledgments S. Nijssen was supported by the Science Foundation – Flanders.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>R.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gollapudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halverson</surname>
          </string-name>
          , &amp; S. Ieong.
          <article-title>Diversifying search results</article-title>
          .
          <source>In Proc. WSDM '09</source>
          ,
          <fpage>5</fpage>
          -
          <lpage>14</lpage>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>B.</given-names>
            <surname>Berendt</surname>
          </string-name>
          &amp;
          <string-name>
            <given-names>A.</given-names>
            <surname>Kralisch</surname>
          </string-name>
          .
          <article-title>From world-wide-web mining to worldwide webmining: Understanding people's diversity for effective knowledge discovery</article-title>
          . In From Web to Social Web, LNAI
          <volume>4737</volume>
          ,
          <fpage>102</fpage>
          -
          <lpage>121</lpage>
          . Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>B.</given-names>
            <surname>Berendt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Krause</surname>
          </string-name>
          , &amp; S.
          <string-name>
            <surname>Kolbe-Nusser</surname>
          </string-name>
          .
          <article-title>Intelligent scientific authoring tools: Interactive data mining for constructive uses of citation networks</article-title>
          .
          <source>Information Processing &amp; Management</source>
          , in press.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>H.</given-names>
            <surname>Blockeel</surname>
          </string-name>
          , L. De Raedt, &amp; J.
          <string-name>
            <surname>Ramon</surname>
          </string-name>
          .
          <article-title>Top-down induction of clustering trees</article-title>
          .
          <source>In In Proc. of the 15th ICML</source>
          ,
          <fpage>55</fpage>
          -
          <lpage>63</lpage>
          . Morgan Kaufmann,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>I. Borg &amp; J.</given-names>
            <surname>Lingoes</surname>
          </string-name>
          .
          <source>Multidimensional Similarity Structure Analysis</source>
          . Springer, New York,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>W.W.</given-names>
            <surname>Cohen</surname>
          </string-name>
          .
          <article-title>Fast Effective Rule Induction</article-title>
          . In ICML,
          <fpage>115</fpage>
          -
          <lpage>123</lpage>
          .
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Cutting</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Pedersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Karger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>&amp; J. W.</given-names>
            <surname>Tukey</surname>
          </string-name>
          . Scatter/Gather:
          <article-title>A cluster-based approach to browsing large document collections</article-title>
          .
          <source>In Proc. SIGIR</source>
          ,
          <fpage>318</fpage>
          -
          <lpage>329</lpage>
          . ACM,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>J. Euzenat &amp; P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          . Ontology Matching. Springer, Berlin/Heidelberg,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>B.</given-names>
            <surname>Fortuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mladenic</surname>
          </string-name>
          , &amp;
          <string-name>
            <surname>M. Grobelnik</surname>
          </string-name>
          .
          <article-title>Semi-automatic construction of topic ontologies</article-title>
          .
          <source>In Semantics, Web and Mining</source>
          , LNCS
          <volume>4289</volume>
          ,
          <fpage>121</fpage>
          -
          <lpage>131</lpage>
          . Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. G. Hofstede.
          <article-title>Cultures and organizations: software of the mind</article-title>
          .
          <article-title>Intercultural cooperation and its importance for survival</article-title>
          .
          <source>HarperCollins</source>
          , London,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>F.</given-names>
            <surname>Janssens</surname>
          </string-name>
          , W. Gl¨anzel, &amp;
          <string-name>
            <surname>B. De Moor</surname>
          </string-name>
          .
          <article-title>A hybrid mapping of information science</article-title>
          .
          <source>Scientometrics</source>
          ,
          <volume>75</volume>
          (
          <issue>3</issue>
          ):
          <fpage>607</fpage>
          -
          <lpage>631</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Nieder´ee,</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Stewart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Muscogiuri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hemmje</surname>
          </string-name>
          , &amp; T. Risse.
          <article-title>Understanding and Tailoring Your Scientific Information Environment: A Context-Oriented View on E-Science Support</article-title>
          .
          <source>In From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments</source>
          ,
          <fpage>289</fpage>
          -
          <lpage>298</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>D.</given-names>
            <surname>Pfitzner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Leibbrandt</surname>
          </string-name>
          , &amp;
          <string-name>
            <given-names>D.</given-names>
            <surname>Powers</surname>
          </string-name>
          .
          <article-title>Characterization and evaluation of similarity measures for pairs of clusterings</article-title>
          .
          <source>Knowledge and Information Systems</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>R.</given-names>
            <surname>Stecher</surname>
          </string-name>
          , C. Nieder´ee, W. Nejdl, &amp; P. Bouquet.
          <article-title>Adaptive ontology re-use: finding and re-using sub-ontologies</article-title>
          .
          <source>IJWIS</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ):
          <fpage>198</fpage>
          -
          <lpage>214</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>A.</given-names>
            <surname>Strehl</surname>
          </string-name>
          &amp;
          <string-name>
            <surname>J. Ghosh</surname>
          </string-name>
          .
          <article-title>Cluster ensembles - a knowledge reuse framework for combining multiple partitions</article-title>
          .
          <source>Machine Learning</source>
          ,
          <volume>3</volume>
          :
          <fpage>583</fpage>
          -
          <lpage>617</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>B.</given-names>
            <surname>Zenko</surname>
          </string-name>
          , S. Dzeroski, &amp; J.
          <string-name>
            <surname>Struyf</surname>
          </string-name>
          .
          <article-title>Learning predictive clustering rules</article-title>
          .
          <source>In In Proc. 4th Int. Worksh. on Knowledge Discovery in Inductive Databases, LNCS</source>
          <volume>3933</volume>
          ,
          <fpage>234</fpage>
          -
          <lpage>250</lpage>
          . Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>M. Zhang &amp; N.</given-names>
            <surname>Hurley</surname>
          </string-name>
          .
          <article-title>Statistical modeling of diversity in top-n recommender systems</article-title>
          .
          <source>In Proc. of ACM/WIC/IEEE WI-IAT'09</source>
          ,
          <fpage>490</fpage>
          -
          <lpage>497</lpage>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>