Leaf Nodes Research Articles

AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILES

The exponential growth of bioinformatics in the healthcare domain has revolutionized our understanding of DNA, proteins, and other biomolecular entities. This remarkable progress has generated an overwhelming volume of data, necessitating big data technologies for efficient storage and indexing. While big data technologies like Hadoop offer substantial support for big XML file storage, the challenges of indexing data sizes and XPath query performance persist. To enhance the efficiency of XPath queries and address the data size problem, a novel approach that is derived from the spatial indexing method of the R-tre family. The proposed method is to modify the structure of leaf nodes in the indexing tree to preserve XML-sibling connections. Then, new algorithms for constructing the new tree structure and processing sibling queries better are introduced. Experimental results demonstrate the superior efficiency of sibling XPath queries with reduced data sizes for indexing, while other XPath queries exhibit notable performance improvements. This research contributes to the development of more effective indexing methods for managing and querying large XML datasets in bioinformatics applications, ultimately advancing biomedical research and healthcare initiatives.

CareerMiner: Automatic extraction of professional network from large Chinese resume data

The professional contacts of a person, including their past colleagues and supervisors, can play an important role in job recommendation and intelligent human resources management. However, collecting such information on a large scale can be challenging and costly. In this paper, we propose CareerMiner, a system to automatically construct a dynamic professional network to capture people’s colleague and supervisor relationships based on inter-related work experiences in a large collection of Chinese resumes. Specifically, we extract fine-grained work affiliation and job title information from resume text using a customized Name Entity Recognition model and introduce a trie-like data structure to efficiently index the hierarchical affinities of the implicit organizational structure in work experiences. Then, the topology of leaf nodes is used to identify professional relationships. Experimental results on real-world resume data are presented to demonstrate the effectiveness of the proposed system. Additionally, we develop an open-source demo system that includes the main features of the system. We also conduct a case study to illustrate how CareerMiner can be utilized for the social science research and data mining applications of professional networks.

Partial remote synchronization in star-like networks with partial connections among leaf nodes

Partial remote synchronization in star-like networks with partial connections among leaf nodes

Modified graph-based algorithm to analyze security threats in IoT.

In recent years, the growing and widespread usage of Internet of Things (IoT) systems has led to the emergence of customized structures dependent on these systems. Industrial IoT (IIoT) is a subset of IoT in terms of applications and usage areas. IIoT presents many participants in various domains, such as healthcare, transportation, agriculture, and manufacturing. Besides the daily life benefits, IIoT technology provides major contributions via the Industrial Control System (ICS) and intelligent systems. The convergence of IoT and IIoT systems brings some integration and interoperability problems. In IIoT systems, devices interact with each other using information technologies (IT) and network space. However, these common usages and interoperability led to some security risks. To avoid security risks and vulnerabilities, different systems and protocols have been designed and published. Various public databases and programs identify and provide some of the security threats to make it easier for system administrators' missions. However, effective and long-term security detection mechanisms are needed. In the literature, there are numerous approaches to detecting security threats in IoT-based systems. This article presents two major contributions: First, a graph-based threat detection approach for IoT-based network systems is proposed. Threat path detection is one of the most critical steps in the security of IoT-based systems. To represent vulnerabilities, a directed acyclic graph (DAG) structure is constructed using threat weights. General threats are identified using Common Vulnerabilities and Exposures (CVE). The proposed threat pathfinding algorithm uses the depth first search (DFS) idea and discovers threat paths from the root to all leaf nodes. Therefore, all possible threat paths are detected in the threat graph. Second, threat path-reducing algorithms are proposed considering the total threat weight, hop length, and hot spot thresholds. In terms of available threat pathfinding and hot spot detecting procedures, the proposed reducing algorithms provide better running times. Therefore, all possible threat paths are founded and reduced by the constructed IoT-based DAG structure. Finally, simulation results are compared, and remarkable complexity performances are obtained.

Digital marketing program design based on abnormal consumer behavior data classification and improved homomorphic encryption algorithm

