Research on business English negotiation strategy optimization based on random forest big data analysis algorithm

This paper expounds the principles and characteristics of several typical decision forest algorithms. It then proposes a modified random forest method from the perspective of the decision forest construction process. The decision tree serves as the foundation for node splitting. In this paper, we combine the support vector machine algorithm in the attribute selection of decision tree to split the hyperplane composed by the linear combination of feature variables, we combine the support vector machine algorithm in the attribute selection of decision tree to split the hyperplane composed by the linear combination of feature variables, which shows stronger classification ability than a single attribute. This advantage is statistically significant ( p < 0.05) in our experimental dataset of 1000 negotiation cases from multinational enterprises (2018–2023), where the out-of-bag accuracy is improved by 15% compared to single-attribute splitting. The calculation process of out-of-bag error estimation can be described as: in the established random forest algorithm, the out-of-bag data is 1000, and then the generated out-of-bag data and the correctly classified number is 850, and the correct rate of out-of-bag data is 850/1000. Multiple experiments have shown that the test results of out-of-bag data are unbiased estimates, without having to use the test set to test its accuracy or perform cross-validation to calculate its unbiased estimate. The hybrid algorithm leverages linear combinations of feature variables to construct hyperplanes, significantly enhancing classification accuracy compared to traditional single-attribute splitting methods. Experimental analysis demonstrates that the improved algorithm achieves a 15% higher out-of-bag (OOB) accuracy than conventional random forests. The calculation process of out-of-bag (OOB) error estimation can be described as: in the established random forest algorithm, the out-of-bag data consists of 1000 samples, among which 850 are correctly classified, resulting in an OOB accuracy = 850/1000 = 85%.

Authors

Institutions

Publication Details

Journal
Journal of Computational Methods in Sciences and Engineering
Published
2025-08-25
DOI
https://doi.org/10.1177/14727978251371164
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on business English negotiation strategy optimization based on random forest big data analysis algorithm

Y. Long
Journal of Computational Methods in Sciences and Engineering
E-commerce and Technology Innovations
article

Research on business English negotiation strategy optimization based on random forest big data analysis algorithm

Y. Long
article en

Abstract

This paper expounds the principles and characteristics of several typical decision forest algorithms. It then proposes a modified random forest method from the perspective of the decision forest construction process. The decision tree serves as the foundation for node splitting. In this paper, we combine the support vector machine algorithm in the attribute selection of decision tree to split the hyperplane composed by the linear combination of feature variables, we combine the support vector machine algorithm in the attribute selection of decision tree to split the hyperplane composed by the linear combination of feature variables, which shows stronger classification ability than a single attribute. This advantage is statistically significant ( p < 0.05) in our experimental dataset of 1000 negotiation cases from multinational enterprises (2018–2023), where the out-of-bag accuracy is improved by 15% compared to single-attribute splitting. The calculation process of out-of-bag error estimation can be described as: in the established random forest algorithm, the out-of-bag data is 1000, and then the generated out-of-bag data and the correctly classified number is 850, and the correct rate of out-of-bag data is 850/1000. Multiple experiments have shown that the test results of out-of-bag data are unbiased estimates, without having to use the test set to test its accuracy or perform cross-validation to calculate its unbiased estimate. The hybrid algorithm leverages linear combinations of feature variables to construct hyperplanes, significantly enhancing classification accuracy compared to traditional single-attribute splitting methods. Experimental analysis demonstrates that the improved algorithm achieves a 15% higher out-of-bag (OOB) accuracy than conventional random forests. The calculation process of out-of-bag (OOB) error estimation can be described as: in the established random forest algorithm, the out-of-bag data consists of 1000 samples, among which 850 are correctly classified, resulting in an OOB accuracy = 850/1000 = 85%.

Journal of Computational Methods in Sciences and Engineering
Shunde Polytechnic (CN)
Openalex Percentile: Top 58%
E-commerce and Technology Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.