Summarizing Fuzzy Decision Forest by subclass discovery

Christophe Marsala 1, 2, * Maria Rifqi 3, 2
* Corresponding author
2 LFI - Learning, Fuzzy and Intelligent systems
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Construction of forest of decision trees method is a popular tool in machine learning because of its good performances in terms of classification power as well as in computational cost. In this paper, we address two problems. The first one concerns the interpretability of a forest. Indeed, comparing to a single decision tree, a forest loose its ability to be easily understandable by an end-user. The second studied problem concerns the size of the forest and hence the memory size and classification time of a forest. We seek for a forest as small as possible that classify nearly as well as a larger forest. In order to solve these two problems, we propose to characterize a forest by discovering different classes of trees regarding their power of classification. These classes are discovered thanks to Forest's algorithm [1] of class segmentation, a variant of the hypersphere classifier [2].
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Maria Rifqi <>
Submitted on : Monday, September 14, 2015 - 3:06:49 PM
Last modification on : Thursday, March 21, 2019 - 1:06:57 PM
Long-term archiving on: Tuesday, December 29, 2015 - 1:45:12 AM


Files produced by the author(s)



Christophe Marsala, Maria Rifqi. Summarizing Fuzzy Decision Forest by subclass discovery. IEEE International Conference on Fuzzy Systems, FUZZIEEE’2013, Jul 2013, Hyderabad, India. pp.1-6, ⟨10.1109/FUZZ-IEEE.2013.6622579⟩. ⟨hal-01198855⟩



Record views


Files downloads