<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T09:38:13Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/109752" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/109752</identifier><datestamp>2026-05-15T19:44:42Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Jia, Junteng</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Benson, Austin Reilley</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Bindel, David S.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Kleinberg, Jon M.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-09-09T17:40:47Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-06-09T06:00:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 12467</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 28417936</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/109752</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/h1a1-9k27</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">15049573</dim:field>
   <dim:field mdschema="dc" element="description">142 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Graphs are a natural representation for systems with interacting components (e.g. an online social network of users; a transaction network of bank accounts; an interaction network of proteins). As such, algorithms that predict node labels have wide-ranged applications from online content recommendation, fraud detection, to drug discovery. The traditional machine learning setting assumes data points are independently sampled, and thus makes predictions only based on each individual’s attributes. For interconnected vertices in an attributed graph, the correlation along the edges provide an additional source of information. To better understand and leverage those two types of information, we propose data models for attributed graphs that: (1) explain existing graph learning algorithms such as label propagation and graph convolutional network, (2) inspire new algorithms that achieves the state-of-the-art performances, (3) generate synthetic graph attributes that preserves characteristics in real-world data.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject">Attributed Graphs</dim:field>
   <dim:field mdschema="dc" element="subject">Belief Propagation</dim:field>
   <dim:field mdschema="dc" element="subject">Graph Neural Networks</dim:field>
   <dim:field mdschema="dc" element="subject">Label Propagation</dim:field>
   <dim:field mdschema="dc" element="subject">Markov Random Field</dim:field>
   <dim:field mdschema="dc" element="title">Modeling and Inferring Attributed Graphs</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/15049573</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Jia, Junteng</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="70d2ac5b-8648-42b7-910c-a4d6ecaaebb4">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Modeling and Inferring Attributed Graphs&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2021-05&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/h1a1-9k27&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Jia, Junteng&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by/4.0/&lt;/License>
    &lt;Keyword>Attributed Graphs&lt;/Keyword>
    &lt;Keyword>Belief Propagation&lt;/Keyword>
    &lt;Keyword>Graph Neural Networks&lt;/Keyword>
    &lt;Keyword>Label Propagation&lt;/Keyword>
    &lt;Keyword>Markov Random Field&lt;/Keyword>
   	&lt;Abstract>Graphs are a natural representation for systems with interacting components (e.g. an online social network of users; a transaction network of bank accounts; an interaction network of proteins). As such, algorithms that predict node labels have wide-ranged applications from online content recommendation, fraud detection, to drug discovery. The traditional machine learning setting assumes data points are independently sampled, and thus makes predictions only based on each individual’s attributes. For interconnected vertices in an attributed graph, the correlation along the edges provide an additional source of information. To better understand and leverage those two types of information, we propose data models for attributed graphs that: (1) explain existing graph learning algorithms such as label propagation and graph convolutional network, (2) inspire new algorithms that achieves the state-of-the-art performances, (3) generate synthetic graph attributes that preserves characteristics in real-world data.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>