<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-21T06:37:36Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/49620" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/49620</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Roth, Dan</dc:contributor>
          <dc:creator>Mayhew, Stephen</dc:creator>
          <dc:date>2014-05-30T16:52:43Z</dc:date>
          <dc:date>2014-05-30T16:52:43Z</dc:date>
          <dc:date>2014-05</dc:date>
          <dc:date>2014-05-30T16:52:43Z</dc:date>
          <dc:date>2014-05</dc:date>
          <dc:description>We begin by giving a comprehensive literature review that ties together many
fields which have heretofore remained separate. We comment on the approaches
from each field and show which algorithms are similar and which are different.
Then, starting from a concrete task, we extend traditional trustworthiness
algorithms to deal with the more complex situation of multiclass list-valued
trustworthiness. In addition, we introduce a learned predictive method based
on standard classification algorithms.
In the last section, we explore the theory of trustworthiness and begin to
make progress towards charting the space of all trustworthiness graphs. We
address the commonly underestimated importance of the structure of a trust-
worthiness graph, and define a space in which to work as well as defining the
solvability of a trustworthiness graph. Finally, we provide recommendations for
future work.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-04-30T17:10:06Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 6
Makefile: 805 bytes, checksum: b0e8244611e1219b067b99c8fa588cbc (MD5)
uiucthesis2009.sty: 16947 bytes, checksum: e6071d028db7167274c9f3aa9d83fb5f (MD5)
uiucthesis2009.cls: 17122 bytes, checksum: 1020a993eb754707c3a9fedaafac8c46 (MD5)
Mayhew_Stephen.tex: 83289 bytes, checksum: 591a93167cd51caa4ad82c846458a5d5 (MD5)
thesis.pdf: 306369 bytes, checksum: 47ffc6ba80ed5854c59d2ddee2e6df15 (MD5)
Mayhew_Stephen.pdf: 306369 bytes, checksum: 47ffc6ba80ed5854c59d2ddee2e6df15 (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2014-05-30T16:52:43Z (GMT). No. of bitstreams: 6
Stephen_Mayhew.pdf: 306369 bytes, checksum: 47ffc6ba80ed5854c59d2ddee2e6df15 (MD5)
Makefile: 805 bytes, checksum: b0e8244611e1219b067b99c8fa588cbc (MD5)
uiucthesis2009.sty: 16947 bytes, checksum: e6071d028db7167274c9f3aa9d83fb5f (MD5)
uiucthesis2009.cls: 17122 bytes, checksum: 1020a993eb754707c3a9fedaafac8c46 (MD5)
Mayhew_Stephen.tex: 83289 bytes, checksum: 591a93167cd51caa4ad82c846458a5d5 (MD5)
license.txt: 4063 bytes, checksum: 1d941b001c1d7ad616d8659ead1a0ef0 (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/49620</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2014 Stephen Mayhew</dc:rights>
          <dc:subject>Trustworthiness</dc:subject>
          <dc:subject>data fusion</dc:subject>
          <dc:subject>crowdsourcing</dc:subject>
          <dc:subject>machine learning</dc:subject>
          <dc:subject>natural language processing</dc:subject>
          <dc:title>Trustworthiness and the importance of graph structure</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>MS:Computer Science -UIUC</program>
            <programCode>10KS0112MS</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
