Novel Static Multi-Layer Forest Approach and Its Applications
Open Access
- 20 October 2021
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 9 (21) , 2650
Abstract
The existing multi-layer tree is of dynamic linked list type which has many limitations and is complicated due to the pointer-node structure. Static array representation gives more flexibility in programming of algorithms and operations like insertion, deletion, and search. It also reduces the storage space. This paper presents a new method for representing multi-layer forest data structure in array format. It also explains various tree operations, unique data compression algorithm and migration algorithm between traditional approach and the proposed data structure. Most of the fundamental algorithms like those from artificial intelligence that employ decision trees are based on trees/forest data structure. The current paper brings a completely new idea in the representation of these data structures without employing recursion and targeting memory optimizations with reduced code complexities. The applications of forest data structures are many and span over various interdisciplinary areas of Engineering, Medicine, Aviation, Locomotive, Marine, etc. The proposed novel approach not just introduces a new method to look at the tree data structure but also provides the flexibility to adapt to the existing methods as per the user needs. A few such applications in Simulink debugging and the Forest visualisation have been discussed in detail in this paper.Keywords
This publication has 23 references indexed in Scilit:
- Minimizing Carbon Dioxide Emissions Due to Container Handling at Marine Container Terminals via Hybrid Evolutionary AlgorithmsIEEE Access, 2017
- Improved Range Minimum Queries2016
- Fully Functional Static and Dynamic Succinct TreesACM Transactions on Algorithms, 2014
- Rank Entropy-Based Decision Trees for Monotonic ClassificationIEEE Transactions on Knowledge and Data Engineering, 2011
- Recursive Partitioning2010
- A method for the construction of minimum-redundancy codesResonance, 2006
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Efficient lossless compression of trees and graphs2002
- Random ForestsMachine Learning, 2001
- A Technique for High-Performance Data CompressionComputer, 1984