This article endeavors to delve into the conceptualization of a digital marketing framework grounded in consumer data and homomorphic encryption. The methodology entails employing GridSearch to harmonize and store the leaf nodes acquired post-training of the CatBoost model. These leaf node data subsequently serve as inputs for the radial basis function (RBF) layer, facilitating the mapping of leaf nodes into the hidden layer space. This sequential process culminates in the classification of user online consumption data within the output layer. Furthermore, an enhancement is introduced to the conventional homomorphic encryption algorithm, bolstering privacy preservation throughout the processing of consumption data. This augmentation broadens the applicability of homomorphic encryption to encompass rational numbers. The integration of the Chinese Remainder Theorem is instrumental in the decryption of consumption-related information. Empirical findings unveil the exceptional generalization performance of the amalgamated model, exemplifying an AUC (area under the curve) value of 0.66, a classification accuracy of 98.56% for online consumption data, and an F1-score of 98.41. The enhanced homomorphic encryption algorithm boasts attributes of stability, security, and efficiency, thus fortifying our proposed solution in facilitating companies’ access to precise, real-time market insights. Consequently, this aids in the optimization of digital marketing strategies and enables pinpoint positioning within the target market.

Topology reconstruction using time series data in telecommunication networks

AbstractWe consider Hybrid fiber‐coaxial (HFC) networks in which data is transmitted from a root node to a set of customers using a series of splitters and coaxial cable lines that make up a tree. The physical locations of the components in a HFC network are always known but frequently the cabling is not. This makes cable faults difficult to locate and resolve. In this study we consider time series data received by customer modems to reconstruct the topology of HFC networks. We assume that the data can be translated into a series of events, and that two customers sharing many connections in the network will observe many similar events. This approach allows us to use maximum parsimony to minimize the total number of character‐state changes in a tree based on observations in the leaf nodes. Furthermore, we assume that nodes located physically close to each other have a larger probability of being closely connected. Hence, our objective is a weighted sum of data distance and physical distance. A variable‐neighborhood search heuristic is presented for minimizing the combined distance. Furthermore, three greedy heuristics are proposed for finding an initial solution. Computational results are reported for both real‐life and synthetic network topologies using simulated customer data with various degrees of random background noise. We are able to reconstruct large topologies with a very high precision.

On clustering coherent optics point-to-multipoint trees for cost-effective bandwidth assignment in MANs

Point-to-multipoint (P2MP) coherent pluggable transceivers leveraging digital subcarrier multiplexing (DSCM) techniques are gaining momentum among telecommunication operators as a technology that can potentially provide broadband connectivity in metropolitan area networks (MANs) with flexible bandwidth allocation at reduced costs. This technology allows trees to be built where central metro (hub) nodes are interconnected with remote access/aggregation (spoke) nodes with dedicated and flexible bandwidth slices, enabling better resource management, simplified architectures, and reduced costs. This paper proposes a modified version of AI/ML clustering techniques that concentrates on the same P2MP tree as those low-rate leaf nodes with uncorrelated daily traffic patterns in a cost-effective manner, thus allowing 10%–18% tree reductions. This, when compared with fixed P2P transceivers, translates into potential CAPEX savings between 40% and 50% in the different scenarios here considered.

A cohort study of factors influencing the physical fitness of preschool children: a decision tree analysis.

Based on the decision tree model, to explore the key influencing factors of children's physical fitness, rank the key influencing factors, and explain the complex interaction between the influencing factors. A cohort study design was adopted. 1,276 children (ages 3-6) from 23 kindergartens in Nanchang, China, were chosen for the study to measure the children's physical fitness at baseline and a year later and to compare the physical fitness scores at the two stages. The study was conducted following the Chinese National Physical Fitness Testing Standard (Children Part); To identify the primary influencing factors of changes in physical fitness, a decision tree model was developed, and a questionnaire survey on birth information, feeding patterns, SB, PA, dietary nutrition, sleep, parental factors, and other relevant information was conducted. The levels of physical fitness indicators among preschool children showed a significant increase after 1 year. The accuracy of the CHAID model is 84.17%. It showed that 7 variables were strongly correlated with the physical changes of children's fitness, the order of importance of each variable was weekend PA, weekend MVPA, mother's BMI, mother's sports frequency, father's education, mother's education, and school day PA. Three factors are related to PA. Four factors are related to parental circumstances. In addition to the seven important variables mentioned, variables such as breakfast frequency on school day, puffed food, frequency of outing, school day MVPA, parental feeling of sports, father's occupation, and weekend breakfast frequency are all statistically significant leaf node variables. PA, especially weekend PA, is the most critical factor in children's physical fitness improvement and the weekend MVPA should be increased to more than 30 min/d based on the improvement of weekend PA. In addition, parental factors and school day PA are also important in making decisions about changes in fitness for children. The mother's efforts to maintain a healthy BMI and engage in regular physical activity are crucial for enhancing the physical fitness of children. Additionally, other parental factors, such as the parents' educational levels and the father's occupation, can indirectly impact the level of physical fitness in children.

