By Topic

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.

4-6 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 72
  • Proceedings 14th IEEE International Conference on Tools with Artificial Intelligence

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (324 KB)
    Freely Available from IEEE
  • Error-based pruning of decision trees grown on very large data sets can work!

    Publication Year: 2002, Page(s):233 - 238
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    It has been asserted that, using traditional pruning methods, growing decision trees with increasingly larger amounts of training data will result in larger tree sizes even when accuracy does not increase. With regard to error-based pruning, the experimental data used to illustrate this assertion have apparently been obtained using the default setting for pruning strength; in particular, using the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2002, Page(s):547 - 548
    Request permission for commercial reuse | PDF file iconPDF (214 KB)
    Freely Available from IEEE
  • A tool for belief updating over time in Bayesian networks

    Publication Year: 2002, Page(s):284 - 289
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    We have developed a tool that facilitates dynamically updating beliefs with time. This tool addresses directed probabilistic inference networks that may contain cycles, and takes into account the time delays associated with observations and decisions. Relevance of different observers may decay at different rates in the same application, and the belief in a hypothesis decays towards the associated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic analysis of composite solvers

    Publication Year: 2002, Page(s):276 - 283
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers. Analysis of composite solvers is a theoretically and practically important i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-based representation and classification of spatial structures and relations

    Publication Year: 2002, Page(s):268 - 275
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    This paper is concerned with the representation and classification of spatial relations and structures in an object-based knowledge representation system. In this system, spatial structures are defined as sets of spatial entities connected with topological relations. Relations are represented by objects with their own properties. We propose to define two types of properties: the first are concerne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software measurement data analysis using memory-based reasoning

    Publication Year: 2002, Page(s):261 - 267
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    The goal of accurate software measurement data analysis is to increase the understanding and improvement of software development process together with increased product quality and reliability. Several techniques have been proposed to enhance the reliability prediction of software systems using the stored measurement data, but no single method has proved to be completely effective. One of the crit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ontology construction for information selection

    Publication Year: 2002, Page(s):122 - 127
    Cited by:  Papers (27)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential for exchange and retrieval of information is vast and daunting. The key problem in achieving efficient and user-friendly retrieval is the development of a search mechanism to guarantee delivery of minimal irrelevant inform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protein secondary structure prediction with Bayesian learning method

    Publication Year: 2002, Page(s):252 - 257
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    This paper describes a Bayesian learning based approach to protein secondary structure prediction. Four secondary structure types are considered, including α-helix, β-strand, β-turn and coil. A six-letter exchange group is utilized to represent a protein sequence. Training cases are expressed as sequence quaternion. A tool called Predictor is developed in Java that implements the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ontologies for knowledge representation in a computer-based patient record

    Publication Year: 2002, Page(s):114 - 121
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    In contrast to existing patient-record systems, which merely offer static applications for storage and presentation, a helpful patient-record system is a problem-oriented, knowledge-based system, which provides clinicians with situation-dependent information. We propose a practical approach to extend the current data model with (1) means to recognize and interpret situations, (2) knowledge of how ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine learning for software engineering: case studies in software reuse

    Publication Year: 2002, Page(s):246 - 251
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    There are many machine learning algorithms currently available. In the 21st century, the problem no longer lies in writing the learner but in choosing which learners to run on a given data set. We argue that the final choice of learners should not be exclusive; in fact, there are distinct advantages in running data sets through multiple learners. To illustrate our point, we perform a case study on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EasyTransport: an effective navigation and transportation guide for wide geographic areas

    Publication Year: 2002, Page(s):107 - 113
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    In this paper we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the orthogonal range search k-windows algorithm

    Publication Year: 2002, Page(s):239 - 245
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    Clustering, that is the partitioning of a set of patterns into disjoint and homogeneous meaningful groups (clusters), is a fundamental process in the practice of science. k-windows is an efficient clustering algorithm that reduces the number of patterns that need to be examined for similarity. using a windowing technique. It exploits well known spatial data structures, namely the range free, that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context query in information retrieval

    Publication Year: 2002, Page(s):101 - 106
    Cited by:  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    There is an important query requirement missing for search engines. With the wide variation of domain knowledge and user interest, a user would like to retrieve documents in which one query term is discussed in the context of another. Based on existing query mechanisms, what can be specified at most is the co-occurrence of multiple terms in a query. This is insufficient because the co-occurrence o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DSatz: a directional SAT solver for planning

    Publication Year: 2002, Page(s):199 - 208
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    SAT-based planners have been characterized as disjunctive planners that maintain a compact representation of search space of action sequences. Several ideas from refinement planners (conjunctive planners) have been used to improve performance of SAT-based planners or get a better understanding of planning as SAT One important lesson from refinement planning is that backward search being goal direc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lazy divide and conquer approach to constraint solving

    Publication Year: 2002, Page(s):91 - 98
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    A divide and conquer strategy enables a problem to be divided into subproblems, which are solved independently and later combined to form solutions of the original problem. For solving constraint satisfaction problems, however, the divide and conquer technique has not been shown to be effective. This is because it is not possible to cleanly divide a problem into independent subproblems in the pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hiding a logo watermark into the multiwavelet domain using neural networks

    Publication Year: 2002, Page(s):477 - 482
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    This paper proposes a novel watermarking scheme for an image, in which a logo watermark is embedded into the multiwavelet domain of the image using neural networks. The multiwavelet domain provides us with a multiresolution representation of the image like the scalar wavelet case. However, there are four subblocks in the coarsest level of the multiwavelet domain, where there is only one in that of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic refinement of classification rules

    Publication Year: 2002, Page(s):189 - 196
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    Given a set of training examples in the form of (input, output) pairs, induction generates a set of rules that when applied to an input example, can come up with a target output or class for that example. At deduction time, these rules can be applied to a pre-classified test set to evaluate their accuracy. With existing rule induction systems, the rules are "frozen" on the training set, and they c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adjusted network flow for the shelf-space allocation problem

    Publication Year: 2002, Page(s):224 - 229
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (339 KB) | HTML iconHTML

    In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operational realities and to seek solutions with realistic test data. This model is linked to the multidimensional knapsack problem. We first solve a simplified version of the problem to achieve maximum profit by transforming it ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Actions with duration and constraints: the ramification problem in temporal databases

    Publication Year: 2002, Page(s):83 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    The ramification problem is a hard and ever present problem in systems exhibiting dynamic behavior. The area of temporal databases in particular still lacks satisfactory solutions to the ramification problem. In this paper we address the ramification problem based on causal relationships that take time into account. We study the problem for both instantaneous actions and actions with duration. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for extracting XML association rules

    Publication Year: 2002, Page(s):57 - 64
    Cited by:  Papers (3)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (886 KB) | HTML iconHTML

    The recent success of XML as a standard to represent semi-structured data, and the increasing amount of available XML data pose new challenges to the data mining community. In this paper we present the XMINE operator, a tool developed to extract XML association rules for XML documents. The operator, based on XPath and inspired by the syntax of XQuery, allows us to express complex mining tasks, com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reinforcement learning in multiagent systems: a modular fuzzy approach with internal model capabilities

    Publication Year: 2002, Page(s):469 - 474
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1468 KB) | HTML iconHTML

    Most of the methods proposed to improve the learning ability in multiagent systems are not appropriate to more complex multiagent learning problems because the state space of each learning agent grows exponentially in terms of the number of partners present in the environment. We propose a novel and robust multiagent architecture to handle these problems. The architecture is based on a learning fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of component failures in the Space Shuttle main engines using Bayesian belief networks: a feasibility study

    Publication Year: 2002, Page(s):181 - 188
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (441 KB) | HTML iconHTML

    Although the Space Shuttle is a high reliability system, its condition must he accurately diagnosed in real-time. Two problems plague the system - false alarms that may be costly, and missed alarms which may be not only expensive, but also dangerous to the crew. This paper describes the results of a feasibility study in which a multivariate state estimation technique is coupled with a Bayesian bel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated diagnosis of non-native English speaker's natural language

    Publication Year: 2002, Page(s):301 - 306
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1081 KB) | HTML iconHTML

    Typical grammar checking software use some form of natural language parsing to determine if errors exist in the text. If a sentence is found ungrammatical, the grammar checker usually seeks a single grammatical error as an explanation. For non-native speakers of English, it is possible that a given sentence contain multiple errors and grammar checkers may not adequately explain these mistakes. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Graphplan

    Publication Year: 2002, Page(s):138 - 145
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    Significant advances in plan synthesis under classical assumptions have occurred in the last seven years. Such efficient planners are all centralized planners. One very major development among these is the Graphplan planner. Its popularity is clear from its several efficient adaptations/extensions. Since several practical planning problems are solved in a distributed manner it is important to adap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.