Tree Construction Algorithm Research Articles

Minimizing the Number of Distrustful Nodes on the Path of IP Packet Transmission

One of the important directions for improving modern Wide Area Networks is efficient and secure packet routing. Efficient routing is often based on using the shortest paths, while ensuring security involves preventing the possibility of packet interception. The work is devoted to improving the security of data transmission in IP networks. A new approach is proposed to minimize the number of distrustful nodes on the path of IP packet transmission. By a distrustful node, we mean a node that works correctly in terms of hardware and software and fully implements its data transport functions, but from the point of view of its organizational subordination, we are not sure that the node will not violate security rules to prevent unauthorized access and interception of data. A distrustful node can be either a transit or an end node. To implement this approach, we modified Dijkstra’s shortest path tree construction algorithm. The modified algorithm ensures that we obtain a path that will pass only through trustful nodes, if such a path exists. If there is no such path, the path will have the minimum possible number of distrustful intermediate nodes. The number of intermediate nodes in the path was used as a metric to obtain the shortest path trees. Routing tables of routers, built on the basis of trees obtained using a modified algorithm, provide increased security of data transmission, minimizing the use of distrustful nodes.

A reliable method for data aggregation on the industrial internet of things using a hybrid optimization algorithm and density correlation degree

The Internet of Things (IoT) is a new information technology sector in which each device may receive and distribute data across a network. Industrial IoT (IIoT) and related areas, such as Industrial Wireless Networks (IWNs), big data, and cloud computing, have made significant strides recently. Using IIoT requires a reliable and effective data collection system, such as a spanning tree. Many previous spanning tree algorithms ignore failure and mobility. In such cases, the spanning tree is broken, making data delivery to the base station difficult. This study proposes an algorithm to construct an optimal spanning tree by combining an artificial bee colony, genetic operators, and density correlation degree to make suitable trees. The trees’ fitness is measured using hop count distances of the devices from the base station, residual energy of the devices, and their mobility probabilities in this technique. The simulation outcomes highlight the enhanced data collection reliability achieved by the suggested algorithm when compared to established methods like the Reliable Spanning Tree (RST) construction algorithm in IIoT and the Hop Count Distance (HCD) based construction algorithm. This proposed algorithm shows improved reliability across diverse node numbers, considering key parameters including reliability, energy consumption, displacement probability, and distance.

Improving Semantic Analysis in Visualization with Meta Network Representation and Parsing Algorithm

This article aims to advance semantic analysis models, particularly in visualization, by proposing a novel semantic representation method utilizing the semantic Meta Network (MNet). MNet is a complex framework comprising semantic elements, internal and external relationships, and feature attributes, defined hierarchically through recursive processes, aiming to depict the comprehensive semantic space from phrase-level components to complete texts. The methodology involves the development of a general construction algorithm for MNet, encompassing meta relationships, tree structures, and network structures, and a Parsing method for specific semantic analysis problems, including a bottom-up specification-based MNet semantic dependency tree construction algorithm and a network construction algorithm tailored for natural language interface parsing. Empirical experiments confirm the effectiveness of these algorithms, particularly in parsing natural language control interface instructions in Supervisory Control and Data Acquisition (SCADA) systems, bridging specific semantic analysis problems with the general construction and parsing processes of MNet, accounting for internal semantics concerning language unit structures and foreign language meanings in the linguistic context, thereby contributing significantly to the field of natural language semantic analysis.

An applied study of multi-layer decision tree optimization algorithms in machine learning

Abstract This paper investigates the multi-layer decision tree optimization algorithm in machine learning and explores its efficiency and accuracy in applying complex data classification. The focus is on the optimization strategy of the algorithm when dealing with large datasets with multiple types of records. The research adopts methods such as data set Discretization, fuzzification processing and hierarchical fuzzy decision tree construction algorithm. Through experimental verification, our constructed multilevel fuzzy decision tree performs well in two application scenarios: rainfall prediction and fingerprint identification. In the rainfall prediction experiment, using 5200 sample data, the algorithm achieves a classification accuracy of 61%. In the fingerprint recognition experiment, from 3,000 fingerprint images, a 100% recognition rate was performed, and the rejection rate was 25.2%. The results show that the multi-layer decision tree optimization algorithm can effectively handle large data sets of multiple types and significantly improve the accuracy and efficiency of classification. The algorithm offers high adaptability and accuracy when dealing with continuous type attributes. This study provides a new perspective and methodology for the application of multi-layer decision trees in machine learning, which is of great significance for the future development of data processing and classification techniques.

