Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

16th IEEE International Conference on Tools with Artificial Intelligence

15-17 Nov. 2004

Filter Results

Displaying Results 1 - 25 of 123
  • Proceedings. 16th IEEE International Conference on Tools with Artificial Intelligence

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • 16th IEEE International Conference on Tools with Artificial Intelligence - Title Page

    Publication Year: 2004, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • 16th IEEE International Conference on Tools with Artificial Intelligence - Copyright Page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • 16th IEEE International Conference on Tools with Artificial Intelligence - Table of contents

    Publication Year: 2004, Page(s):v - xii
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2004, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (23 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2004, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (28 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2004, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2004, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Knowledge discovery in multiple databases

    Publication Year: 2004
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (30 KB)

    Summary form is only given. Knowledge discovery in multiple databases is an important research area because (1) there is an urgent need for analyzing data in different sources, (2) there are essential differences between mono and multidatabase mining, and (3) there are limitations in existing multidatabase mining efforts. This talk describe a multidatabase mining process, and review some research ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine learning for personalized wireless portals

    Publication Year: 2004
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB) | HTML iconHTML

    Summary form only given. People have access to vast stores of information on the World Wide Web ranging from online publications to electronic commerce. All this information, however, used to be accessible only while users are tethered to a computer at home or in an office. Wireless data and voice access to this vast store allows unprecedented access to information from any location at any time. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting and mitigating security anomalies

    Publication Year: 2004
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (35 KB) | HTML iconHTML

    Summary form only given. Network and information security is of increasing concern as intruders utilize more advanced technologies, and attacks are occurring much more frequently. A simple intrusion can cause an enterprise financial disaster, a threat to national safety, or loss of human life. Network-based and computer-based intrusion detection systems (IDS's) started appearing some twenty years ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining confident minimal rules with fixed-consequents

    Publication Year: 2004, Page(s):6 - 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    Association rule mining (ARM) finds all the association rules in data, that match some measures of interest such as support and confidence. In certain situations where high support is not necessarily of interest, fixed-consequent association-rule mining for confident rules might be favored over traditional ARM. The need for fixed consequent ARM is becoming more evident in a number of applications ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FlowMiner: finding flow patterns in spatio-temporal databases

    Publication Year: 2004, Page(s):14 - 21
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    The widespread use of spatio-temporal databases and applications has fuelled an urgent need to discover interesting time and space patterns in such databases. While much work has been done in discovering time/sequence patterns or spatial patterns, discovering of patterns involving both time and space dimensions is still in its infancy, We introduce the concept of flow patterns. Flow patterns are i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vertical outlier detection algorithm with clusters as by-product

    Publication Year: 2004, Page(s):22 - 29
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Outlier detection can lead to discovering unexpected and interesting knowledge, which is critically important to some areas such as monitoring of criminal activities in electronic commerce, credit card fraud, and the like. In This work, we propose an efficient outlier detection method with clusters as by-product, which works efficiently for large datasets. Our contributions are: a) We introduce a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying variable-length meaningful phrases with correlation functions

    Publication Year: 2004, Page(s):30 - 38
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Finding meaningful phrases in a document has been studied in various information retrieval systems in order to improve the performance. Many previous statistical phrase-finding methods had a different aim such as document classification. Some are hybridized with statistical and syntactic grammatical methods; others use correlation heuristics between words. We propose a new phrase-finding algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of bounds in temporal flexible planning with dynamic controllability

    Publication Year: 2004, Page(s):40 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    A temporal flexible planning problem can be formulated as a simple temporal network with uncertainty (STNU), whose links are classified as contingent and requirement links. The problem of constraint satisfaction for STNU has been characterized as controllability, where dynamic controllability is the most interesting and useful controllability property. We study the assignment of bounds allowed on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical evaluation of optimized stacking configurations

    Publication Year: 2004, Page(s):49 - 55
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    Stacking is one of the most used techniques for combining classifiers and improves prediction accuracy. Early research in stacking showed that selecting the right classifiers, their parameters and the metaclassifiers was the main bottleneck for its use. Most of the research on this topic selects by hand the right combination of classifiers and their parameters. Instead of starting from these initi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MetalP - a new approach to combinatorial optimization: case studies

    Publication Year: 2004, Page(s):56 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    We propose a new approach to solve combinatorial optimization problems. Our approach is simple to implement but powerful in terms of performance and speed. We combine the strengths of a meta-heuristic approach with the integer programming method by partitioning the problem into two interrelated subproblems, where the higher level problem is solved by the metahueristic and the lower level problem i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reactive prohibition-based ant colony optimization (RPACO): a new parallel architecture for constrained clique sub-graphs

    Publication Year: 2004, Page(s):63 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    We introduce a new algorithm that combines the stigmergetic capabilities of the ant colony optimization (AGO) with local search heuristics to solve the maximum and maximum-weighted clique problem. Our new algorithm: A reactive prohibition-based ant colony optimization (RPACOMCP), complements the intelligent ant colony search with a prohibition-based diversification technique, where the amount of d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using directed acyclic graphs to coordinate propagation and search for numerical constraint satisfaction problems

    Publication Year: 2004, Page(s):72 - 81
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    The paper of H. Schichl & A. Neumaier has given the fundamentals of interval analysis on DAGs for global optimization and constraint propagation. We show in This work how constraint propagation on DAGs can be made efficient and practical by: (i) working on partial DAG representations; and (ii) enabling the flexible choice of the interval inclusion functions during propagation. We then propose a ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SAT based BDD solver for quantified Boolean formulas

    Publication Year: 2004, Page(s):82 - 89
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    Solving quantified Boolean formulas (QBF) has become an attractive research area in artificial intelligence. Many important artificial intelligence problems (planning, nonmonotonic reasoning, formal verification, etc.) can be reduced to QBFs. A new DLL-based method is proposed that integrates binary decision diagram (BDD) to set free the variable ordering heuristics that are traditionally constrai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practically handling some configuration isomorphisms

    Publication Year: 2004, Page(s):90 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. A configuration can be viewed as a graph of interconnected components. An inherent difficulty in solving configuration problems is the existence of many structural isomorphisms. A practical way of dealing with isom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable distributed depth-first search with greedy work stealing

    Publication Year: 2004, Page(s):98 - 103
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    We present a framework for the parallelization of depth-first combinatorial search algorithms on a network of computers. Our architecture is intended for a distributed setting and uses a work stealing strategy coupled with a small number of primitives for the processors (which we call workers) to obtain new work and to communicate to other workers. These primitives are a minimal imposition and int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Coverage Based Ensemble Algorithm (CBEA) for streaming data

    Publication Year: 2004, Page(s):106 - 112
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    Ensemble classifier methods have been developed to learn from streaming data, and adapt to concept drift. One strategy employed to adapt to concept drift is to rank the classifiers in the ensemble based on their performance on the most recent samples. However, this strategy is problematic when the samples are coming from different portions of the sample space during different times. Data streams w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distilling classification models from cross validation runs: an application to mass spectrometry

    Publication Year: 2004, Page(s):113 - 119
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    We present work on a proteomics application. More specifically, from the domain of mass-spectrometry and the identification of biomarkers for stroke attacks. Mass-spectrometry based biomarker identification is an application that sets a number of challenges to the knowledge discovery process. We describe how we tackle them and present a number of machine learning experiments that we performed in o... View full abstract»

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