<?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:MastersThesis rdf:about="http://ebiquity.umbc.edu/paper/html/id/559/Group-recognition-in-social-networks">
		<rdfs:label><![CDATA[Group recognition in social networks]]></rdfs:label>
		<pub:title><![CDATA[Group recognition in social networks]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2011-06-01T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Recent years have seen an exponential growth in the use of social networking
systems, enabling their users to easily share information with their connections. A
typical Facebook user, as an example, might have 300-400 connections that include
relatives, friends, business associates and casual acquaintances. Sharing information
with such a large and diverse set of people without violating social norms or privacy
can be challenging. Allowing users to define groups and restrict information sharing
by group reduces the problem but introduces new ones: managing groups and their
members, relations and information sharing policies. This thesis addresses the
problem of maintaining group membership.
We describe a system that learns to classify a user's new connections into one
or more existing groups based on the connection's attributes and relations. We
demonstrate the approach using data collected from real Facebook users. The two
major tasks are identifying the relevant features for the classification and selecting the
learning mechanism that best suits the task. Hierarchical and overlapping groups pose
another significant challenge. We show that our system classifies new connections
into these groups with high accuracy even with only 10-20% of labeled data.]]></pub:abstract>
		<pub:counter>3045</pub:counter>
		<pub:publisher><![CDATA[University of Maryland, Baltimore County]]></pub:publisher>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Nagapradeep/Chinnam"><person:name><![CDATA[Nagapradeep Chinnam]]></person:name><rdfs:label><![CDATA[Nagapradeep Chinnam]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest rdf:resource="&rdf;nil" />
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Nagapradeep/Chinnam"><person:name><![CDATA[Nagapradeep Chinnam]]></person:name><rdfs:label><![CDATA[Nagapradeep Chinnam]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/592.pdf]]></pub:softCopyURI>
			<pub:softCopySize>4125432</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:MastersThesis>

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

</rdf:RDF>