Determining the type of explosive item using a decision tree

The present circumstances in Ukraine delineate specific areas of study. The imperative to identify an explosive device is increasingly paramount for adults and particularly for children. Failing to recognize this danger poses a threat to health and life. The paper presents a decision tree method for classifying the type of explosive objects. This allows you to draw conclusions about the type of explosive object hidden depending on the type of soil. This problem is relevant, as it allows to reasonably explain the type of danger depending on various external factors. The paper offers a general representation of the construction of a decision tree for determining the type of explosive objects. In addition, the work provides a visualization of the division into nodes for a visual representation of the construction of a decision tree, taking into account the division into subtrees and nodes. The nodes are the main attributes: voltage, sensor height above ground level, soil type. The decision tree construction algorithm and the structural block diagram of the ID3 algorithm are given. A study was conducted based on who was chosen to measure the entropy decision tree split chaos. The main characteristics of the ID3 algorithm were listed, taking into account the subject area in which it is used. The paper presents one of the built decision trees, which was built as part of research to determine the type of explosive object depending on the possible type of soil, for example, it is dry and sandy soil. Moreover, the paper provides a comparative analysis of the decision tree model against existing methodologies, shedding light on its efficacy, accuracy, and potential advancements in enhancing threat detection capabilities. This comprehensive analysis not only showcases the model's strengths but also offers insights into potential areas for refinement and improvement

SbMBR Tree—A Spatiotemporal Data Indexing and Compression Algorithm for Data Analysis and Mining

In the field of data analysis and mining, adopting efficient data indexing and compression techniques to spatiotemporal data can significantly reduce computational and storage overhead for the abilities to control the volume of data and exploit the spatiotemporal characteristics. However, traditional lossy compression techniques are hardly suitable due to their inherently random nature. They often impose unpredictable damage to scientific data, which affects the results of data mining and analysis tasks that require certain precision. In this paper, we propose a similarity-based minimum bounding rectangle (SbMBR) tree, a tree-based indexing and compression method, to address the aforementioned problem. Our method can hierarchically select appropriate minimum bounding rectangles according to the given maximum acceptable errors and use the average value contained in each selected MBR to replace the original data to achieve data compression with multi-layer loss control. This paper also provides the corresponding tree construction algorithm and range query processing algorithm for the indexing structure mentioned above. To evaluate the data quality preservation in cross-domain data analysis and mining scenarios, we use mutual information as the estimation metric. Experimental results emphasize the superiority of our method over some of the typical indexing and compression algorithms.

The Improvement of Decision Tree Construction Algorithm Based on Quantum Heuristic Algorithms

The Improvement of Decision Tree Construction Algorithm Based on Quantum Heuristic Algorithms

Tree-based Multicast Routing and Channel Assignment for Enhanced Throughout in Emerging Cognitive Radio Networks

In future multi-hop wireless networks like 5G and B5G, efficient large-scale video sharing and data dissemination are expected to rely heavily on multicast routing and Cognitive Radio (CR) technology. While multicast routing is efficient when the network always has access to the spectrum, the dynamic nature of Primary User (PU) activities, heterogeneous spectrum across the CR Network (CRN), and PU access priority make it challenging to implement efficient multicast routing protocols in CRNs. This paper proposes a hierarchical multicast routing mechanism for multi-hop CRNs that exploits the Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) concepts. The proposed multicast routing mechanism consists of tree construction and channel assignment algorithms. The tree-construction algorithm models the network topology as a multicast tree rooted at the CR source and spanning all the CR nodes. Based on the constructed tree, the channel assignment algorithm employs the Probability Of Success (POS) metric to assign channels to the various layers defined by the constructed SPT or MST, ensuring that the most reliable channel is used for the multi-hop multicast transmissions. Simulation experiments are conducted to evaluate the mechanism’s effectiveness, revealing significant improvements in throughput and Packet Delivery Rate (PDR) compared to state-of-the-art protocols under different network conditions. The simulations also show that the SPT-based mechanism outperforms the MST-based mechanism in terms of throughput but has a higher tree construction complexity.

