<?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-19T14:03:20Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/26413" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/26413</identifier>
        <datestamp>2023-07-10</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>Chang, Kevin C-C.</dc:contributor>
          <dc:creator>Zhong, Hengzhi</dc:creator>
          <dc:date>2011-08-26T15:34:57Z</dc:date>
          <dc:date>2011-08-26T15:34:57Z</dc:date>
          <dc:date>2013-08-27T10:00:28Z</dc:date>
          <dc:date>2011-08-26T15:34:57Z</dc:date>
          <dc:date>2011-08</dc:date>
          <dc:description>Many applications are interested in mining context-aware sequential patterns such as opinions, common navigation patterns, and product recommendations.  However, traditional sequential pattern mining algorithms are not effective to mine such patterns.  We thus study the problem of searching context-aware patterns on the fly.  As a solution, we presented a variable-order random walk as the ranking model and developed two efficient algorithms GraphCAP and R3CAP.  To show the effectiveness and efficiency of our solution, we conducted extensive experiments on real dataset.  Lastly, we applied our solution to support opinion search, a novel application that significantly differs from traditional opinion mining and retrieval.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-05-24T13:10:01Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Zhong_Hengzhi.pdf: 646889 bytes, checksum: ed0b03be2b1bfa62f2bb60be2626c4ee (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2011-08-26T15:34:57Z (GMT). No. of bitstreams: 2
Zhong_Hengzhi.pdf: 646889 bytes, checksum: ed0b03be2b1bfa62f2bb60be2626c4ee (MD5)
license.txt: 4061 bytes, checksum: 126e631a59a663e58ca0c4005cfb88a9 (MD5)</dc:description>
          <dc:description>Item marked as restricted to the 'Administrator' Group (id=1) by William Ingram (wingram2@illinois.edu) on 2011-08-26T15:35:53Z
Item is restricted until 2013-08-26T15:35:26Z</dc:description>
          <dc:description>Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:28Z
Item was in collections:
University of Illinois Dissertations and Theses (ID: 204)
Dissertations and Theses - Computer Science (ID: 587)
No. of bitstreams: 3
Zhong_Hengzhi.pdf.txt: 66362 bytes, checksum: 6341eb2d3c2c167b43bbe478f050d728 (MD5)
Zhong_Hengzhi.pdf: 646889 bytes, checksum: ed0b03be2b1bfa62f2bb60be2626c4ee (MD5)
license.txt: 4061 bytes, checksum: 126e631a59a663e58ca0c4005cfb88a9 (MD5)</dc:description>
          <dc:description>Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:28Z</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/26413</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2011 Hengzhi Zhong</dc:rights>
          <dc:subject>Sequential pattern mining</dc:subject>
          <dc:subject>opinion search</dc:subject>
          <dc:title>CASM: searching context-aware sequential patterns iteratively</dc:title>
          <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>PHD:Computer Science -UIUC</program>
            <programCode>10KS0112PHD</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
