<?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-21T17:41:07Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81622" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81622</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>Gary Dell</dc:contributor>
          <dc:contributor>Roth, Dan</dc:contributor>
          <dc:creator>Harris, Harlan D.</dc:creator>
          <dc:date>2015-09-25T20:19:33Z</dc:date>
          <dc:date>2015-09-25T20:19:33Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2003</dc:date>
          <dc:date>2003</dc:date>
          <dc:description>Another significant goal of this work was to identify the inductive biases of each algorithm, so that they can be fairlycompared with each other. By examining their biases and properties using the results presented here, it is possible to view 2Pes as a particular generalization of the Winnow algorithm, and IDBD as a further generalization of 2Pes. Understanding these relationships furthers the potential of attribute-efficient algorithms for real-world applications.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:19:33Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3101855.pdf: 4540067 bytes, checksum: 5d78ca920fc1799b4531410f6021c53f (MD5)
  Previous issue date: 2003</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82903
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>90 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81622</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3101855</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Artificial Intelligence</dc:subject>
          <dc:title>New Algorithms for Attribute-Efficient on -Line Linear Learning</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
