<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-014-14-2263</article-id>
      <article-id pub-id-type="publisher-id">30046</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>I.2.6 - Learning</subject>
          <subject>I.5.0 - General</subject>
          <subject>M.0 - KNOWLEDGE ACQUISITION</subject>
          <subject>M.3 - KNOWLEDGE MAINTENANCE</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>The APS Framework For Incremental Learning of Software Agents</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Dudek</surname>
            <given-names>Damian</given-names>
          </name>
          <email xlink:type="simple">ddudek@wsiz.wroc.pl</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">The University of Information Technology and Management "Copernicus", Wroclaw, Poland</addr-line>
        <institution>The University of Information Technology and Management "Copernicus"</institution>
        <addr-line content-type="city">Wroclaw</addr-line>
        <country>Poland</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Damian Dudek (<email xlink:type="simple">ddudek@wsiz.wroc.pl</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2008</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>07</month>
        <year>2008</year>
      </pub-date>
      <volume>14</volume>
      <issue>14</issue>
      <fpage>2263</fpage>
      <lpage>2287</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/5DBE73C1-CBAF-5EAF-877B-FBB6F1E5BE47">5DBE73C1-CBAF-5EAF-877B-FBB6F1E5BE47</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7001815">7001815</uri>
      <permissions>
        <copyright-statement>Damian Dudek</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Adaptive behavior and learning are required of software agents in many application domains. At the same time agents are often supposed to be resource-bounded systems, which do not consume much CPU time, memory or disk space. In attempt to satisfy both requirements, we propose a novel framework, called APS (standing for Analysis of Past States), which provides agent with learning capabilities with respect to saving system resources. The new solution is based on incremental association rule mining and maintenance. The APS process runs periodically in a cycle, in which phases of agent's normal performance intertwine with learning phases. During the former ones an agent stores observations in a history. After a learning phase has been triggered, the history facts are analyzed to yield new association rules, which are added to the knowledge base by the maintenance algorithm. Then the old observations are removed from the history, so that in the next learning runs only recent facts are processed in search of new association rules. Keeping the history small can save both processing time and disk space as compared to batch learning approaches.</p>
      </abstract>
    </article-meta>
  </front>
</article>
