<?xml version="1.0"?>

<!DOCTYPE owl [
  <!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
  <!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
  <!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
  <!ENTITY owl "http://www.w3.org/2002/07/owl#">
  <!ENTITY cc "http://web.resource.org/cc/#">
  <!ENTITY event "http://ebiquity.umbc.edu/ontology/event.owl#">
  <!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
  <!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">]>

<!--
  This ontology document is licensed under the Creative Commons
  Attribution License. To view a copy of this license, visit
  http://creativecommons.org/licenses/by/2.0/ or send a letter to
  Creative Commons, 559 Nathan Abbott Way, Stanford, California
  94305, USA.
-->

<rdf:RDF 
  xmlns:rdf = "&rdf;"
  xmlns:rdfs = "&rdfs;"
  xmlns:xsd = "&xsd;"
  xmlns:owl = "&owl;"
  xmlns:cc = "&cc;"
  xmlns:event = "&event;"
  xmlns:person = "&person;"
  xmlns:assert = "&assert;">
  <event:Event rdf:about="http://ebiquity.umbc.edu/event/html/id/18/Trust-Networks">
    <rdfs:label><![CDATA[Trust Networks]]></rdfs:label>
    <event:title><![CDATA[Trust Networks]]></event:title>
    <event:speaker><person:PhDAlumnus rdf:about="http://ebiquity.umbc.edu/person/html/Li/Ding/"><person:name><![CDATA[Li  Ding]]></person:name><rdfs:label><![CDATA[Li  Ding]]></rdfs:label></person:PhDAlumnus></event:speaker>
    <event:startDate rdf:datatype="&xsd;dateTime">2004-04-05T11:00:00-05:00</event:startDate>
    <event:endDate rdf:datatype="&xsd;dateTime">2004-04-05T12:00:00-05:00</event:endDate>
    <event:location><![CDATA[ITE 325B]]></event:location>
    <event:abstract><![CDATA[The growth in knowledge sharing enabled by the (semantic) web made trust an increasingly critical issue. A trust network refers to a network of agents connected by directed trust relations with Boolean or numerical values. We argue that it is more personalized, flexible and scalable than traditional approaches such as public reputation systems and collaborative filtering. Some researchers have recently suggested a graph interpretation of the trust network, and proposed simple algorithms for propagating trust. However, it is not clear that trust is completely transitive or even static. This paper systematically characterizes trust network inference with three components: a data model, a computational model and an evaluation model. The data model clarifies the context (input, constraint and output) of trust network inference for knowledge sharing. It also elaborates trust network representation and different types of trust. The computation model reviews existing, graph theory based trust network computation models, and proposes a new model that treats trust as an emergent property. The model supports both trust evolution and trust propagation. The evaluation model describes evaluation metrics, as well as methods to generate test data. We also design and implement an agent based trust network evaluation framework.]]></event:abstract>
    <event:host><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Tim/Finin/"><person:name><![CDATA[Tim  Finin]]></person:name><rdfs:label><![CDATA[Tim  Finin]]></rdfs:label></person:PrincipalFaculty></event:host>
  </event:Event>

  <rdf:Description rdf:about="">
    <cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  </rdf:Description>

</rdf:RDF>
