Skip to main content
SpringerLink
Log in

ELA—A new Approach for Learning Agents

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

In this paper we discuss a new incremental learning approach used to implement adaptive behavior in autonomous agents. Adaptive agents must increase their performance based on experience using some learning approach. Often, incremental learning techniques like memory-based reasoning (MBR) are used. However, traditional MBR algorithms require an adequate (generally complex) measure of similarity, need much data and spend much time for computing similarities between examples. Such problems are unacceptable for autonomous agents that live in very dynamic environments, because they have little time to make decisions. Our approach does not use similarity measures between examples, classifies examples very fast and can compact data. We represent data as a concept graph (CG), each node representing a partition of the data. We propose an algorithm that uses the partitions to classify new examples. We compare our results with other techniques and conclude that the method performs quite well. Finally, we apply the approach to an application of adaptive agents for personalizing web search.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • R. Agrawal, and R. Srikant, ‘‘Mining sequential patterns’’, Philip S. Yu and Arbee L. P. Chen (eds.), Proceedings of the 11th International Conference on Data Engineering - ICDE, IEEE Press, 6 October, 3–14 pp 1995. (ISBN 0-8186-6910-1).

  • D. W. Aha D. Kibler M. K. Albert (1991) ArticleTitleInstance-based learning algorithms Machine Learning 6 37–66

    Google Scholar 

  • J.-P. Barthès, ‘‘OMAS v 1.0. Memo UTC/GI/DI/N 151, Université de Technologie de Compiègne’’, Département de Génie Informatique, Jannuary, 2002.

  • S. D. Bay, and M. J. Pazzani, ‘‘Detecting change in categorical data: Mining contrast sets,’’ Knowledge Discovery and Data Mining, pp. 302–306, 1999.

  • S. Benson, ‘‘Inductive learning of reactive action models’’, ICML’95, pp. 47–54, 1995.

  • D. Billsus, and M. Pazzani, A hybrid user model for news story classification. in Proceedings of the Seventh International Conference on User Modeling (UM ‘99), Banff. Canada. 1999.

  • C. Blake, C. J. Merz, ‘‘UCI Repositoryofmachine learningdatabases–www.ics.uci.edu/ \(\tilde{m}\) learn/MLRepository.html’’. Irvine, CA: University of California, Department of Information and Computer Science.

  • L. B. Brooker D. E. Goldberg J. H. Holland (1989) ArticleTitleClassifier systems and genetic algorithms Artificial Intelligence 40 235–282

    Google Scholar 

  • W. Brenner, R. Zarnekow, H. Wittig, ‘‘Intelligent software agents’’, Springer-Verlag. 1998. ISBN 3-540-63411-8.

  • H. Brighton, C. Mellish, ‘‘Advances in instance selection for instance-based learning algorithms,’’ Data Mining and Knowledge Discovery. Kluwer Academic Publishers. no. 6, pp. 153--172, 2002.

  • J. Chapelle, O. Simonin, J. Ferber, ‘‘How situated agents can learn to cooperate by monitoring their neighborsśatisfaction’’, F. van Harmelen (ed.), in ECAIÓ2, IOS Press, pp. 68–72, 2002. ISBN 1-58603-257-7.

  • P. Cunningham, B. Smyth, and T. Veale, ‘‘On the limitations of memory based reasoning’’, in Proceedings of the 2nd European Workshop on Case-Based Reasoning, Paris, 1994.

  • K. Dorer, ‘‘Behavior networks for continuous domains using situation-dependent motivations’’, in Proceedings of the IJCAI9’9, pp. 1233–1238, 1999. http://citeseer.nj.nec.com/dorer99behavior.html.

  • P. W. Eklund, A. Hoang, ‘‘A performance survey of public domain supervised machine learning algorithms’’, in Technical Report of Knowledge Visualisation and Ordering, http://www.kvocentral. com/kvopapers/7paper.pdf.

  • B. Faltings (1997) ArticleTitle‘‘Qualitative models as indices for memory-based prediction’‘ IEEE Expert vol. may–june 47–53

    Google Scholar 

  • Foundations for intelligent physical agents http://www.fipa.org.

  • R. E. Fikes N. J. Nilsson (1971) ArticleTitle‘‘STRIPS: A new approach to the application of theorem proving to problem solving’‘ Artificial Intelligence vols. 3–4 IssueIDno. 2 189–208

    Google Scholar 

  • E. A. Fox, and J. A. Shaw, ‘‘Combination of multiple searches. The second text retrieval conference (TREC-2)’’, in Government Printing Office Washinghton D.C., Gaithersburg, MD, USA, March, 1994.

  • J. H. Friedman, R. kohavi, Y. Yun, ‘‘Lazy decision trees’’, in S. Howard and S. Ted (eds.), Proc. of the Thirteenth National Conference on Artificial Intelligence, AAAI Press pp. 717–724, 1996.

  • F. Gasparetti, and A. Micarelli, ‘‘Adaptive web based on a colony de cooperative distributed agents’’, in M. Klusch. A. Omicini. S. Ossowski and H. Laama-nen (eds.), Proceedings of the 7th Cooperative Information Agents. Springer-Verlag. LNAI 2782., pp. 168–183 Helsinki, August, 2003. ISBN 3-540-40798-7.

  • J. A. Gonzales, L. B. Holder, and D. J. Cook, ‘‘Graph-based concept learning’’, Proceedings of the Fourteenth Annual Florida AI Research Symposium, pp. 377–381, 2001.

  • J. H. Holland, ‘‘Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems,’’ In R. S. Michalski, J. G. Carbonell, T. M. Mitchell (eds.), Machine Learning, an Artificial Intelligence Approach, Morgan Kauffman, vol 2, 1986.

  • J. H. Holmes P. L. Lanzi S Stolzman S. W. Wilson (2002) ArticleTitle‘‘Learning classifier systems New models, successful applications’‘ Information Processing Letters 2 23–30

    Google Scholar 

  • Java agent development framework, http://sharon.cselt.it/projects/jade/.

  • S. Kasif S. Salszberg D. Waltz J. Rachlin David Aha (1998) ArticleTitle‘‘A probabilistic framework for memory-based reasoning’‘ Artificial Intelligence 104 IssueID1–2 287–311

    Google Scholar 

  • R. Kohavi, ‘‘Bottom-up induction of oblivious read-once decision graphs: strengths and limitations,’‘Proceedings of the National Conference on Artificial Intelligence, pp. 613--618, 1994.

  • R. Kohavi, D. Sommerfield, J. Dougherty, ‘‘Data Mining using MLC++’’, in IEEE Tools With Artificial Intelligence Best Paper Award, 1996. http://robotics.stanford.edu/ ronnyk/mlc96.ps.Z.

  • R. Kozierok, and P. Maes, ‘‘A learning interface agent for scheduling meetings’’, In Proceedings of the Fourteenth International Workshop on Intelligent User Interfaces, pp. 81–88, Orlando, USA, 1993.

  • Y. Lashkari, M. Metral, and P. Maes, ‘‘Collaborative interface agents’’, Proceedings of the Twelfth National Conference on Artificial Intelligence, vol. 1, AAAI Press, Seatle, WA, 1994.

  • H. Lieberman, ‘‘Autonomous interface agents’’, Proceedings of the ACM Conference on Computer and Human Interface, Atlanta, March, 1997.

  • H. Lieberman, ‘‘Intelligent Profiling by Example’’, Proceedings of the International Conference on Intelligent user Interfaces (IUI 2000), Santa Fé, January 14–17, 2001.

  • P. Maes, ‘‘Learning behavior networks from experience’’, Proceedings of the First Conference on Artificial Life, F. J. Varela and P. Bourgine (in eds.) MIT Press/Bradford Books, 1992.

  • P. Maes, ‘‘Modeling adaptative autonomous agents’’, Artificial Life Journal, no. 1, vol. 1–2, MIT Press, pp. 135–162, 1994.

  • F. Menczer, G. Pant, P. Srinivasan, and M. E. Ruiz, ‘‘Evaluating topic-driven web crawlers’’, Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 241–249, 2001.

  • D. Michie, D. J. Spiegelhalter, and C.C. Taylor, ‘‘Machine learning, neural and statistical classification’’, Ellis Horwood, 1994, ISBN 0-13-106360-X.

  • S. E. Middleton, ‘‘Interface agents: A review of the field,’‘Technical Report ECSTR-IAM01-001, University of Southampton, UK, 2001.

  • A. Moukas (1997) ArticleTitle‘‘Amalthaea information discovery and filtering using a multiagent evolving ecosystem’‘ Applied Artificial Intelligence: An International Journal 11 IssueID5 437–457

    Google Scholar 

  • D. Maulsby I. H. Witten (1997) ArticleTitle‘‘Teaching agents to learn: from user study to implementation’‘ IEEE Computer 30 IssueID11 36–44

    Google Scholar 

  • N. J. Nilsson (1994) ArticleTitle‘‘Teleo-reactive programs for agent control’‘ Journal of Artificial Intelligence Research 1 139–158

    Google Scholar 

  • Z. Z. Nick, and P. Themis, ‘‘Web search using a genetic algorithm’’, IEEE Internet Computing, pp. 18–26. March–April. 2001.

  • E. Oliveira, ‘‘Agent, advanced features for negotiation and coordination,’’ M. Luck (ed.),ACAI 2001, LNAI 2086In: Springer-Verlag, pp. 173–186, 2001.

  • J.R. Quinlan (1986) ‘‘Induction of decision trees’’, C4.5 Programs for Machine Learning Kluwer Academic Publishers Netherlands 81–106

    Google Scholar 

  • J.R. Quinlan (1993) ‘‘Programs for machine learning’‘ Morgan Kauffman Publishers California

    Google Scholar 

  • C. K. Riesbeck, R. C. Schank, ‘‘Inside case-based reasonning’’, Lawrence Erlbaum Associates, ISBN 0-89859-767-6, 423 EUA, 1989.

  • G. Salton, ‘‘Automatic text processing: The transformations, analysis amd retrieval of information by computer,’‘Addison-Wesley1989.

  • M. Sebag M Shoenauer (1990) ‘‘Incremental learning of rules and meta-rules’‘ B.W. Porter R. Mooney (Eds) Machine Learning Morgan Kaufmann Los Altos/Palo Alto/San Francisco

    Google Scholar 

  • C.Silverstein, M. R. Henzinger, J. Marais, and M. Moricz, ‘‘Analysis of a very large altavista query log’’, ACM SIGIR, no. 33, pp. 6–12, 1999.

  • R. G. Smith, ‘‘A framework for distributed problem solving’’, Proceedings of the 6th International joint Conference on Machine Learning, pp. 836–841, Tokyo, japan, 1979.

  • P.E. Utgoff, ‘‘An improved algorithm for incremental induction of decision trees’’, International Conference on Machine Learning, pp. 318–325, 1994.

  • C. Watkins, ‘‘Learning from deplayed rewards’’, PhD Thesis, King’s College, Cambridge, 1989.

  • D.H. Widyantoro T.R. Ioerger J. Yen (2001) ArticleTitle‘‘Learning user interest dynamics with a three-descriptor representation’‘ Journal of the American Society for Information Science 52 IssueID3 212–225

    Google Scholar 

  • D. R. Wilson A. R. Martinez (2000) ArticleTitle‘‘Instance prunning techniques’‘ Machine Learning 38 IssueID3 257–286

    Google Scholar 

  • B. Zhang Y. Seo (2001) ArticleTitle‘‘Personalized webdocument filtering using reinforcement learning’‘ Applied Artificial Intelligence 15 665–685

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Recherches Royallieu, UTC, Université de Technologie de Compiègne, Compiègne, 60200, France

    Fabrício Enembreck & Jean-Paul Brathès

Authors
  1. Fabrício Enembreck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Paul Brathès
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabrício Enembreck.

Additional information

This research was funded by Région Picardie in France. We thank Emerson Paraiso and Cesar Tacla for comments and time spent with the discussions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Enembreck, F., Brathès, JP. ELA—A new Approach for Learning Agents . Auton Agent Multi-Agent Syst 10, 215–248 (2005). https://doi.org/10.1007/s10458-004-6976-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-004-6976-8

Keywords

Search

Navigation