<!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>Towards Semantic Profiling in Social Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gregorio D'Agostino</string-name>
          <email>gregorio.dagostino@enea.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antonio De Nicola</string-name>
          <email>antonio.denicola@enea.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computing and Technological Infrastructure Lab, ENEA: Italian National Agency for New Technologies, Energy and Sustainable Economic Development</institution>
          ,
          <addr-line>Via Anguillarese 301 - 00123, Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The growing available implicit knowledge about people in social networks is fostering a new generation of advanced services centered on the actual needs of persons. Precondition to them is to provide an explicit formal specification of what is known about people taking part in the social network. This specification should be in the terms of a shared conceptualization of one or more domains of interest related to the social network scope. Here we propose a method to provide semantic profiles of people taking part in a social network concerning a specific domain of interest. Our method is an inference process based on the topological structure of the relationships between people, on existing explicit interests, and on the assumption that each person has own beliefs and is partly influenced by friends. In particular, the introduced approach allows estimating a semantic profile of a newcomer, i.e., a new person joining a social network, and how it will evolve over time.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Social Networks</kwd>
        <kwd>Semantic Social Networks</kwd>
        <kwd>Semantic Profiling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Social Networks (SN)s collect a huge amount of growing implicit knowledge about
people and domains of interest. General purpose SNs (e.g., Facebook, Twitter) collect
information on several domains (e.g., music, movies, literature, travels) whereas
domain specific SNs, e.g., anobii and LinkedIn, collect information on specific topics
(e.g., books for anoobi and job and careers for LinkedIn).</p>
      <p>Organizing and managing such knowledge may allow definition of a new
generation of services focused on specific users’ needs. Examples are services devoted to a
better organization of human competencies in the enterprise sector; marketing
services to promote new products and services; and alert services to provide useful or
necessary information to citizens, private enterprises, institutional operators, decision
makers, and possibly other entities.</p>
      <p>Precondition to these services is harnessing implicit knowledge at the basis of a SN
(i.e., SN knowledge) and to provide it in an explicit form. SN knowledge concerns
people, i.e., their relationships, their attitudes, their interests, their needs, and their
activities, and, for domain specific SNs, the addressed SN sector.</p>
      <p>In this paper we propose a first step to provide an explicit specification of SN
knowledge. We focus on providing a semantic specification of interests (i.e., semantic
profile) related to people taking part in a SN. In particular, we propose a method to
estimate the semantic profile of a new person joining a social network and its
evolution during time. Our method is based on the topological structure of people
relationships, on existing explicit interests and on the assumption that each person has her/his
own beliefs and is partly influenced by her/his friends.</p>
      <p>The rest of the paper is organized as follows. First we introduce a formal definition
of a social network. Then we describe an incremental approach to specify a domain of
interest and we present our definition of the interest endowed network as a bipartite
graph. Then we propose our method to estimate the evolution of a semantic profile
and a consequent estimated welcome profile related to a newcomer. Finally, related
work in the area and conclusions end this work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Social Network</title>
      <p>A social network consists of a community of people linked together with some
kind of relationships (e.g., friendship, coauthorship, working together with). It can be
represented as a directed graph SoN =(P,F) (Figure 1), where the set P of nodes pi
represents people P={p1, p2, …, p|P|}, and the set F of links fj,k represents friendship
relationships between person j and person k as ordered pairs of people F={f1,1, f1,2, …,
f|F|}.</p>
      <p>If the relationship between people is symmetric the graph becomes “undirected”.
There are two ways to account for the symmetric case: one consists into doubling the
links always including two ordered pairs in both orders; while the other consists into
associating a link to a unordered pair. To account for the most general case, the first
approach has been preferred. Most of the considerations presented in the paper apply
to both directed and undirected graphs (i.e., symmetric or non symmetric
relationship); when results will depend on such characteristics it will be outlined in the text.
To keep the problem on ground it is worth noting that while Facebook relationship is
intrinsically symmetric, the same does not apply to Twitter.</p>
    </sec>
    <sec id="sec-3">
      <title>Domain of Interest Representation</title>
      <p>
        According to the modeler’s purpose, a domain of interest can be conceptualized at
