Created | Wed, 25 Jan 2017 14:12:41 +0000 |
Published | Wed, 25 Jan 2017 14:30:57 +0000 |
Algorithm | BigML Memory Tree |
Split criterion | |
Support threshold | |
Depth threshold | 512 |
Node threshold | 512 |
Missing splits | No |
Statistical pruning | Smart pruning |
This is perhaps the best known database to be found in the pattern recognition literature. Fisher's paper is a classic in the field and is referenced frequently to this day. (See Duda & Hart, for example.) The data set contains 3 classes of 50 instances each, where each class refers to a type of iris plant.
Source
Bache, K. & Lichman, M. (2013). UCI Machine Learning Repository. Irvine, CA: University of California, School of Information and Computer Science.