Convex hulls in concept induction

D. A. Newlands; G. I. Webb

Convex hulls in concept induction

D. A. Newlands, G. I. Webb

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Abstract

This paper investigates modelling concepts as a few, large convex hulls rather than as many, small, axis-orthogonal divisions as is done by systems which currently dominate classification learning. It is argued that this approach produces classifiers which have less strong hypothesis language bias and which, because of the fewness of the concepts induced, are more understandable. The design of such a system is described and its performance is investigated. Convex hulls are shown to be a useful inductive generalisation technique offering rather different biases than well-known systems such as C4.5 and CN2. The types of domains where convex hulls can be usefully employed are described.

Original language	English
Title of host publication	Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings
Editors	Lizhu Zhou, Ning Zhong
Publisher	Springer
Pages	306-316
Number of pages	11
ISBN (Print)	3540658661, 9783540658665
Publication status	Published - 1 Jan 1999
Externally published	Yes
Event	Pacific-Asia Conference on Knowledge Discovery and Data Mining 1999 - Beijing, China Duration: 26 Apr 1999 → 28 Apr 1999 Conference number: 3rd https://link.springer.com/book/10.1007/3-540-48912-6 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1574
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Pacific-Asia Conference on Knowledge Discovery and Data Mining 1999
Abbreviated title	PAKDD 1999
Country/Territory	China
City	Beijing
Period	26/04/99 → 28/04/99
Internet address	https://link.springer.com/book/10.1007/3-540-48912-6 (Proceedings)

Keywords

Classification learning
Convex hulls
Induction

Cite this

Newlands, D. A., & Webb, G. I. (1999). Convex hulls in concept induction. In L. Zhou, & N. Zhong (Eds.), Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings (pp. 306-316). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1574). Springer.

Newlands, D. A. ; Webb, G. I. / Convex hulls in concept induction. Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings. editor / Lizhu Zhou ; Ning Zhong. Springer, 1999. pp. 306-316 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1c54fb245a59463ead738fd3efade446,

title = "Convex hulls in concept induction",

abstract = "This paper investigates modelling concepts as a few, large convex hulls rather than as many, small, axis-orthogonal divisions as is done by systems which currently dominate classification learning. It is argued that this approach produces classifiers which have less strong hypothesis language bias and which, because of the fewness of the concepts induced, are more understandable. The design of such a system is described and its performance is investigated. Convex hulls are shown to be a useful inductive generalisation technique offering rather different biases than well-known systems such as C4.5 and CN2. The types of domains where convex hulls can be usefully employed are described.",

keywords = "Classification learning, Convex hulls, Induction",

author = "Newlands, \{D. A.\} and Webb, \{G. I.\}",

year = "1999",

month = jan,

day = "1",

language = "English",

isbn = "3540658661",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "306--316",

editor = "Lizhu Zhou and Ning Zhong",

booktitle = "Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings",

address = "Switzerland",

note = "Pacific-Asia Conference on Knowledge Discovery and Data Mining 1999, PAKDD 1999 ; Conference date: 26-04-1999 Through 28-04-1999",

url = "https://link.springer.com/book/10.1007/3-540-48912-6",

}

Newlands, DA & Webb, GI 1999, Convex hulls in concept induction. in L Zhou & N Zhong (eds), Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1574, Springer, pp. 306-316, Pacific-Asia Conference on Knowledge Discovery and Data Mining 1999, Beijing, China, 26/04/99.

Convex hulls in concept induction. / Newlands, D. A.; Webb, G. I.
Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings. ed. / Lizhu Zhou; Ning Zhong. Springer, 1999. p. 306-316 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1574).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Convex hulls in concept induction

AU - Newlands, D. A.

AU - Webb, G. I.

N1 - Conference code: 3rd

PY - 1999/1/1

Y1 - 1999/1/1

N2 - This paper investigates modelling concepts as a few, large convex hulls rather than as many, small, axis-orthogonal divisions as is done by systems which currently dominate classification learning. It is argued that this approach produces classifiers which have less strong hypothesis language bias and which, because of the fewness of the concepts induced, are more understandable. The design of such a system is described and its performance is investigated. Convex hulls are shown to be a useful inductive generalisation technique offering rather different biases than well-known systems such as C4.5 and CN2. The types of domains where convex hulls can be usefully employed are described.

AB - This paper investigates modelling concepts as a few, large convex hulls rather than as many, small, axis-orthogonal divisions as is done by systems which currently dominate classification learning. It is argued that this approach produces classifiers which have less strong hypothesis language bias and which, because of the fewness of the concepts induced, are more understandable. The design of such a system is described and its performance is investigated. Convex hulls are shown to be a useful inductive generalisation technique offering rather different biases than well-known systems such as C4.5 and CN2. The types of domains where convex hulls can be usefully employed are described.

KW - Classification learning

KW - Convex hulls

KW - Induction

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

M3 - Conference Paper

AN - SCOPUS:84947752107

SN - 3540658661

SN - 9783540658665

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 316

BT - Methodologies for Knowledge Discovery and Data Mining - 3rd Pacific-Asia Conference, PAKDD 1999, Proceedings

A2 - Zhou, Lizhu

A2 - Zhong, Ning

PB - Springer

T2 - Pacific-Asia Conference on Knowledge Discovery and Data Mining 1999

Y2 - 26 April 1999 through 28 April 1999

ER -

Convex hulls in concept induction

Abstract

Publication series

Conference

Keywords

Other files and links

Cite this