A Distributed Power Trading Scheme Based on Blockchain and Artificial Intelligence in Smart Grids

As an emerging hot technology, smart grids (SGs) are being employed in many fields, such as smart homes and smart cities. Moreover, the application of artificial intelligence (AI) in SGs has promoted the development of the power industry. However, as users’ demands for electricity increase, traditional centralized power trading is unable to well meet the user demands and an increasing number of small distributed generators are being employed in trading activities. This not only leads to numerous security risks for the trading data but also has a negative impact on the cost of power generation, electrical security, and other aspects. Accordingly, this study proposes a distributed power trading scheme based on blockchain and AI. To protect the legitimate rights and interests of consumers and producers, credibility is used as an indicator to restrict untrustworthy behavior. Simultaneously, the reliability and communication capabilities of nodes are considered in block verification to improve the transaction confirmation efficiency, and a weighted communication tree construction algorithm is designed to achieve superior data forwarding. Finally, AI sensors are set up in power equipment to detect electricity generation and transmission, which alert users when security hazards occur, such as thunderstorms or typhoons. The experimental results show that the proposed scheme can not only improve the trading security but also reduce system communication delays.

Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering

With the development of IoT devices, there is a rapid increase in new types of IoT malware and variants, causing social problems. The malware’s phylogenetic tree has been used in many studies for malware clustering or better understanding of malware evolution. However, when dealing with a large-scale malware set, conventional methods for constructing a phylogenetic tree is very time-consuming or even cannot be done in a realistic time. To solve this problem, we propose a high-speed, scalable phylogenetic tree construction algorithm with a clustering algorithm to cluster it. The proposed method involves the following steps: (1) Calculating the similarity of the specimen pairs using the normalized compression distance. (2) Creating a phylogenetic tree containing all specimens, instead of calculating the similarity of all pairs of a specimen, our algorithm only calculates a small part of the similarity matrix. (3) Dividing the phylogenetic tree into clusters by applying the minimum description length criterion. In addition, we propose a new online processing algorithm to add new malware specimens into the existing phylogenetic tree sequentially. Our goal is to reduce the computational cost of constructing the phylogenetic tree and improve the clustering accuracy of our previous research. We evaluated our method’s clustering accuracy and scalability with 65,494 IoT malware specimens. The results showed that our algorithm reduced the computation by 97.52% compared with the conventional method. Our clustering algorithm achieved accuracies of 95.5% and 99.3% for clustering family name and architecture name, respectively.

An Efficient Power Optimization Approach for Fixed Polarity Reed–Muller Logic Circuits Based on Metaheuristic Optimization Algorithm

With the emergence of the multicore architecture and the increase of chip operating frequency, power optimization has become a key step of circuit logic synthesis. Aiming at the XNOR/OR circuits, with the goal of minimizing power, construct the optimal polarity fixed-polarity Reed–Muller (FPRM) circuits power optimization scheme. However, the power optimization for FPRM circuits is a multipeak combinatorial optimization problem, we first propose a metaheuristic optimization algorithm (MOA), which includes the global exploration optimizer, local deep exploitation optimizer, and initial population and uses the proposed differential evolution optimization, fierce wolf siege algorithm-based tabu search, and improved skew tent map to make the population evolve. Based on the proposed Huffman tree construction algorithm and MOA, we propose an efficient power optimization approach (EPOA) to find the minimum power FPRM circuit. Experimental results on the benchmark circuits confirm the effectiveness of EPOA.

QoS-Aware Software-Defined Multicast in LEO Satellite Networks

