{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/49620"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/49620","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Trustworthiness and the importance of graph structure","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Mayhew, Stephen"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Roth, Dan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-05-30T16:52:43Z","date_published":"2014-05-30T16:52:43Z","updated_at":"2026-07-22T22:25:38Z","subjects":["Trustworthiness","data fusion","crowdsourcing","machine learning","natural language processing"],"languages":["en"],"rights":["Copyright 2014 Stephen Mayhew"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/49620","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Roth, Dan"]},{"key":"dc:creator","label":"Author","values":["Mayhew, Stephen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-05-30T16:52:43Z","2014-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Trustworthiness","data fusion","crowdsourcing","machine learning","natural language processing"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Stephen Mayhew"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/49620"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-04-30T17:10:06Z Item was in collections: University of Illinois Theses & 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)","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)"]},{"key":"dc:title","label":"Title","values":["Trustworthiness and the importance of graph structure"]}]}],"canonical_facts":{"dc:contributor":["Roth, Dan"],"dc:creator":["Mayhew, Stephen"],"dc:date":["2014-05-30T16:52:43Z","2014-05"],"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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-04-30T17:10:06Z Item was in collections: University of Illinois Theses & 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)","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:identifier":["http://hdl.handle.net/2142/49620"],"dc:language":["en"],"dc:rights":["Copyright 2014 Stephen Mayhew"],"dc:subject":["Trustworthiness","data fusion","crowdsourcing","machine learning","natural language processing"],"dc:title":["Trustworthiness and the importance of graph structure"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:38Z"}