By Topic

Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on

Date 15-15 Nov. 2000

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings 12th IEEE Internationals Conference On Tools With Artificial Intelligence

    Publication Year: 2000, Page(s):iii - ix
    Request permission for commercial reuse | PDF file iconPDF (305 KB)
    Freely Available from IEEE
  • Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (878 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2000, Page(s):426 - 427
    Request permission for commercial reuse | PDF file iconPDF (111 KB)
    Freely Available from IEEE
  • Transforming supervised classifiers for feature extraction

    Publication Year: 2000, Page(s):274 - 280
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Supervised feature extraction is used in data classification and (unlike unsupervised feature extraction) it uses class labels to evaluate the quality of the extracted features. It can be computationally inefficient to perform exhaustive searches to find optimal subsets of features. This article proposes a supervised linear feature extraction algorithm based on the use of multivariate decision tre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to incremental SVM learning algorithm

    Publication Year: 2000, Page(s):268 - 273
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    The classification algorithm that is based on a support vector machine (SVM) is now attracting more attention, due to its perfect theoretical properties and good empirical results. In this paper, we first analyze the properties of the support vector (SV) set thoroughly, then introduce a new learning method, which extends the SVM classification algorithm to the incremental learning area. The theore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent content-based retrieval

    Publication Year: 2000, Page(s):262 - 265
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    This paper deals with the challenge of extending classical image retrieval by including visual rules. The visual rules are extracted automatically from classes of images. They contribute to making the retrieval process more accurate. The visual-rules extraction is based on symbolic representations of image descriptors. The symbolic representations are the results of color and texture clustering View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building efficient partial plans using Markov decision processes

    Publication Year: 2000, Page(s):156 - 163
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Markov decision processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given goal, accounting for actuator uncertainties. But algorithms classically used to solve MDPs are intractable for problems requiring a large state space. Plans are computed considering the whole state space, without using a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Bayesian classifier in relevant feedback of image retrieval

    Publication Year: 2000, Page(s):258 - 261
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Relevance feedback is a powerful technique in content-based image retrieval (CBIR) and has been an active research area for the past few years. In this paper, we propose a new relevance feedback approach based on a Bayesian classifier, and it treats positive and negative feedback examples with different strategies. For positive examples, a Bayesian classifier is used to determine the distribution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategies for optimizing image processing by genetic and evolutionary computation

    Publication Year: 2000, Page(s):151 - 154
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    We examine the results of previous attempts to apply genetic and evolutionary computation (GEC) to image processing. In many problems, the accuracy (quality) of solutions obtained by GEC-based methods is better than that obtained by others such as conventional methods, neural networks (NNs) and simulated annealing (SA). However, the computation time required is satisfactory in some problems, where... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object tracking and multimedia augmented transition network for video indexing and modeling

    Publication Year: 2000, Page(s):250 - 257
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    S.C. Chen et al. (1999) proposed a multimedia augmented transition network (ATN) model, together with its multimedia input strings, to model and structure video data. This multimedia ATN model was based on an ATN model that had been used within the artificial intelligence (AI) arena for natural-language understanding systems, and its inputs were modeled by multimedia input strings. The temporal an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture image segmentation method based on multilayer CNN

    Publication Year: 2000, Page(s):147 - 150
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The paper presents a new texture feature extraction method called simple texel scale feature (STSF) based on the scale and orientation information of texels, and a new texture image segmentation method based on binary image processing is introduced. The scale information of texels is extracted by comparing the gray value of two pixels. The relation of the positions of these two pixels shows the fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective retrieval of object pose from video

    Publication Year: 2000, Page(s):242 - 249
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Introduces a novel approach for rigid object pose estimation. The system rotates a reference frame of the object of interest until it reaches a view at which the rotated reference view and the unknown-pose view seem to be “similar”. A number of pose similarity measures were tested for different types of objects undergoing various amounts of rotation from the reference pose. We demonstr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing a learning-automata-based controller for client/server systems: a methodology

    Publication Year: 2000, Page(s):422 - 425
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    A client/server model which employs a polling policy as its access strategy is considered. We propose a learning-automata-based approach for polling in order to improve the throughput-delay performance of the system. Each client has an associated queue and the server performs selective polling such that the next client to be served is identified by a learning automaton. The learning automaton upda... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed multimedia knowledge based environment for modeling over the Internet

    Publication Year: 2000, Page(s):140 - 146
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The paper describes a knowledge-based scalable multimedia environment for graph based modeling and the design of complex objects over the Internet. A complex object is modeled as a directed hierarchical graph with each sub-component abstracted as a node and the shared parameters between two components as an edge. The knowledge base archives and retrieves reusable components, and integrates multipl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The n-dimensional projective approach as a tool for spatial reasoning

    Publication Year: 2000, Page(s):237 - 240
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    In this paper, we describe the n-dimensional projective approach as a hierarchical and modular architecture with a processing mechanism that underlies both spatial backtracking and multiple physical properties of entities. Also, it is shown in Euclidean space how cognitive activities of an agent are improved in terms of flexibility (e.g. alternative solutions), reliability (e.g. error recovery) an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization tool for interactive learning of large decision trees

    Publication Year: 2000, Page(s):28 - 35
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Decision tree induction is certainly among the most applicable learning techniques due to its power and simplicity. However learning decision trees from large datasets, particularly in data mining, is quite different from learning from small or moderately sized datasets. When learning from large datasets, decision tree induction programs often produce very large trees. How to efficiently visualize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained genetic algorithms and their applications in nonlinear constrained optimization

    Publication Year: 2000, Page(s):286 - 293
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    The paper presents a problem-independent framework that unifies various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not necessarily differentiable and continuous. The framework is based on the first-order necessary and sufficient conditions in the theory of discrete constrained optimization using Lagrange multipliers. It implements the searc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristics for the exam scheduling problem

    Publication Year: 2000, Page(s):172 - 175
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    As part of the process of creating a campus-wide timetabling system for the National University of Singapore, the authors investigated examination-scheduling algorithms. The challenge in exam scheduling is to draw up the final examination timetable, taking into account a number of different constraints. The authors propose a different approach when the interexamination gaps (termed paper spread) o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge pruning in decision trees

    Publication Year: 2000, Page(s):40 - 43
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    We propose a novel pruning method of decision trees based on domain knowledge, semantic hierarchies among classes, which is used to generate decision trees by relaxing the levels of hierarchies for both height and width of the trees. We develop the algorithm, and the effectiveness is examined by UCI Machine Learning Repository: On Car Evaluation and Nursery. We can generate the decision trees cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging knowledge-based applications with a generic toolkit

    Publication Year: 2000, Page(s):182 - 185
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    Knowledge refinement tools assist in the debugging and maintenance of knowledge based systems (KBSs) by attempting to identify and correct faults in the knowledge that account for incorrect problem-solving. Most refinement systems target a single shell and are able to refine only KBSs implemented in this shell. Our KRUSTWorks toolkit is unusual in that it provides refinement facilities that can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge based system: an object case approach

    Publication Year: 2000, Page(s):190 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    We propose an object based system to represent domain knowledge and to store it in libraries for reuse, following a case based paradigm. Our tool is generic enough to model any problem which requires a legal qualification. This kind of problem requires cooperation between several knowledge domains (e.g., medical practice and legal evaluation). The proposed case model captures the necessary expert'... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The probably approximately correct (PAC) population size of a genetic algorithm

    Publication Year: 2000, Page(s):199 - 202
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Probably approximately correct learning, PAC-learning, is a framework for the study of learnability and learning machines. In this framework, learning is induced through a set of examples. The size of this set is such that with probability greater than 1-δ the learning machine shows an approximately correct behavior with error no greater than ε. The authors use the PAC framework to deri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support based measures applied to ice hockey scoring summaries

    Publication Year: 2000, Page(s):352 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    We present the hockey line extraction (HLE) algorithm, which examines ice hockey scoring summaries in an attempt to determine a team's lines. The players on a hockey team are divided into units called “lines” that appear together on the ice. The HLE algorithm uses single link clustering, support based measures and positional information to identify lines of players. The hockey lines so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency checking for Euclidean spatial constraints: a dimension graph approach

    Publication Year: 2000, Page(s):333 - 342
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial constraints among objects. The basic idea is to project the spatial constraints on both X and Y dimensions, and to construct a dimension graph on each dimension. Using a dimension graph representation transforms the problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using heuristic-based optimizers to handle the personal computer configuration problems

    Publication Year: 2000, Page(s):108 - 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Given the diversity of PC hardware components, and the limited compatibility between some of these hardware components, most people are interested to obtain a (sub)optimal configuration for some specific usage restricted by their budget limits and other possible criteria. We firstly formulate the widely occurring configuration problems as discrete optimization problems. More interestingly, we prop... View full abstract»

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