Discretization of Target Attributes for Subgroup Discovery

Authors:
Katherine Moreland;Klaus Truemper
Affiliations:
The MITRE Corporation, McLean, U.S.A. VA 22102;Department of Computer Science, University of Texas at Dallas, Richardson, U.S.A. TX 75083
Venue:
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Year:
2009

Citing 4
Cited 0

A MINSAT Approach for Learning in Logic Domains

INFORMS Journal on Computing
Adapting classification rule induction to subgroup discovery

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Design of Logic-based Intelligent Systems

Design of Logic-based Intelligent Systems
Exploiting background knowledge for knowledge-intensive subgroup discovery

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data and uses them to select the discretization cutpoints. The algorithm has been implemented in a subgroup discovery method. Tests show that the discretization method likely leads to improved insight.