Discretization of Continuous-Valued Attributes and Instance-Based Learning

@inproceedings{Basser1994DiscretizationOC,
  title={Discretization of Continuous-Valued Attributes and Instance-Based Learning},
  author={Kai Ming Basser},
  year={1994}
}
  • Kai Ming Basser
  • Published 1994
Recent work on discretization of continuous-valued attributes in learning decision trees has produced some positive results. This paper adopts the idea of discretization of continuous-valued attributes and applies it to instance-based learning (Aha, 1990; Aha, Kibler & Albert, 1991). Our experiments have shown that instance-based learning (IBL) usually performs well in continuous-valued attribute domains and poorly in nominal attribute domains. Cost and Salzberg (1993) have devised the modiied… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

56 Citations

01020'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

A Benchmark For Classifier Learning

View 3 Excerpts
Highly Influenced

Decision Trees in Numerical Attribute Spaces.

IJCAI 1993 • 1993
View 6 Excerpts
Highly Influenced

Program for machine

J. R. Quinlan
1993
View 2 Excerpts

Induction of Decision Trees

Machine Learning • 1986
View 2 Excerpts