Show simple item record

Files in this item

Cover for Extensible Operators for Comparison Queries of Uncertain Graphs
dc.contributor.advisorSingh, Lisaen
dc.creatoren
dc.date.accessioned2013-05-15T16:46:45Zen
dc.date.available2014-05-15T04:10:08Zen
dc.date.created2011en
dc.date.issueden
dc.date.submitted01/01/2011en
dc.identifier.otherAPT-BAG: georgetown.edu.10822_557956.tar;APT-ETAG: 2a6b969782049fc422a4faaf09c4f1d7en
dc.identifier.urien
dc.descriptionM.S.en
dc.description.abstractObservational scientists study animal societies in their natural settings to understand their social relationships and behavior. Such social network data can be captured as a graph, where nodes represent observed animals and edges represent common sightings. A researcher observing a particular animal may be uncertain about its identification or behavior. This uncertainty can be expressed as existence probabilities associated with nodes and/or edges, and attribute value probabilities. Comparing these uncertain graphs is necessary to answer questions about changes in animal sociality over time, similarities of local animal communities to the general animal population, differences among animal subgroups across locations, and observation bias across researchers, to name a few. A variety of tools, databases, algorithms, and research consider analysis of probabilistic data. Similar, but mostly disjoint work has been done on graph analysis. To the best of our knowledge, there are no existing tools or research results that combine both in a general way for the purpose of uncertain graph comparison. The thesis addresses this gap by proposing a collection of operators for comparing uncertain graphs and a supporting extensible system architecture for using these operators in queries. We also present a prototype implementation of the system architecture that includes a basic query language in an existing visual graph mining tool and demonstrate the utility of the proposed operators and architecture using data from the Shark Bay Dolphin Research Project. The main contribution of this work is the development of a system architecture that facilitates creating new operators as compositions of existing ones or as new, independent ones. As demonstrated, this architecture could serve as the basis for developing simple query languages that enable scientists and others to write their own ad-hoc uncertain graph comparison queries without extensive programming knowledge.en
dc.formatPDFen
dc.format.extent114 leavesen
dc.languageenen
dc.publisherGeorgetown Universityen
dc.sourceGeorgetown University-Graduate School of Arts & Sciencesen
dc.sourceComputer Scienceen
dc.subjectcomparison operatorsen
dc.subjectgraph query languageen
dc.subjectgraphsen
dc.subjectsystem architectureen
dc.subjectuncertain graph comparisonen
dc.subjectuncertaintyen
dc.subject.lcshComputer scienceen
dc.subject.otherComputer scienceen
dc.titleExtensible Operators for Comparison Queries of Uncertain Graphsen
dc.typethesisen
gu.embargo.terms1-yearen


This item appears in the following Collection(s)

Show simple item record