Implementing dynamic subset sensitivity analysis for early design datasets

Engaging with performance feedback in early building design often involves building a custom parametric model and generating large datasets, which is not always feasible. Alternatively, large parametric datasets of general design problems and filtering methods could be used together to explore specific design decisions. This paper investigates the generalizability of a method that dynamically assesses variable importance and likely influence on performance objectives as a precomputed design space is filtered down. The method first trains linear model trees to predict building performance objectives across a generic design space. Leaf node models are then aggregated to provide feedback on variable importance in different design space regions. This approach is tested on three design problems that vary in number of variables, samples, and design space structure to reveal advantages and potential limitations of the method. Algorithm improvements are proposed, and general recommendations are developed to apply it on future datasets.

SVM Model Against Telecom Card Fraud Using GA Optimised Ten-Fold Cross-Testing

The increased number of payment methods also makes it easier for personal information to be stolen by criminals, and for criminals to take over financial payment accounts and steal money. With trillions of bank card transactions occurring every day, Credit Card Fraud Detection (CCFD) is a serious challenge, so this paper predicts "whether or not fraud occurs" by using six types of machine learning models. For problem 1, firstly, "mean, maximum, minimum, median, variance, standard deviation, quartile" are calculated for each indicator; secondly, data cleaning is carried out, and the data set is found to be free of missing values and outliers. Then the data preprocessing work was carried out, min_max normalisation and z-score standardisation were performed on the data. After that, correlation analysis was carried out, and the first four indicators were classified as negative indicators and the last three as positive indicators according to the characteristics of the indicators themselves. It can be found by calculating the Pearson correlation coefficient value after two data processing. Using the coefficient of variation method to calculate the weight of the seven "influence whether fraud" indicators. Finally, BP neural network model, decision tree model, random forest classification model, ELM model, SVM model, logistic regression model are established. For Problem 2, the four models constructed in Problem 1 are solved; to solve the BP neural network model: the data set is divided into training set and testing set according to the ratio of 6:4, and the sigmod function is used as the activation function. For BP neural network, "output >0.5" is recorded as 1, i.e. fraudulent behaviour; "output <0.5" is recorded as 0, i.e. non-fraudulent behaviour. Adjusting the learning rate and the number of iterations, the optimal average mean square error after optimal gradient descent is smaller. To solve the SVM model, the data set is divided into ten groups using the improved ten-fold cross-test, with one group as the training set and nine groups as the validation set, so as to obtain the model with the highest accuracy and the corresponding training data, and then the genetic algorithm is used to search for the optimisation of the kernel parameters in the SVM model on this basis. To solve the decision tree model, the training set and prediction set are divided into 7:3 and solved, and the number of leaf nodes is optimised. Solve the random forest classification model, divided into training set and prediction set according to 7:3 and solved, for similar accuracy choose the random forest classifier when the decision tree is less.

Application of visual multimedia technology in air transportation information service system

Abstract This paper uses visual multimedia technology to establish a model for civil aviation transportation information services. A training subset is generated with a random forest, and the strength and relevance indicators of the random forest are examined. The generated decision tree is run on the corresponding out-of-bag data to evaluate its classification ability and obtain its weights. The leaf nodes of the decision tree are normalized to calculate the out-of-bag estimation of classification strength to realize the application of visual multimedia technology in the civil aviation transportation information service system. The system scores after application are all 8 and above, and the highest can reach 10. The quality of its service efficiency and level is improved, and passengers traveling by air are satisfied.

Consensus analysis of chain star networks coupled by leaf nodes

Abstract Coupled star networks coupled by hub nodes have attracted significant interest due to the interplay between their coupling forms and dynamics. This paper introduces a novel family of chain star networks that are connected via a small number of leaf nodes. The coherence of these star networks is quantified using the Laplacian spectrum. By leveraging the network structures, we calculate the characteristic polynomial of the Laplacian matrix and obtain an exact solution for network coherence in relation to network parameters. In addition, we explore the robustness of network coherence against variations in network parameters. Furthermore, we compare the coherence performance of coupled star networks across different coupling forms Our findings demonstrate that the networks coupled by leaf nodes exhibit better coherence.

Integrating SNVs and CNAs on a phylogenetic tree from single-cell DNA sequencing data.

