EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Learning on hierarchical trees with Random Forest

Raquel Almeida, Laurent Amsaleg, Zenilton Kleber G. Do Patrocínio Júnior, Ewa Kijak, Simon Malinowski, Silvio Jamil Ferzoli Guimarães

Journal of the Brazilian Computer Society · 26.01.2026 · 32 (1) · 26-42

DOI: 10.5753/jbcs.2026.4242 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the Brazilian Computer Society, online erschienen am 26.01.2026. Verfasst von Raquel Almeida und 5 weiteren Autor:innen. Die Arbeit nennt 84 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hierarchies, as described in mathematical morphology, represent nested regions of interest and provide mechanisms to create coherent data organization. They facilitate high-level analysis and management of large amounts of data. Represented as hierarchical trees, they have formalisms intersecting with graph theory and generalizable applications. Due to the deterministic algorithms, the multiform representations, and the absence of a direct quality evaluation, it is hard to insert hierarchical information into a learning framework and benefit from the recent advances. Researchers usually tackle this problem by refining the hierarchies for a specific media and assessing their quality for a particular task. The downside of this approach is that it depends on the application, and the formulations limit the generalization to similar data. This work aims to create a learning framework that can operate with hierarchical data and is agnostic to the input and application. The idea is to transform the data into a regular representation required by most learning models while preserving the rich information in the hierarchical structure. The proposed methods use edge-weighted image graphs and hierarchical trees as input, and they evaluate different proposals on the edge detection and segmentation tasks. The learning model is the Random Forest, a fast and scalable method for working with high-dimensional data. Results demonstrate that it is possible to create a learning framework dependent only on the hierarchical data that presents a state-of-the-art performance in multiple tasks.

Zitieren

APA

Almeida, R., Amsaleg, L., Júnior, Z. K. G. D. P., Kijak, E., Malinowski, S., & Guimarães, S. J. F. (2026). Learning on hierarchical trees with Random Forest. Journal of the Brazilian Computer Society, 32(1), 26-42. https://doi.org/10.5753/jbcs.2026.4242

Vancouver

Almeida R, Amsaleg L, Júnior ZKGDP, Kijak E, Malinowski S, Guimarães SJF. Learning on hierarchical trees with Random Forest. Journal of the Brazilian Computer Society. 2026;32(1):26-42. doi:10.5753/jbcs.2026.4242

BibTeX
@article{Almeida2026,
  author = {Almeida, Raquel and Amsaleg, Laurent and Júnior, Zenilton Kleber G. Do Patrocínio and Kijak, Ewa and Malinowski, Simon and Guimarães, Silvio Jamil Ferzoli},
  title = {Learning on hierarchical trees with Random Forest},
  journal = {Journal of the Brazilian Computer Society},
  year = {2026},
  volume = {32},
  number = {1},
  pages = {26--42},
  doi = {10.5753/jbcs.2026.4242}
}
Kostenlos starten →