<?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-20T21:29:44Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/99227" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/99227</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>Han, Jiawei</dc:contributor>
          <dc:creator>Norick, Brandon</dc:creator>
          <dc:date>2018-03-13T15:25:24Z</dc:date>
          <dc:date>2018-03-13T15:25:24Z</dc:date>
          <dc:date>2020-03-14T09:15:16Z</dc:date>
          <dc:date>2017-12-04</dc:date>
          <dc:date>2017-12</dc:date>
          <dc:description>Recommendation is a challenging but important task which has applications in nearly every sector of industry as well as in academia. There are a wide variety of approaches to the recommendation problem, with network-based techniques garnering increasing interest and study in recent years. However, most of these studies only explore the problem in the context of a single relationship between entities, such as a following relationship in a social network like Twitter. Such approaches ignore the complex environment in which most recommendation tasks exist in favor of simplifying the problem. The complexity of human decision making necessitates approaches which can utilize the heterogeneous environments in which the recommendation task is set rather than reducing them to single relationship.
In this work, we explore the problem of entity recommendation without such a simplification, instead we utilize heterogeneous information networks to capture the complexity of the behaviors for which we are seeking to make recommendations. Our proposed approach captures the different behaviors of individuals by examining their heterogeneous relationships in the network and as a result can provide high-quality personalized recommendations from implicit feedback represented in heterogeneous information networks.
We begin by introducing meta-path-based latent features, which capture the connectivity of entities in the network along different paths, giving us a foundation which explicitly accounts for the heterogeneous nature of the task. Upon this foundation we build a global recommendation model using a ranking optimization technique known as Bayesian Personalized Ranking. We extend this global model into a personalized model, building a model which can capture the differences present in the network that describe the preferences of different users. Finally, empirical studies show that our techniques are more effective than several popular and state-of-the-art entity recommendations techniques.</dc:description>
          <dc:description>Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-12-01</dc:description>
          <dc:description>The student, Brandon Norick, accepted the attached license on 2017-12-04 at 12:19.</dc:description>
          <dc:description>The student, Brandon Norick, submitted this Thesis for approval on 2017-12-04 at 12:28.</dc:description>
          <dc:description>This Thesis was approved for publication on 2017-12-04 at 17:38.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #11829 on 2018-03-13 at 09:56:47</dc:description>
          <dc:description>Made available in DSpace on 2018-03-13T15:25:24Z (GMT). No. of bitstreams: 2
NORICK-THESIS-2017.pdf: 671074 bytes, checksum: 1119a60cad27e378efc8fe2383a75deb (MD5)
LICENSE.txt: 4211 bytes, checksum: 6cbb359fd9346dcc039ad6d9911ee1ed (MD5)
  Previous issue date: 2017-12-04</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 105190
Lift date: 2020-03-13T15:25:40Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 105190
Lift date: 2020-03-13T15:28:52Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system</dc:description>
          <dc:description>U of I Only Restriction Lifted for Item 105190 on 2020-03-14T09:15:16Z.</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/99227</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2017 Brandon Norick</dc:rights>
          <dc:subject>Recommender systems</dc:subject>
          <dc:subject>Entity recommendation</dc:subject>
          <dc:subject>Heterogeneous information networks</dc:subject>
          <dc:title>Leveraging heterogeneous information networks for personalized entity recommendation</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