Single-cell DNA sequencing enables the construction of evolutionary trees that can reveal how tumors gain mutations and grow. Different whole-genome amplification procedures render genomic materials of different characteristics, often suitable for the detection of either single-nucleotide variation or copy number aberration, but not ideally for both. Consequently, this hinders the inference of a comprehensive phylogenetic tree and limits opportunities to investigate the interplay of SNVs and CNAs. Existing methods such as SCARLET and COMPASS require that the SNVs and CNAs are detected from the same sets of cells, which is technically challenging. Here we present a novel computational tool, SCsnvcna, that places SNVs on a tree inferred from CNA signals, whereas the sets of cells rendering the SNVs and CNAs are independent, offering a more practical solution in terms of the technical challenges. SCsnvcna is a Bayesian probabilistic model using both the genotype constraints on the tree and the cellular prevalence to search the optimal solution. Comprehensive simulations and comparison with seven state-of-the-art methods show that SCsnvcna is robust and accurate in a variety of circumstances. Particularly, SCsnvcna most frequently produces the lowest error rates, with ability to scale to a wide range of numerical values for leaf nodes in the tree, SNVs, and SNV cells. The application of SCsnvcna to two published colorectal cancer data sets shows highly consistent placement of SNV cells and SNVs with the original study while also supporting a refined placement of ATP7B, illustrating SCsnvcna's value in analyzing complex multitumor samples.

Container Power Consumption Prediction Based on GBRT-PL for Edge Servers in Smart City

Edge computing and IoT devices have been widely deployed in smart city applications due to the rapid promotion and implementation of 5G communication technology. Limited by power supply and hardware computing capability, applications on edge servers are mostly deployed and run in the form of container micro-services to improve resource utilization. Therefore, identifying the power consumption at the container granularity is of great importance for the load scheduling and service quality assurance of edge servers. In this paper, a GBRT-PL-based container power prediction method is proposed. Performance metrics with a strong correlation between container and server power consumption are selected for power consumption modeling. To effectively suit the nonlinear relationship between container performance metrics and server power consumption, the integrated predictive capabilities of multiple regression trees and the segmented linear model of single regression tree leaf nodes are applied. The data from the experiments prove that the GBRT-PL model predicts power consumption more accurately than other models for single and multiple container groups. The highest average relative error rate in the four multi-container group tests is 6.72%, whereas the highest relative error rate in the 90% quantile is 11.66%. In addition, it can accurately predict the majority of power consumption peaks, which contributes to the precise detection of power consumption anomalies.

Fault diagnosis of a computer interlocking system for railway signal control

The signal control of the railway transportation system is crucial for operational safety. This paper briefly introduces the computer interlocking system for railway signal control, describes the tree-structured neural network used for fault diagnosis of the interlocking system, and introduces the particle swarm optimization (PSO) algorithm for improvement. Finally, a simulation experiment was conducted on a railway station to compare the traditional back-propagation neural network (BPNN), the support vector machine, the traditional tree-structured neural network, and the improved tree-structured neural network for fault diagnosis. It was found that the topological structure of the device distribution in the railway station could be transformed into a tree structure, and with the introduction of hidden nodes, it could become a binary tree structure where each leaf node represents a device; the improved tree-structured neural network had the highest recognition performance for both two-class tasks (determining system failure or not) and multi-class tasks (identifying fault type).

Research on a Decision Tree Classification Algorithm Based on Granular Matrices

The decision tree is one of the most important and representative classification algorithms in the field of machine learning, and it is an important technique for solving data mining classification tasks. In this paper, a decision tree classification algorithm based on granular matrices is proposed on the basis of granular computing theory. Firstly, the bit-multiplication and bit-sum operations of granular matrices are defined. The logical operations between granules are replaced by simple multiplication and addition operations, which reduces the operation time. Secondly, the similarity between granules is defined, the similarity metric matrix of the granular space is constructed, the classification actions are extracted from the similarity metric matrix, and the classification accuracy is defined by weighting the classification actions with the probability distribution of the granular space. Finally, the classification accuracy of the conditional attribute is used to select the splitting attributes of the decision tree as the nodes to form forks in the tree, and the similarity between granules is used to judge whether the data types in the sub-datasets are consistent to form the leaf nodes. The feasibility of the algorithm is demonstrated by means of case studies. The results of tests conducted on six UCI public datasets show that the algorithm has higher classification accuracy and better classification performance than the ID3 and C4.5.

