AI 2003: Advances in Artificial Intelligence

16th Australian Conference on AI, Perth, Australia, December 3-5, 2003. Proceedings

  • Tamás (Tom) Domonkos Gedeon
  • Lance Chun Che Fung

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2903)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 2903)

Table of contents

  1. Front Matter
  2. Keynote Papers

    1. Kotagiri Ramamohanarao, James Bailey
      Pages 1-11
    2. B. John Oommen, Govindachari Raghunath, Benjamin Kuipers
      Pages 24-40
    3. Mohan S. Kankanhalli
      Pages 41-52
  3. Ontology

    1. Insu Song, Pushkar Piggott
      Pages 53-64
    2. Seung Yeol Yoo, Achim Hoffmann
      Pages 65-76
    3. Hyunjang Kong, Kwanho Jung, Junho Choi, Wonpil Kim, Pankoo Kim, Jongan Park
      Pages 77-87
  4. Problem Solving

    1. A. Anbulagan, John Thornton, Abdul Sattar
      Pages 100-111
    2. Atsuko Mutoh, Tsuyoshi Nakamura, Shohei Kato, Hidenori Itoh
      Pages 112-124
    3. Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
      Pages 125-136
    4. Wayne Pullan, Liang Zhao, John Thornton
      Pages 137-149
  5. Knowledge Discovery and Data Mining I

    1. Robert Dale, Cecile Paris, Marc Tilbrook
      Pages 150-160
    2. Yingying Wen, Ian H. Witten, Dianhui Wang
      Pages 173-185
    3. Kyongho Min, William H. Wilson, Yoo-Jin Moon
      Pages 186-195
  6. Knowledge Discovery and Data Milling II

    1. Sang-Jun Han, Sung-Bae Cho
      Pages 208-220
    2. Lifang Gu, Jiuyong Li, Hongxing He, Graham Williams, Simon Hawkins, Chris Kelman
      Pages 221-232

About these proceedings

Introduction

Consider the problem of a robot (algorithm, learning mechanism) moving along the real line attempting to locate a particular point ? . To assist the me- anism, we assume that it can communicate with an Environment (“Oracle”) which guides it with information regarding the direction in which it should go. If the Environment is deterministic the problem is the “Deterministic Point - cation Problem” which has been studied rather thoroughly [1]. In its pioneering version [1] the problem was presented in the setting that the Environment could charge the robot a cost which was proportional to the distance it was from the point sought for. The question of having multiple communicating robots locate a point on the line has also been studied [1, 2]. In the stochastic version of this problem, we consider the scenario when the learning mechanism attempts to locate a point in an interval with stochastic (i. e. , possibly erroneous) instead of deterministic responses from the environment. Thus when it should really be moving to the “right” it may be advised to move to the “left” and vice versa. Apart from the problem being of importance in its own right, the stoch- tic pointlocationproblemalsohas potentialapplications insolvingoptimization problems. Inmanyoptimizationsolutions–forexampleinimageprocessing,p- tern recognition and neural computing [5, 9, 11, 12, 14, 16, 19], the algorithm worksits wayfromits currentsolutionto the optimalsolutionbasedoninfor- tion that it currentlyhas. A crucialquestionis oneof determining the parameter whichtheoptimizationalgorithmshoulduse.

Keywords

Ontologie agents artificial intelligence data mining expert system knowledge knowledge discovery learning machine learning neural network problem solving proving

Editors and affiliations

  • Tamás (Tom) Domonkos Gedeon
    • 1
  • Lance Chun Che Fung
    • 2
  1. 1.Department of Computer ScienceAustralian National UniversityActonAustralia
  2. 2.Murdoch University 

Bibliographic information

  • DOI https://doi.org/10.1007/b94701
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20646-0
  • Online ISBN 978-3-540-24581-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book