A dynamic-programming algorithm for hierarchical discretization of continuous attributes

Discretization techniques can be used to reduce the number of values for a given continuous attribute, and a concept hierarchy can be used to define a discretization of a given continuous attribute. Traditional methods of building a concept hierarchy from a continuous attribute are usually based on...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 184; no. 2; pp. 636 - 651
Main Authors:	Shen, Ching-Cheng, Chen, Yen-Liang
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.01.2008 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Concept hierarchy Continuous data Data mining Dynamic programming Optimization algorithms Studies Concept hierarchy Dynamic programming Continuous data Data mining
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!