Heat Transfer Enhancement in Tree-Structured Polymer Linked Gold Nanoparticle Networks.

Human brains use a tree-like neuron network for information processing at high efficiency and low energy consumption. Tree-like structures have also been engineered to enhance mass and heat transfer in various applications. In this work, we reveal the heat transfer mechanism in tree-structured polymer linked gold nanoparticle (AuNP) networks using atomistic simulations. We report both upward and downward heat fluxes between root and leaf nodes in tree-structured polyethylene (PE) and poly(p-phenylene) (PPP) linked AuNP networks at tree levels from 1 to 5. We found that the heat conductance increases with an increasing polymer tree level. The heat transfer enhancement is due to the resulting increase in the low-frequency vibrational modes. This and other thermal properties are affected by the location of the AuNPs in the tree. Moreover, complex tree structures with at least five levels were found to be robust in the sense that disabling half of the leaves did not change the overall heat conductance.

Heart failure prediction based on multiple machine learning algorithms

Heart failure is a complex medical condition that arises due to the heart's inability to adequately circulate blood throughout the body, which is challenging to predict. This research aims to investigate three distinct models, namely logistic regression, random forest and decision tree generation algorithms. Logistic regression is essentially a logistic function applied to linear regression, and the loss function associated with linear regression is similar to the mean square error-like loss. In contrast, the loss function for logistic regression follows cross-entropy loss. while cross-entropy loss is often used in practice, it differs from mean square error loss. The derivative of cross-entropy loss is a difference that updates rapidly when the error is significant and slowly when the error is small, which is a desirable trait for the purposes. Decision tree generation algorithms utilize tree structures in which internal nodes represent judgments on attributes, branches represent outputs of judgments, and leaf nodes represent classification results. Random forest is an integrated learning algorithm that employs decision trees as the base learner. In classification models, multiple decision trees are processed for voting, while multiple decision tree results are processed for averaging in regression models. Experimental results indicate that random forest outperforms the other two models, albeit with a marginal difference. Further studies should incorporate additional models to identify a more suitable model for predicting heart failure.

The method of grouping and classifying music curriculum teaching resources in the context of double reduction

Abstract A subsumption classification method is proposed to improve the classification accuracy of teaching resources in the music curriculum through a double reduction policy. Subject words are selected from high-similarity and high-frequency word sets, and a subject word tree is constructed using an automatic tree construction method based on a probabilistic latent semantic analysis algorithm. To complete the subsumption classification of teaching resources, an improved multi-graph kernel convolutional network is employed to group tree leaf nodes. According to the classification evaluation results, the recall, accuracy, and F1 values are 90%, 96.48%, and 88.81%, respectively, and the macro F1 value is as high as 81.59%. It can be seen that the method can effectively classify the teaching resources of music courses with the best effect of subsumption classification, which helps to improve the appropriateness and adequacy of teaching resources utilization.

Fast and private multi-dimensional range search over encrypted data

For businesses looking to outsource their data to remote servers, cloud-based data storage is a popular choice. It is popular due to its flexibility, cost-effectiveness, and widespread availability. However, ensuring the confidentiality of data is a critical challenge that must be addressed. As a response to this issue, searchable encryption techniques have been developed. These techniques enable search queries to be performed on encrypted data while still keeping the plaintext confidential. While most existing symmetric searchable encryption schemes are designed for one-dimensional data records or document-keyword inverted indices, this paper introduces MDRSSE, a novel symmetric searchable encryption scheme specifically tailored for multi-dimensional range search. MDRSSE stands out as one of the pioneering SSE schemes to support multi-dimensional range search efficiently, without incurring undetermined additional communication or computation costs. By employing a single round of communication between the client and server, MDRSSE enables an honest-but-curious server to respond to multi-dimensional range queries without gaining knowledge of the data records or revealing the search query. Notably, MDRSSE boasts the lowest overall search complexity compared to existing state-of-the-art symmetric searchable encryption schemes designed for multi-dimensional range search. Extensive experimental tests were conducted to validate the robustness and practicality of our proposed scheme. The results demonstrate that, for a dataset consisting of 100K records with 12 dimensions (with each leaf node holding 500 records), it takes only 2.2 seconds to generate the encrypted dataset, and the overall setup phase completes within 2.5 seconds. Furthermore, for a range query encompassing 50 nodes, the search time is less than 2 ms and 3 ms for the client and server, respectively. MDRSSE achieves semantic security under the IND-CPA assumption, all without requiring additional storage size at the server.