Learning by discovering conflicts

George V. Lashkia, Laurence Anthony

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper describes a novel approach to inductive learning based on a 'conflict estimation based learning' (CEL) algorithm. CEL is a new learning strategy, and unlike conventional methods CEL does not construct explicit abstractions of the target concept Instead, CEL classifies unknown examples by adding them to each class of the training examples and measuring how much noise is generated. The class that results in the least noise, i.e., the class that least conflicts with the given example is chosen as the output. In this paper, we describe the underlying principles behind the CEL algorithm, a methodology for its construction, and then summarize convincing empirical evidence mat suggests that CEL can be a perfect solution in real-world decision making applications.

Original languageEnglish
Title of host publicationLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
EditorsY. Xiang, B. Chaib-draa
Pages492-497
Number of pages6
Volume2671
Publication statusPublished - 2003
Externally publishedYes
Event16th Conference of the Canadian Society for Computational Studies of Intelligence - Halifax, Canada
Duration: 2003 Jun 112003 Jun 13

Other

Other16th Conference of the Canadian Society for Computational Studies of Intelligence
CountryCanada
CityHalifax
Period03/6/1103/6/13

Fingerprint

Learning algorithms
Decision making

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Lashkia, G. V., & Anthony, L. (2003). Learning by discovering conflicts. In Y. Xiang, & B. Chaib-draa (Eds.), Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2671, pp. 492-497)

Learning by discovering conflicts. / Lashkia, George V.; Anthony, Laurence.

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). ed. / Y. Xiang; B. Chaib-draa. Vol. 2671 2003. p. 492-497.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lashkia, GV & Anthony, L 2003, Learning by discovering conflicts. in Y Xiang & B Chaib-draa (eds), Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). vol. 2671, pp. 492-497, 16th Conference of the Canadian Society for Computational Studies of Intelligence, Halifax, Canada, 03/6/11.
Lashkia GV, Anthony L. Learning by discovering conflicts. In Xiang Y, Chaib-draa B, editors, Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). Vol. 2671. 2003. p. 492-497
Lashkia, George V. ; Anthony, Laurence. / Learning by discovering conflicts. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). editor / Y. Xiang ; B. Chaib-draa. Vol. 2671 2003. pp. 492-497
@inproceedings{b8ff648d273041b1bae1f4aea4be936a,
title = "Learning by discovering conflicts",
abstract = "The paper describes a novel approach to inductive learning based on a 'conflict estimation based learning' (CEL) algorithm. CEL is a new learning strategy, and unlike conventional methods CEL does not construct explicit abstractions of the target concept Instead, CEL classifies unknown examples by adding them to each class of the training examples and measuring how much noise is generated. The class that results in the least noise, i.e., the class that least conflicts with the given example is chosen as the output. In this paper, we describe the underlying principles behind the CEL algorithm, a methodology for its construction, and then summarize convincing empirical evidence mat suggests that CEL can be a perfect solution in real-world decision making applications.",
author = "Lashkia, {George V.} and Laurence Anthony",
year = "2003",
language = "English",
volume = "2671",
pages = "492--497",
editor = "Y. Xiang and B. Chaib-draa",
booktitle = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",

}

TY - GEN

T1 - Learning by discovering conflicts

AU - Lashkia, George V.

AU - Anthony, Laurence

PY - 2003

Y1 - 2003

N2 - The paper describes a novel approach to inductive learning based on a 'conflict estimation based learning' (CEL) algorithm. CEL is a new learning strategy, and unlike conventional methods CEL does not construct explicit abstractions of the target concept Instead, CEL classifies unknown examples by adding them to each class of the training examples and measuring how much noise is generated. The class that results in the least noise, i.e., the class that least conflicts with the given example is chosen as the output. In this paper, we describe the underlying principles behind the CEL algorithm, a methodology for its construction, and then summarize convincing empirical evidence mat suggests that CEL can be a perfect solution in real-world decision making applications.

AB - The paper describes a novel approach to inductive learning based on a 'conflict estimation based learning' (CEL) algorithm. CEL is a new learning strategy, and unlike conventional methods CEL does not construct explicit abstractions of the target concept Instead, CEL classifies unknown examples by adding them to each class of the training examples and measuring how much noise is generated. The class that results in the least noise, i.e., the class that least conflicts with the given example is chosen as the output. In this paper, we describe the underlying principles behind the CEL algorithm, a methodology for its construction, and then summarize convincing empirical evidence mat suggests that CEL can be a perfect solution in real-world decision making applications.

UR - http://www.scopus.com/inward/record.url?scp=7044249182&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7044249182&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2671

SP - 492

EP - 497

BT - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

A2 - Xiang, Y.

A2 - Chaib-draa, B.

ER -