The emerging low earth orbit (LEO) broadband constellations are capable of distributing videos via advanced multicasting techniques to multiplex bandwidth in both satellite access and backbone networks, thereby reducing huge amounts of traffics. Previous work on LEO-based multicast routing relied on IP multicast, which fails to employ global information to achieve the optimal bandwidth saving. In this article, we leverage the novel software-defined multicasting paradigm on LEO constellations to empower advanced video distribution with optimized multicast trees, thereby significantly outperforming conventional multicasting techniques. In the presence of quality-of-service (QoS) constraints, we propose weighted rectilinear Steiner minimal trees (WRSTs), which balance bandwidth saving and QoS requirements. Our multicast tree algorithm adopts the Voronoi diagram and Delaunay triangulation to obtain suitable candidate Steiner points, which are exploited by subsequent iterative edge substitutions for WRST construction. We also design QoS-aware multicast management schemes to deal with frequent member updates and potential failures in LEO constellations. We carry out thorough experiments to demonstrate the effectiveness and efficiency of the proposed routing tree construction algorithm and multicasting protocols when compared with traditional algorithms.

Optimized 2D ball trees for shape layout applications

The interactive creation of 2D layouts involving irregular shapes such as text or images is typically carried out using a pointing device to select elements and drag them to new positions on a page. We propose augmenting layout interaction with two operations: overlap avoidance and grouping by distance. Since these are computationally expensive and may hinder the fluidity of the interaction, we examine several techniques that aim at implementing these features in an efficient manner. These techniques involve the approximation of 2D shapes by collections of balls (circles) which are then organized in ball trees, a bounding volume hierarchy. In particular, we discuss a new algorithm for approximating shapes with a reduced set of balls, as well as enhanced ball tree construction algorithms. These are used to implement algorithms to group shapes hierarchically by distance and to allow dragging with collision avoidance, in the context of a proof-of-concept web application for laying out shapes extracted from segmented images.

Data analysis of music preferences of web users based on social and demographic factors

This study deals with the present-day problem of analyzing data of music preferences of web users based on social and demographic factors. The paper also analyzes the basic parameters of the user profile, which include such parameters as music preferences and movie preferences, personality traits, hobbies and interests, views on life, spending habits, phobias and health habits, and opinions, and demographics. The missing data imputation is carried out by multivariate imputation by chained equations. For analysis, 257 attributes are taken into account. Classification and Regression Trees were used as an algorithm for tree construction to find related variables to target variables "Opera" and "Classical music." Based on the constructed tree, the related preferences to classical music are found. It allowed the dissemination and promotion of the new performances and shows in the additional target group and extended the audience. An actual task of developing methods of web profile establishment is used for music preferences analysis. Random forest and KNN are the best predictors for chosen dataset in this study. The feature selection is organized based on random forest. This method allows to fond the most regularly preferences to classical music.

Toward Concurrent Video Multicast Orchestration for Caching-Assisted Mobile Networks

Multicasting does not work well for video applications such as video on demand, where individual users request video content at discrete and unpredictable moments. In this paper, we study a concurrent video multicast orchestration solution for the caching-assisted and centrally controlled mobile networks. The proposed solution strives to obtain rapid video prefetch and effective traffic reduction. By rapid video prefetch, user devices can cache required contents in advance, which can effectively improve the streaming fluency in unsteady wireless environments, especially the highly mobile vehicular environment. We introduce a maximum-rate concurrent multicast (MRCM) problem whose solution is intended to maximize the total video delivery rate by a concurrent multicast manner, and prove that the MRCM problem is NP-hard. Then, we propose a dynamic concurrent multicast tree construction algorithm and a global concurrent multicast tree optimization algorithm to approximately solve the MRCM problem in polynomial time. We also introduce a cache competition mechanism that strives to maximize the total cache hit rate when the cache space is insufficient. Performance evaluations show that compared with the existing cache-assisted multicast delivery solutions, the proposed solution significantly reduces the video delivery duration and the traffic stress of backhaul links.

Multicast tree construction algorithm for dynamic traffic on software defined networks

Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic traffic requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifies a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efficiently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.

PCTBagging: From inner ensembles to ensembles. A trade-off between discriminating capacity and interpretability

