By Topic

2009 21st IEEE International Conference on Tools with Artificial Intelligence

Date 2-4 Nov. 2009

Filter Results

Displaying Results 1 - 25 of 134
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (453 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (163 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Table of contents

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

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

    Publication Year: 2009, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (94 KB) | HTML iconHTML
    Freely Available from IEEE
  • ICTAI 2009 Committees

    Publication Year: 2009, Page(s):xvii - xviii
    Request permission for commercial reuse | PDF file iconPDF (101 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009, Page(s):xix - xx
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • FlockStream: A Bio-Inspired Algorithm for Clustering Evolving Data Streams

    Publication Year: 2009, Page(s):1 - 8
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (571 KB) | HTML iconHTML

    Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics, and an offline phase that generates the clusters by using the summary data. In this paper we propose a data stream clustering method based on a multi-agent system that uses a decentralized bottom-up self-organizing stra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Complete Framework for Clustering Trajectories

    Publication Year: 2009, Page(s):9 - 16
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    The increasing availability of huge amounts of thin data, i.e. data pertaining to time and positions generated by different sources with a wide variety of technologies (e.g., RFID tags, GPS, GSM networks) leads to large spatio-temporal data collections. Mining such amounts of data is challenging, since the possibility to extract useful information from this peculiar kind of data is crucial in many... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Repeating Pattern Mining with Gap Requirements

    Publication Year: 2009, Page(s):17 - 24
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    In this paper, we define a new research problem for mining approximate repeating patterns (ARP) with gap constraints, where the appearance of a pattern is subject to an approximate matching, which is very common in biological sciences. To solve the problem, we propose an ArpGap (Approximate repeating pattern mining with Gap constraints) algorithm with three major components for approximate repeati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering Relational Data: A Transactional Approach

    Publication Year: 2009, Page(s):25 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    A methodology for clustering multi-relational data is proposed. Initially, tuple linkages in the database schema of the multi-relational entities are leveraged to virtually organize the available relational data into as many transactions, i.e. sets of feature-value pairs. The identified transactions are then partitioned into homogeneous groups. Each discovered cluster is equipped with a representa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour Extraction of Drosophila Embryos

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

    Contour extraction of Drosophila (fruit fly) embryos is an important step to build a computational system for matching expression pattern of embryonic images to assist the discovery of the nature of genes. Automatic contour extraction of embryos is challenging due to severe image variations, including i) the size, orientation, shape and appearance of an embryo of interest; ii) the neighboring cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Method for 3-Dimensional Modeling and Application to Complex Objects

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

    The process of creating photorealistic 3-dimensional computer graphic (3DCG) images is divided into two stages, i.e., modeling and rendering. Automatic rendering has gained popularity, and photorealistic rendering is generally used to render different types of images. However, professional artists still model characters manually. Moreover, not much progress has been achieved with regard to 3-D sha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Delivery Rate for Real-Time Mobile Streaming Video

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

    Due to the limited computing resources of cell phones and the relative lack of bandwidth of cell phone networks, broadcasting live streaming video from cell phone camera is challenging. Prior work has shown that data compression using wavelet and sub-band aligned integer run-length encoding can produce real-time streaming video. However, such transmissions can result in numerous dropped video fram... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Growing Neural Gas Networks to Represent Visual Object Knowledge

    Publication Year: 2009, Page(s):54 - 58
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    We present a so-called neural map, a novel memory framework for visual object recognition and categorization systems. The properties of its computational theory include self-organization and intelligent matching of the image features that are used to build their object models. Its performance for representing the visual object knowledge comprised by these models and for recognizing unknown objects... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on the Relationships of Classifier Performance Metrics

    Publication Year: 2009, Page(s):59 - 66
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    There is no general consensus on which classifier performance metrics are better to use as compared to others. While some studies investigate a handful of such metrics in a comparative fashion, an evaluation of specific relationships among a large set of commonly-used performance metrics is much needed in the data mining and machine learning community. This study provides a unique insight into the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring Software Quality Classification with a Wrapper-Based Feature Ranking Technique

    Publication Year: 2009, Page(s):67 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB) | HTML iconHTML

    Feature selection is a process of selecting a subset of relevant features for building learning models. It is an important activity for data preprocessing used in software quality modeling and other data mining problems. Feature selection algorithms can be divided into two categories, feature ranking and feature subset selection. Feature ranking orders the features by a criterion and a user select... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Study on Wrapper-Based Feature Ranking

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

    Feature selection has become the cornerstone of many classification problems. It has been applied in many domains such as Web mining, text categorization, gene expression microarray analysis, image analysis, and combinatorial chemistry. One type of well-studied feature selection methodology is filtering, which is typically divided into ranking and subset evaluation. This work provides an empirical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Dimensional Software Engineering Data and Feature Selection

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

    Software metrics collected during project development play a critical role in software quality assurance. A software practitioner is very keen on learning which software metrics to focus on for software quality prediction. While a concise set of software metrics is often desired, a typical project collects a very large number of metrics. Minimal attention has been devoted to finding the minimum se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency

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

    In this paper, a semantic generalization of neighbourhood substitutability is presented. Instead of the syntactical concept of supports, our generalization originally exploits a new semantic measure based on single arc-consistency (SAC) checking. This generalization is then exploited in two different ways. Firstly, a new pretreatment of constraints networks is proposed. Secondly, as SAC is a basic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness

    Publication Year: 2009, Page(s):99 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    CNF simplifiers play a very important role in minimising structured problem hardness. Although they can be used in an in-search process, most of them serve in a pre-search phase and rely on one form or another of resolution. Based on our understanding about problem structure, in the paper, we extend the single pre-search process to a multiple one in order to further simplify the hard structure in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Autarkies Searching for the Dynamic Partition of CNF Formulae

    Publication Year: 2009, Page(s):107 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    In this paper an original dynamic partition of formulae in conjunctive normal form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenmeyer and further investigated by Kullmann and Van Gelder. Intuitively, an autarky is a partial assignment satisfying some clauses while not affecting any literal in any other clause, leading to a partition of the CNF formul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tree Decomposition Based Approach to Solve Structured SAT Instances

    Publication Year: 2009, Page(s):115 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    The main purpose of the paper is to solve structured instances of the satisfiability problem. The structure of a SAT instance is represented by an hypergraph, whose vertices correspond to the variables and the hyper-edges to the clauses. The proposed method is based on a tree decomposition of this hyper-graph which guides the enumeration process of a DPLL-like method. During the search, the method... View full abstract»

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