<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
  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.
-->
 <channel rdf:about="http://ebiquity.umbc.edu/tag/foaf/">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <image rdf:resource="http://ebiquity.umbc.edu/img/logo.jpg" />  <title><![CDATA[RSS Tag Search]]></title>
  <link>http://ebiquity.umbc.edu/tag/foaf/</link>
  <description><![CDATA[RSS Tag Search]]></description>
  <items>
   <rdf:Seq>
    <rdf:li resource="http://ebiquity.umbc.edu/project/html/id/56/Semantic-Discovery-Discovering-Complex-Relationships-in-Semantic-Web"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/503/Learning-Co-reference-Relations-for-FOAF-Instances"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/506/Computing-FOAF-Co-reference-Relations-with-Rules-and-Machine-Learning"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/471/A-Machine-Learning-Approach-to-Linking-FOAF-Instances"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/284/Semantic-Analytics-on-Social-Networks-Experiences-in-Addressing-the-Problem-of-Conflict-of-Interest-Detection"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/222/Social-Networking-on-the-Semantic-Web"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/184/How-the-Semantic-Web-is-Being-Used-An-Analysis-of-FOAF-Documents"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/185/Information-Retrieval-and-the-Semantic-Web"/>
    <rdf:li resource="http://ebiquity.umbc.edu/resource/html/id/82/foafPub-dataset"/>
   </rdf:Seq>
  </items>
 </channel>
 <image rdf:about="http://ebiquity.umbc.edu/img/logo.jpg">
  <title>UMBC ebiquity research group</title>
  <link>http://ebiquity.umbc.edu</link>
  <url>http://ebiquity.umbc.edu/img/logo.jpg</url>
 </image>
 <item rdf:about="http://ebiquity.umbc.edu/project/html/id/56/Semantic-Discovery-Discovering-Complex-Relationships-in-Semantic-Web">
  <title><![CDATA[Semantic Discovery: Discovering Complex Relationships in Semantic Web]]></title>
  <link>http://ebiquity.umbc.edu/project/html/id/56/Semantic-Discovery-Discovering-Complex-Relationships-in-Semantic-Web</link>
  <description><![CDATA[Research in search techniques was a critical component of the first generation of the Web, and has gone from academe to mainstream. A second generation Semantic Web will be built by adding semantic annotations that software can understand and from which humans can benefit. Modeling, discovering and reasoning about complex relationships on the Semantic Web will enable this vision and transform the hunt for documents into a more automated analysis enabled by semantic technology. The beginnings ...]]></description>
  <dc:date>2003-10-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/503/Learning-Co-reference-Relations-for-FOAF-Instances">
  <title><![CDATA[Learning Co-reference Relations for FOAF Instances]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/503/Learning-Co-reference-Relations-for-FOAF-Instances</link>
  <description><![CDATA[FOAF is widely used on the Web to describe people, groups and organizations and their properties. Since FOAF does not require unique IDs, it is often unclear when two FOAF instances are co-referent, i.e., denote the same entity in the world. We describe a prototype system that identifies sets of co-referent FOAF instances using logical constraints (e.g., IFPs), strong heuristics (e.g., FOAF agents described in the same file are not co-referent), and a Support Vector Machine (SVM) generated cl...]]></description>
  <dc:date>2010-11-09</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/506/Computing-FOAF-Co-reference-Relations-with-Rules-and-Machine-Learning">
  <title><![CDATA[Computing FOAF Co-reference Relations with Rules and Machine Learning]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/506/Computing-FOAF-Co-reference-Relations-with-Rules-and-Machine-Learning</link>
  <description><![CDATA[The friend of a friend (FOAF) vocabulary is widely used on the Web to describe ’agents’ (people, groups and organizations) and their properties. Since FOAF does not require unique ID for agents, it is not clear when two FOAF instances should be linked as co-referent, i.e., denote the entity in the world. One approach is to use logical constraints such as the presence of inverse functional properties as evidence that two individuals are the same. Another applies heuristics based on the str...]]></description>
  <dc:date>2010-11-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/471/A-Machine-Learning-Approach-to-Linking-FOAF-Instances">
  <title><![CDATA[A Machine Learning Approach to Linking FOAF Instances]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/471/A-Machine-Learning-Approach-to-Linking-FOAF-Instances</link>
  <description><![CDATA[The friend of a friend (FOAF) vocabulary is widely used on the Web to describe individual people and their properties.  Since FOAF does not require a unique ID for a person, it is not clear when two FOAF agents should be linked as coreferent, i.e., denote the same person in the world. One approach is to use the presence of inverse functional properties (e.g., foaf:mbox) as evidence that two individuals are the same. Another applies heuristics based on the string similarity of values of FOAF p...]]></description>
  <dc:date>2010-01-23</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/284/Semantic-Analytics-on-Social-Networks-Experiences-in-Addressing-the-Problem-of-Conflict-of-Interest-Detection">
  <title><![CDATA[Semantic Analytics on Social Networks: Experiences in Addressing the Problem of Conflict of Interest Detection]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/284/Semantic-Analytics-on-Social-Networks-Experiences-in-Addressing-the-Problem-of-Conflict-of-Interest-Detection</link>
  <description><![CDATA[In this paper, we describe a Semantic Web application that detects Conflict of Interest relationships among potential reviewers and authors of scientific papers. This application discovers various "semantic associations" between the reviewers and authors in a populated ontology to determine a degree of Conflict of Interest.  This ontology is built by integrating entities and relationships from two social networks, namely 'knows' from a FOAF (Friendof- a-Friend) social network, and 'co-author'...]]></description>
  <dc:date>2006-05-23</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/222/Social-Networking-on-the-Semantic-Web">
  <title><![CDATA[Social Networking on the Semantic Web]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/222/Social-Networking-on-the-Semantic-Web</link>
  <description><![CDATA[The Semantic Web promised to enable a new generation of intelligent applications by providing programs and software agents with rich and effective ways to share information and knowledge. The Semantic Web allows people and groups to define sharable ontologies - collections of classes, properties and objects - with well defined and unambiguous meaning. These ontologies permits computer programs to read, publish and exchange information and knowledge, enhancing interoperability, cooperation, an...]]></description>
  <dc:date>2005-12-31</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/184/How-the-Semantic-Web-is-Being-Used-An-Analysis-of-FOAF-Documents">
  <title><![CDATA[How the Semantic Web is Being Used:An Analysis of FOAF Documents]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/184/How-the-Semantic-Web-is-Being-Used-An-Analysis-of-FOAF-Documents</link>
  <description><![CDATA[Semantic Web researchers have initially focused on
the representation, development and use of ontologies but paid
less attention to the social and structural relationships involved.
The past year has seen a dramatic increase in the amount of
published RDF documents using the Friend of a Friend (FOAF)
vocabulary, providing a valuable resource for investigating how
early Semantic Web adopters use this technology as well as
build social networks. We describe an approach to identify,
disc...]]></description>
  <dc:date>2005-01-03</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/185/Information-Retrieval-and-the-Semantic-Web">
  <title><![CDATA[Information Retrieval and the Semantic Web]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/185/Information-Retrieval-and-the-Semantic-Web</link>
  <description><![CDATA[Information retrieval technology has been central to the success of
the Web.  For semantic web documents or annotations to have an impact,
they will have to be compatible with IR technology.  We discuss three
approaches to using conventional IR systems with documents and
annotations in semantic web languages.  Each has been implemented.
Conference on System Sciences]]></description>
  <dc:date>2005-01-03</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/resource/html/id/82/foafPub-dataset">
  <title><![CDATA[foafPub dataset]]></title>
  <link>http://ebiquity.umbc.edu/resource/html/id/82/foafPub-dataset</link>
  <description><![CDATA[The FOAF (Friend of a Friend) vocabulary has become one of the most used semantic web ontologies and can be found in millions of RDF documents on the web. FOAF is used to describe basic attributes of people and relationships among them.

foafPub is a dataset of information extracted from FOAF files
collected during the Fall of 2004.  The data represents 7118 foaf
documents collected from 2044 sites (identified by their symbolic IP
address). A total of 201,612 RDF triples with provenance ...]]></description>
  <dc:date>2005-02-23</dc:date>
 </item>
</rdf:RDF>

