The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An Ensemble Random Forest Algorithm for Insurance Big Data Analysis
Open accessAbstract
Due to the imbalanced distribution of business data, missing user features, and many other reasons, directly using big data techniques on realistic business data tends to deviate from the business goals. It is difficult to model the insurance business data by classification algorithms, such as logistic regression and support vector machine (SVM). In this paper, we exploit a heuristic bootstrap sampling approach combined with the ensemble learning algorithm on the large-scale insurance business data mining, and propose an ensemble random forest algorithm that uses the parallel computing capability and memory-cache mechanism optimized by Spark. We collected the insurance business data from China Life Insurance Company to analyze the potential customers using the proposed algorithm. We use F-Measure and G-mean to evaluate the performance of the algorithm. Experiment result shows that the ensemble random forest algorithm outperformed SVM and other classification algorithms in both performance and accuracy within the imbalanced data, and it is useful for improving the accuracy of product marketing compared to the traditional artificial approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
Classification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
Borderline-SMOTE : A New Over-Sampling Method in Imbalanced Data Sets Learning
Han, H., Wang, W.-Y., & Mao, B.-H. (2005) · Lecture notes in computer science · doi:10.1007/11538059_91 · Cited by 4,331
(1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309452 · Cited by 1,078
Improving Identification of Difficult Small Classes by Balancing Class Distribution
Laurikkala, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-48229-6_9 · Cited by 748
Sáez, J. A., Luengo, J., Stefanowski, J., & Herrera, F. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.051 · Cited by 627
Challenges and opportunities of open data in ecology
Reichman, O. J., Jones, M. B., & Schildhauer, M. P. (2011) · Science · doi:10.1126/science.1197962 · Cited by 600
Ramentol, E., Caballero, Y., Bello, R., & Herrera, F. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-011-0465-6 · Cited by 489
Multi-key privacy-preserving deep learning in cloud computing
Li, P., Li, J., Huang, Z., Li, T., Gao, C.-Z., Yiu, S.-M., & Chen, K. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.02.006 · Cited by 462
Self-citationOn the use of MapReduce for imbalanced big data using Random Forest
del Río, S., López, V., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.043 · Cited by 328
Cited by
On the class overlap problem in imbalanced data classification
Vuttipittayamongkol, P., Elyan, E., & Petrovski, A. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106631 · Cited by 290
Faroughi, S. A., Pawar, N. M., Fernandes, C., Raissi, M., Das, S., Kalantari, N. K., & Kourosh Mahjour, S. (2024) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4064449 · Cited by 257
Service Function Chain Orchestration Across Multiple Domains: A Full Mesh Aggregation Approach
Sun, G., Li, Y., Liao, D., & Chang, V. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2018.2861717 · Cited by 254
When Machine Learning Meets Privacy in 6G: A Survey
Sun, Y., Liu, J., Wang, J., Cao, Y., & Kato, N. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3011561 · Cited by 211
Conceptual challenges for interpretable machine learning
Watson, D. S. (2022) · Synthese · doi:10.1007/s11229-022-03485-5 · Cited by 87
Metadata
- Authors
- Lin, W., Wu, Z., Lin, L., Wen, A., & Li, J.
- Venue
- IEEE Access
- Published
- 2017
- Volume
- 5
- Pages
- 16568-16575
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2752032793
- Cited by
- 309
- References
- 16
- FWCI
- 14.43
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Ensemble Random Forest Algorithm for Insurance Big Data Analysis. https://app.cochat.ai/papers/10.1109/access.2017.2738069
- The paper
- Lin, W., Wu, Z., Lin, L., Wen, A., & Li, J. (2017). An Ensemble Random Forest Algorithm for Insurance Big Data Analysis. IEEE Access. https://doi.org/10.1109/access.2017.2738069
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.