Learning by discovering conflicts

George V. Lashkia, Laurence Anthony

研究成果: Conference contribution

抄録

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.

元の言語English
ホスト出版物のタイトルLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
編集者Y. Xiang, B. Chaib-draa
ページ492-497
ページ数6
2671
出版物ステータスPublished - 2003
外部発表Yes
イベント16th Conference of the Canadian Society for Computational Studies of Intelligence - Halifax, Canada
継続期間: 2003 6 112003 6 13

Other

Other16th Conference of the Canadian Society for Computational Studies of Intelligence
Canada
Halifax
期間03/6/1103/6/13

Fingerprint

Learning algorithms
Decision making

ASJC Scopus subject areas

  • Hardware and Architecture

これを引用

Lashkia, G. V., & Anthony, L. (2003). Learning by discovering conflicts. : Y. Xiang, & B. Chaib-draa (版), Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (巻 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). 版 / Y. Xiang; B. Chaib-draa. 巻 2671 2003. p. 492-497.

研究成果: Conference contribution

Lashkia, GV & Anthony, L 2003, Learning by discovering conflicts. : Y Xiang & B Chaib-draa (版), Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 巻. 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. : Xiang Y, Chaib-draa B, 編集者, Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 巻 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). 編集者 / Y. Xiang ; B. Chaib-draa. 巻 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

AN - SCOPUS:7044249182

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 -