Hendrik Blockeel
ABSTRACT
We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree learners in a few crucial, well-motivated details. Experiments on synthetic and real-life datasets confirm the beneficial effect of these differences and show that the resulting system outperforms the existing multi-instance decision tree learners.
- Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101, 285--297.]]Google Scholar
Digital Library
- Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and regression trees. Belmont: Wadsworth.]]Google Scholar
- Cestnik, B. (1990). Estimating probabilities: A crucial task in machine learning. Proceedings of the 9th European Conference on Artificial Intelligence (pp. 147--149). London: Pitman.]]Google Scholar
- Chevaleyre, Y., & Zucker, J.-D. (2001). Solving multiple instance and multiple part learning problems with decision trees and rule sets, application to the mutagenesis problem. 14th Canadian Conference on Artificial Intelligence (pp. 204--214).]] Google ScholarDigital Library
- Cohen, W. (1995). Fast effective rule induction. Proceedings of the twelfth International Conference on Machine Learning (pp. 115--123). Morgan Kaufmann.]]Google ScholarDigital Library
- Dietterich, T. G., Lathrop, R. H., & Lozano-Péérez, T. (1997). Solving the multiple-instance problem with axis-parallel rectangles. Artificial Intelligence, 89, 31--71.]] Google ScholarDigital Library
- Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81--106.]] Google ScholarCross Ref
- Ruffo, G. (2000). Learning single and multiple instance decision trees for computer security applications. Doctoral dissertation, Department of Computer Science, University of Torino.]]Google Scholar
- Srinivasan, A., Muggleton, S., Sternberg, M., & King, R. (1996). Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85, 277--299.]] Google ScholarDigital Library
- Xu, X. (2003). Statistical learning in multiple instance problems. Master's thesis, University of Waikato.]]Google Scholar
- Multi-instance tree learning
Recommendations
On the relation between multi-instance learning and semi-supervised learning
ICML '07: Proceedings of the 24th international conference on Machine learningMulti-instance learning and semi-supervised learning are different branches of machine learning. The former attempts to learn from a training set consists of labeled bags each containing many unlabeled instances; the latter tries to exploit abundant ...
Constrained instance clustering in multi-instance multi-label learning
In multi-instance multi-label (MIML) learning, datasets are given in the form of bags, each of which contains multiple instances and is associated with multiple labels. This paper considers a novel instance clustering problem in MIML learning, where the ...
Weakly-supervised multi-view multi-instance multi-label learning
IJCAI'20: Proceedings of the Twenty-Ninth International Joint Conference on Artificial IntelligenceMulti-view, Multi-instance, and Multi-label Learning (M3L) can model complex objects (bags), which are represented with different feature views, made of diverse instances, and annotated with discrete nonexclusive labels. Existing M3L approaches assume a ...
Comments