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
  • EER-CONCEPTOOL: a "reasonable" environment for schema and ontology sharing

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

    We propose a system which supports knowledge sharing through the articulation of the overlapping components in two or more schemas or ontologies. EER-CONCEPTOOL uses description logics (DLs) to formalise and capture some of the relevant features of knowledge described using an enhanced entity-relationship (EER) model. We describe how DL-based reasoning can provide a relevant part of the semi-autom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic testing framework for digital integrated circuits

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

    In order to reduce the time-to-market and simplify gate-level test generation for digital integrated circuits, GA-based functional test generation techniques are proposed for behavioral and register transfer level designs. The functional tests generated can be used for design verification, and they can also be reused at lower levels (i.e. register transfer and logic gate levels) for testability an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study for fusion of different sources to determine relevance

    Publication Year: 2002, Page(s):515 - 520
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    The relevance of a Web document could be measured not only by its text content, but also by some other factors such as the link connectivity and usage patterns. In previous data fusion researches, the text is the only source to determine the relevance, and only the different runs (e.g. by different retrieval models, different query or document representations) on this same source are combined. It ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A neural network-based segmentation tool for color images

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

    The paper focuses on the development of an efficient and accurate tool for segmenting color images. The segmentation is a problem that has been widely studied since machine vision first evolved as a research area. The neural network segmentation tools and technology developed and presented in this paper show great potential in application where the accuracy is the major factor. Similar requirement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining characteristic rules for understanding simulation data

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

    The Marine Corps' Project Albert seeks to model complex phenomenon by observing the behavior of relatively simple simulations over thousands of runs. These simulations are based upon lightweight agents, whose essential behavior has been distilled down to a small number of rules. By varying the parameters of these rules, Project Albert simulations can explore emergent complex nonlinear behaviors wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A TMO based approach to structuring real-time agents

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

    Mobile agent structuring is an increasingly practiced branch of distributed computing software engineering. In this paper we discuss the major issues encountered in producing real-time (RT) agents which are designed to perform output actions in a manner meeting specified timing requirements. An approach to structuring RT agents, which is an extension of a high-level real-time distributed object pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On temporal planning as CSP

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

    Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical planners into two categories: (i) planners do... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of AI planning techniques to automated code synthesis and testing

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

    Rapid growth in the demand for embedded systems and the increased complexity of embedded software pose an urgent need for advanced embedded software development techniques. One attractive approach is to enable semi-automated code generation and integration of systems from components. However, the implementation and validation of these systems requires a steep learning curve due to the large number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trace-scaling agent for parallel application tracing

    Publication Year: 2002, Page(s):494 - 499
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1455 KB) | HTML iconHTML

    Tracing and performance analysis tools are an important component in the development of high performance applications. Tracing parallel programs with current tracing tools, however, easily leads to large trace files with hundreds of Megabytes. The storage, visualization, and analysis of such trace files is often difficult. We propose a trace-scaling agent for tracing parallel applications, which l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TimeSleuth: a tool for discovering causal and temporal rules

    Publication Year: 2002, Page(s):375 - 380
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (459 KB) | HTML iconHTML

    Discovering causal and temporal relations in a system is essential to understanding how it works, and to learning to control the behaviour of the system. TimeSleuth is a causality miner that uses association relations as the basis for the discovery of causal and temporal relations. It does so by introducing time into the observed data. TimeSleuth uses C4.5 as its association discoverer, and by usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An intelligent brokering system to support multi-agent Web-based 4th-party logistics

    Publication Year: 2002, Page(s):154 - 161
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1164 KB) | HTML iconHTML

    An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the Web is proposed. In our system, customers specify job requests over the Web dynamically. An e-marketplace allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies in the e-marketplace optimally deciding which agents' bids should be satisfied based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculus of variations in discrete space for constrained nonlinear dynamic optimization

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

    We propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and space. We first show that path dominance in dynamic programming cannot be applied when there are general constraints that span across multiple stages, and that node dominance, in the form of Euler-Lagrange conditions developed in optima... 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 (9)
    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.
  • 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.
  • 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 neural-network approach to modeling and analysis

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

    A backpropagation network can always be used in modeling. This study is concerned with the stability problem of a neural network (NN) system which consists of a few subsystems represented by NN models. In this paper, the dynamics of each NN model is converted into linear inclusion representation. Subsequently, based on the representations, the stability conditions in terms of Lyapunov's direct met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software quality classification modeling using the SPRINT decision tree algorithm

    Publication Year: 2002, Page(s):365 - 374
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB) | HTML iconHTML

    Predicting the quality of system modules prior to software testing and operations can benefit the software development team. Such a timely reliability estimation can be used to direct cost-effective quality improvement efforts to the high-risk modules. Tree-based software quality classification models based on software metrics are used to predict whether a software module is fault-prone or not fau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative co-learning: a model-based approach for solving multi-agent reinforcement problems

    Publication Year: 2002, Page(s):463 - 468
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    Solving multiagent reinforcement learning problems is a key issue. Indeed, the complexity of deriving multiagent plans, especially when one uses an explicit model of the problem, is dramatically increasing with the number of agents. This papers introduces a general iterative heuristic: at each step one chooses a sub-group of agents and update their policies to optimize the task given the rest of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crane scheduling using tabu search

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

    We examine crane scheduling for ports. This important component of port operations management is studied when certain spatial constraints, which are common to crane operations, are considered. Although there has been some work on crane scheduling, such spatial constraints have not been previously developed. We assume that ships can be divided into holds and that cranes can move from hold to hold b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining finite state automata and a greedy learning algorithm to determine the syntactic roles of commas

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

    A method has been developed and implemented that assigns syntactic roles to commas. Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no train... 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.
  • 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.