A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees

By W. Meisel, D. Michalopoulos. 1973

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Recent advances in decision trees: an updated survey (2022, background): “…are more computationally expensive than their heuristical counterparts, which is why despite similar ideas having been explored in the past (Meisel and Michalopoulos 1973; Bennett and Blue 1996), the approach only started to flourish with the hardware advancements of recent years…”
Mining optimal decision trees from itemset lattices (2007, background): “[14] studied a slightly different setting in 1973, which we would call more common today: multiple examples can have the same class labels, and even numerical attributes are allowed.”
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey (1998, methodology): “Re nement techniques attempted include dynamic programming [241], fuzzy logic search [373] and multi-linear programming [23].”
Optimal constraint-based decision tree induction from itemset lattices (2010, background): “Meisel and Michalopoulos (1973) studied a setting which is more common today, in which multiple examples can have the same class label, and numerical attributes are allowed.”