The use of decision trees considerably improves the discriminating capacity of ensemble classifiers. However, this process results in the classifiers no longer being interpretable, although comprehensibility is a desired trait of decision trees. Consolidation (consolidated tree construction algorithm, CTC) was introduced to improve the discriminating capacity of decision trees, whereby a set of samples is used to build the consolidated tree without sacrificing transparency. In this work, PCTBagging is presented as a hybrid approach between bagging and a consolidated tree such that part of the comprehensibility of the consolidated tree is maintained while also improving the discriminating capacity. The consolidated tree is first developed up to a certain point and then typical bagging is performed for each sample. The part of the consolidated tree to be initially developed is configured by setting a consolidation percentage. In this work, 11 different consolidation percentages are considered for PCTBagging to effectively analyse the trade-off between comprehensibility and discriminating capacity. The results of PCTBagging are compared to those of bagging, CTC and C4.5, which serves as the base for all other algorithms. PCTBagging, with a low consolidation percentage, achieves a discriminating capacity similar to that of bagging while maintaining part of the interpretable structure of the consolidated tree. PCTBagging with a consolidation percentage of 100% offers the same comprehensibility as CTC, but achieves a significantly greater discriminating capacity.

Practical Wavelet Tree Construction

We present new sequential and parallel algorithms for wavelet tree construction based on a new bottom-up technique. This technique makes use of the structure of the wavelet trees—refining the characters represented in a node of the tree with increasing depth—in an opposite way, by first computing the leaves (most refined), and then propagating this information upwards to the root of the tree. We first describe new sequential algorithms, both in RAM and external memory. Based on these results, we adapt these algorithms to parallel computers, where we address both shared memory and distributed memory settings. In practice, all our algorithms outperform previous ones in both time and memory efficiency, because we can compute all auxiliary information solely based on the information we obtained from computing the leaves. Most of our algorithms are also adapted to the wavelet matrix , a variant that is particularly suited for large alphabets.

Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks

In Wireless Sensor Networks (WSNs), effective transmission with acceptable degradation in the power of sensor nodes is a key challenge. In a large network, holdup is bound to occur in communicating superfluous data. The aforementioned issues namely, energy, delay and data redundancy are interdependent on each other and a tradeoff needs to be worked out to improve the overall performance. The extant methods in the literature employ either centralized or distributed approach to select a cluster head (CH). In this paper, sink originated hybrid and dynamic clustering with routing technique is proposed. The proposed routing algorithm works based on node handling capability of each sensor node in the selection of CH and also helps in identifying the forwarder node. In addition, processing load of a sensor node is also considered for selecting the forwarder. Both space and time correlation is used to collect data from the clusters and then aggregated to provide a proficient communication. The introduced method is evaluated with the performance of the previously available techniques like, Data Routing for In-Network Aggregation (DRINA), Efficient Data Collection Aware of Spatio-Temporal Correlation (EAST), Cluster-Based Data Aggregation (CBDA), Energy-Efficient Data Aggregation and Transfer (EEDAT), and Distributed algorithm for Integrated tree Construction and data Aggregation (DICA). Simulation parameters considered for assess ing the performance of the proposed algorithm are aggregation ratio, routing overhead, packet delivery fraction, throughput, packet delay and consumed energy. The experimental analysis of the introduced algorithm generates paramount outcome of finest aggregation quality with diverse key characteristics and circumstances as required by a sensor network.

Cell type hierarchy reconstruction via reconciliation of multi-resolution cluster tree.

A wealth of clustering algorithms are available for single-cell RNA sequencing (scRNA-seq) data to enable the identification of functionally distinct subpopulations that each possess a different pattern of gene expression activity. Implementation of these methods requires a choice of resolution parameter to determine the number of clusters, and critical judgment from the researchers is required to determine the desired resolution. This supervised process takes significant time and effort. Moreover, it can be difficult to compare and characterize the evolution of cell clusters from results obtained at one single resolution. To overcome these challenges, we built Multi-resolution Reconciled Tree (MRtree), a highly flexible tree-construction algorithm that generates a cluster hierarchy from flat clustering results attained for a range of resolutions. Because MRtree can be coupled with most scRNA-seq clustering algorithms, it inherits the robustness and versatility of a flat clustering approach, while maintaining the hierarchical structure of cells. The constructed trees from multiple scRNA-seq datasets effectively reflect the extent of transcriptional distinctions among cell groups and align well with levels of functional specializations among cells. Importantly, application to fetal brain cells identified subtypes of cells determined mainly by maturation states, spatial location and terminal specification.