<?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 project "http://ebiquity.umbc.edu/ontology/project.owl#">
  <!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
  <!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.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:project = "&project;"
  xmlns:person = "&person;"
  xmlns:pub = "&pub;"
  xmlns:assert = "&assert;">
  <pub:InProceedings rdf:about="http://ebiquity.umbc.edu/paper/html/id/406/Detecting-Commmunities-via-Simultaneous-Clustering-of-Graphs-and-Folksonomies">
    <rdfs:label><![CDATA[Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies]]></rdfs:label>
    <pub:title><![CDATA[Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies]]></pub:title>
    <pub:publishedOn rdf:datatype="&xsd;dateTime">2008-08-24T00:00:00-05:00</pub:publishedOn>
    <pub:abstract><![CDATA[We present a simple technique for detecting communities by utilizing both the link structure and folksonomy (or tag) information that is readily available in most social media systems. A simple way to describe our approach is by defining a community as a set of nodes in a graph that link more frequently to within this set than outside it and they share similar tags. Our technique is based on the Normalized Cut (NCut) algorithm and can be easily and efficiently implemented. We validate our method by using a real network of blogs and tag information obtained from a social bookmarking site. We also verify our results on a citation network for which we have access to ground truth cluster information. Our method, Simultaneous Cut (SimCut), has the advantage that it can group related tags and cluster the nodes simultaneously.]]></pub:abstract>
    <pub:note><![CDATA[(Held in conjunction with The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008))]]></pub:note>
    <pub:counter>1536</pub:counter>
    <pub:tag><![CDATA[blog]]></pub:tag>
    <pub:tag><![CDATA[social media]]></pub:tag>
    <pub:tag><![CDATA[folksonomy]]></pub:tag>
    <pub:tag><![CDATA[clustering]]></pub:tag>
    <pub:booktitle><![CDATA[Proceedings  of the Tenth Workshop on Web Mining and Web Usage Analysis (WebKDD)]]></pub:booktitle>
    <pub:publisher><![CDATA[ACM ]]></pub:publisher>
    <pub:author>
       <rdf:List>
         <rdf:first><person:Alumnus rdf:about="http://ebiquity.umbc.edu/person/html/Akshay/Java/"><person:name><![CDATA[Akshay  Java]]></person:name><rdfs:label><![CDATA[Akshay  Java]]></rdfs:label></person:Alumnus></rdf:first>
         <rdf:rest>
           <rdf:List>
             <rdf:first><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Anupam/Joshi/"><person:name><![CDATA[Anupam  Joshi]]></person:name><rdfs:label><![CDATA[Anupam  Joshi]]></rdfs:label></person:PrincipalFaculty></rdf:first>
             <rdf:rest>
               <rdf:List>
                 <rdf:first><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></rdf:first>
                 <rdf:rest rdf:resource="&rdf;nil" />
               </rdf:List>
             </rdf:rest>
           </rdf:List>
         </rdf:rest>
       </rdf:List>
    </pub:author>
    <pub:firstAuthor><person:Alumnus rdf:about="http://ebiquity.umbc.edu/person/html/Akshay/Java/"><person:name><![CDATA[Akshay  Java]]></person:name><rdfs:label><![CDATA[Akshay  Java]]></rdfs:label></person:Alumnus></pub:firstAuthor>
    <pub:softCopy><pub:SoftCopy>
      <pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
      <pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/408.pdf]]></pub:softCopyURI>
      <pub:softCopySize>625665</pub:softCopySize>
    </pub:SoftCopy></pub:softCopy>
    <pub:softCopy><pub:SoftCopy>
      <pub:softCopyFormat><![CDATA[Microsoft PowerPoint]]></pub:softCopyFormat>
      <pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/411.ppt]]></pub:softCopyURI>
      <pub:softCopySize>10895360</pub:softCopySize>
    </pub:SoftCopy></pub:softCopy>
  </pub:InProceedings>

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

</rdf:RDF>