different levels of abstraction and represented by means of incremental levels of
details [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. First, the domain lexicon specifies the terminology used in the domain of
interest. Then the domain glossary allows specifying the definitions corresponding to
the terms. The semantic network allows specifying ontological relationships. Finally,
the ontology provides axioms and the final formalization (e.g., by using the OWL
language [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]).
      </p>
      <p>In the following, as a running example, we consider a community of people
working in the sector of critical infrastructures protection and sharing information related
to such domain.</p>
      <p>A domain lexicon DL={t1, t2, …, t|DL|} is defined as the set of terms (ti) used to
characterize a domain of interest.</p>
      <p>In the example of the critical infrastructure sector (see above), an excerpt of the
lexicon is reported in the Table 1.
Telecommunications, Transportation, SCADA, Mobile Telecommunications, Fixed Telecommunications,
Rail Transportation, Aviation, Maritime Transportation, Road Transportation, Water, Gas, Electricity</p>
      <p>A domain glossary G={g1,…,g|G|} is defined as the finite set of terms belonging to
a domain lexicon DL paired with the corresponding definitions. The pair term and
definition is defined as the glossary entry gi, where</p>
      <p>gi = {(ti, defi ) | ti ! DL " defi ! DEF},
and DEF is the set of the definitions of the domain lexicon terms.</p>
      <p>In the example of the critical infrastructure protection sector, an excerpt of the
domain glossary is reported in the Table 2.</p>
      <p>A semantic network SeN can be considered as a simplified version of an ontology
since it consists of a set of concepts and a set of ontological relationships between
them. Consequently, SeN=(C,R), where the set C of nodes ci includes concepts,
C={c1,c2, …, c|C|}, and the set R includes the relationships rk between concept i and
concept j, where</p>
      <p>R = {r1, r2 ,..., rR } = {(ci, c j )} ! C " C .</p>
      <p>
        An example of relationship is similarity (sim) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], representing how a concept is
similar to another concept.
      </p>
      <p>
        An ontology O is a formal specification of a shared conceptualization [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. An
ontology consists of a set of concepts, a set of relationships between them, and a set of
axioms. Consequently, given a finite set of concepts, a finite set R of relationships
established between concepts, and a finite set of semantic axioms Ax, an ontology is
defined as a triple O=(C,R,Ax), where Ax={boolExp1,boolExp2,…,boolExp|Ax|}.
      </p>
      <p>
        The Table 3 reports an example of axiom in the critical infrastructure protection
sector using Horn Clauses notation [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
Axiom. Radioactive materials are transported only by means of special transportation.
      </p>
      <p>Good(_ x) : !RadioactiveMaterial(_ x)
Transportation(_ y) : !SpecialTransportation(_ y)
SpecialTransportation(_ y) : !RadioactiveMaterial(_ x), TransportedBy(x, y)</p>
      <p>An Interest endowed Network IeN represents the interests of a community of
linked people. It can be represented as a bipartite graph consisting of a set of nodes N
partitioned in two groups, one representing people and the other the concepts from a
domain of interest conceptualization, and a set of relationships I representing links
between people and concepts only. Consequently, IEN=(P,C,I), where I={i1, i2, …, i|I|},
and</p>
      <p>ii = ( p j, ck ) with p j ! P and ck ! C .</p>
      <p>An excerpt from the interest endowed network in the critical infrastructures
protection example is reported in the Figure 2.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Semantic Social Network</title>
      <p>A semantic social network SSN represents, at the same time, the domain of
interest, the interests of a community of people, and the relationships among such people. It
can be specified as the union of a semantic network (or an ontology), a social network,
and an interest endowed network. Consequently, SSN=(P,F,C,R,I), where P represents
the set of people; F represents the relationships among people; C represents the set of
concepts; R represents the relationships between concepts; and I represents the interest
of people on concepts.
4.1</p>
      <sec id="sec-4-1">
        <title>Semantic Profiling</title>
        <p>We define semantic profiling as the process to associate interests (i.e., concepts of a
domain ontology), related to a specific domain of interest, to a person, in other words
inferring links belonging to the i-th person. The set of interests characterizing a person
pi is defined as her/his semantic profile Spi:
where</p>
        <p>Spi = {ck :( pi , ck ) ! I }
ck ! C , k ! (0, C ) and pi ! P .</p>
        <p>In other words the semantic profile of a person is a subset of the interest endowed
network.</p>
        <p>The method we propose here allows building a semantic profile of a person pi, i.e.,
newcomer, joining an existing semantic social network SSN, representing a community
of people, a domain of interest, and their interest in such domain. The precondition to
apply this method is to know both the topological structure of the social network and
the semantic profiles of people belonging to it, that is all the SSN. We are looking for a
kind of welcome profiling.</p>
        <p>For the sake of simplicity, here, we do not take into account the linked structure of
the ontology and we consider just the concepts per se.</p>
        <p>Furthermore, for the newcomer pi, we define the “likelihood” Lpi(ck) as the
probability to be interested in the concept ck.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Semantic Profile Evolution</title>
        <p>Here we estimate how, given a person pi, the probability for he or she to be
interested in a concept ck evolves during time:</p>
        <p>Lpi (ck | t + !t) = (1" xi (ck )) # Lpi (ck | t) +
1
N
# %
pj$N
xij (ck ) # Lp (ck | t)
j
where xij(ck) is a positive number representing the attitude of a person pi to be
influenced by his or her neighbors (pj) with regard to the concept ck and xi represents the
sum over all j’s that is the total influenceability:
xi (ck ) d=ef pj !Npi</p>
        <p>.
" xij (ck )</p>
        <p>N pi</p>
        <p>In order to predict the probability of exhibiting an interest in a future time
Lpi(ck|t+Δt), we assumed that a person has her/his own beliefs; this assumption
originates the positive term Lpi(ck|t). As mentioned, we also assume that a person is partly
influenced by people he or she interacts with; this originates both the negative term,
-xi(ck).Lpi(ck|t) (representing the negative influence of the friends on the term ck), and
the positive following term (representing the positive influence of the friends on the
term ck):
1
N
pi
!</p>
        <p>#
pj"N
pi</p>
        <p>xij (ck ) ! Lp j (ck | t ) .</p>
        <p>If we assume that the interest in any concept experiences the same influence from
friends, the xi value does not depend on concept.</p>
        <p>When xi=0 we are dealing with a person that is not influenced by other people and
always keeps his or her own opinions. On the other hand, when xi=1 the person is
totally bailed out by friends.</p>
        <p>To extract a semantic profile from the L 's, we may assume that a person pi is
interested in a concept ck if Lpi(ck|t)&gt;Lt, where Lt is a predefined threshold.
Consequently:</p>
        <p>S pi (t ) = {ck :( pi , ck ) ! I ! Lpi (ck | t) &gt; Lt } .
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Welcome Profiling</title>
        <p>Once a person joins a social network, it may happen that he or she does not have
time or does not desire to express formally interests; therefore the only information
available is contained in her/his links with other people. For this reason, in order to
build a welcome profile, we omit the unknown part concerning past personal interests
in the formula to estimate Lpi(ck) and we just consider the part concerning the influence
of the group of people in his or her neighborhood (assuming there is at least one person
in the group and, consequently, N pi ! 0 ):</p>
        <p>Lpi (ck | t + !t ) =
1
N
pi</p>
        <p>pj #N pi
" $ xij (ck ) " Lpj (ck | t ) .</p>
        <p>In practice, we are estimating the interest of a newcomer as just the average of the
interests of his or her friends. Alternatively, we can assume the newcomer to have an
“a priori” average interest L0pi(ck) and provide a welcome profile based on its expected
evolution:</p>
        <p>Lpi (ck | !t) = (1" x (ck )) # L0pi (ck ) +
1
N pi
# % xij (ck ) # Lpj (ck | t = 0).
pj$N pi</p>
        <p>Please note that we consider here t=0 as the starting time of the observation period
of the social network.</p>
        <p>Furthermore, as a first approximation, we can assume that the friend’s contribution
is unitary, Lpj(ck|t)=1, if her/his interest on the concept ck is declared, or null otherwise,
Lpj(ck|t)=0. The “a priori” interest L0 may result from analysis of some larger social
network or can be provided by other modeling of the system.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Related Work</title>
      <p>
        Business and social experts [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] recognize the growing importance of the new
generation of web sites both for their implications on marketing and for the impact on the
societal and political life.
      </p>
      <p>
        A list of new generation of methodological approaches fostering the potential of
social networks is presented in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Examples of these methodologies are novel
approaches to study viral marketing [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and mechanism to govern social influence [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        Merging social network analysis and semantics-based methods is a new research
approach recently used with promising results [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. With these works we
share the use of a conceptual representation of a domain of interest in the social
network context.
      </p>
      <p>
        The importance of semantic profiling, that is the main topic of our paper, is
recognized by a growing number of research papers [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Semantic profiling is mainly
used to support information retrieval systems. The existing approaches are based on
extracting concepts from a domain ontology and by means of a set of existing
documents. While their approach employs a domain ontology, we propose a paradigm shift
to estimate semantic profiles including the topology of the human relationships of the
social network.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>The growing implicit knowledge available in social networks opens several
opportunities to develop a new generation of advanced services tailored to user
characteristics. Semantic profiling is the process to add a semantics-based description of a person.
The former is a precondition to foster the desired intelligent services.</p>
      <p>In this paper we have proposed a novel approach to model the evolution of
semantic profile in a social network and to provide a newcomer in a social network with an
inferred welcome profile. Our approach is based on the relationships’ topology of the
social network and on assumption that each person carries his or her own beliefs
whilst being partly influenced by friends.</p>
      <p>Finally, the present paper is a preliminary theoretical work that is currently under
ongoing validation through a large set of data related to a widespread social network.
As possible applications, we envisage usages in the competencies management and in
the marketing sectors.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>De Nicola</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Missikoff</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Navigli</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <article-title>A software engineering approach to ontology building</article-title>
          ,
          <source>Information Systems</source>
          , Volume
          <volume>34</volume>
          , Issue 2, pp.
          <fpage>258</fpage>
          -
          <lpage>275</lpage>
          ,
          <year>April 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Antoniou G.,
          <string-name>
            <surname>van Harmelen F.</surname>
          </string-name>
          ,
          <source>Web ontology language: Owl</source>
          , in: S. Staab, R. Studer (Eds.),
          <source>Handbook on Ontologies</source>
          , Springer, pp.
          <fpage>67</fpage>
          -
          <lpage>92</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lin</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>An</surname>
          </string-name>
          Information-Theoretic Definition of Similarity,
          <source>In Proceedings of the 15th International Conference on Machine Learning</source>
          , Morgan Kaufmann, pp.
          <fpage>296</fpage>
          --
          <lpage>304</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Gruber</surname>
            <given-names>T. R.</given-names>
          </string-name>
          ,
          <article-title>A translation approach to portable ontology specification</article-title>
          ,
          <source>Knowl. Acquis. 5</source>
          , pp
          <fpage>199</fpage>
          -
          <lpage>220</lpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Borst</surname>
            <given-names>W. N.</given-names>
          </string-name>
          ,
          <article-title>Construction of engineering ontologies for knowledge sharing and reuse</article-title>
          , University of Twente, Enschede, The Netherlands,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lloyd</surname>
            <given-names>JW</given-names>
          </string-name>
          .
          <source>Foundations of Logic Programming (2nd edn)</source>
          . Springer-Verlag: Berlin,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>D.</given-names>
            <surname>Tapscott</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Williams</surname>
          </string-name>
          , Wikinomics: How Mass Collaboration Changes Everything, New York, Penguin,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Staab</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Domingos</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mika</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golbeck</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ding</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nowak</surname>
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Vallacher</surname>
            <given-names>R. R.</given-names>
          </string-name>
          ,
          <source>Social Networks Applied. IEEE Intelligent Systems</source>
          <volume>20</volume>
          , 1,
          <string-name>
            <surname>January</surname>
          </string-name>
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Domingos</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <article-title>Mining Social Networks for Viral Marketing</article-title>
          ,
          <source>IEEE Intelligent Systems</source>
          , Vol.
          <volume>20</volume>
          , No.
          <volume>1</volume>
          ., pp.
          <fpage>80</fpage>
          -
          <lpage>82</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Novak</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vallacher</surname>
            <given-names>R. R.</given-names>
          </string-name>
          ,
          <source>Information and Influence in the Construction of Shared Reality, IEEE Intelligent Systems</source>
          , Vol.
          <volume>20</volume>
          , No.
          <volume>1</volume>
          ., pp.
          <fpage>90</fpage>
          -
          <lpage>93</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Jung</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Euzenat</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <article-title>Towards Semantic Social Networks</article-title>
          .
          <source>In Proc. of ESWC</source>
          <year>2007</year>
          , LNCS 4519, pp.
          <fpage>267</fpage>
          -
          <lpage>280</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Mika</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <article-title>Social Networks and the Semantic Web: The Next Challenge</article-title>
          ,
          <source>IEEE Intelligent Systems</source>
          , Vol.
          <volume>20</volume>
          , No.
          <volume>1</volume>
          ., pp.
          <fpage>82</fpage>
          -
          <lpage>84</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Bojrs</surname>
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breslin</surname>
            <given-names>J. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finn</surname>
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Decker</surname>
            <given-names>S..</given-names>
          </string-name>
          <article-title>Using the Semantic Web for linking and reusing data across Web 2.0 communities</article-title>
          .
          <source>Web Semant. 6</source>
          ,
          <issue>1</issue>
          ,
          <string-name>
            <surname>February</surname>
          </string-name>
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kinsella</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passant</surname>
            <given-names>A.</given-names>
          </string-name>
          , et al..
          <article-title>The Future of Social Web Sites: Sharing Data and Trusted Applications with Semantics</article-title>
          ,
          <source>Advances in Computers</source>
          , Vol.
          <volume>76</volume>
          ,
          <string-name>
            <surname>Is</surname>
          </string-name>
          .
          <volume>09</volume>
          , pp.
          <fpage>121</fpage>
          -
          <lpage>175</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Bhatt</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahayu</surname>
            <given-names>W.</given-names>
          </string-name>
          , Prakash Soni S.,
          <string-name>
            <surname>Wouters</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <article-title>Ontology driven semantic profiling and retrieval in medical information systems</article-title>
          ,
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          , Volume
          <volume>7</volume>
          , Issue 4, pp.
          <fpage>317</fpage>
          -
          <lpage>331</lpage>
          ,
          <year>December 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Zhuhadar</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nasraoui</surname>
            <given-names>O.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Wyatt</surname>
            <given-names>R..</given-names>
          </string-name>
          <article-title>Dual representation of the semantic user profile for personalized web search in an evolving domain</article-title>
          .
          <source>In Proc. of the AAAI 2009 Spring Symposium on Social Semantic Web, Where Web 2.0 meets Web 3.0</source>
          , pp.
          <fpage>84</fpage>
          -
          <lpage>89</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>