The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A Parallel Random Forest Algorithm for Big Data in a Spark Cloud Computing Environment
Open accessAbstract
With the emergence of the big data age, the issue of how to obtain valuable knowledge from a dataset efficiently and accurately has attracted increasingly attention from both academia and industry. This paper presents a Parallel Random Forest (PRF) algorithm for big data on the Apache Spark platform. The PRF algorithm is optimized based on a hybrid approach combining dataparallel and task-parallel optimization. From the perspective of data-parallel optimization, a vertical data-partitioning method is performed to reduce the data communication cost effectively, and a data-multiplexing method is performed is performed to allow the training dataset to be reused and diminish the volume of data. From the perspective of task-parallel optimization, a dual parallel approach is carried out in the training process of RF, and a task Directed Acyclic Graph (DAG) is created according to the parallel training process of PRF and the dependence of the Resilient Distributed Datasets (RDD) objects. Then, different task schedulers are invoked for the tasks in the DAG. Moreover, to improve the algorithm's accuracy for large, high-dimensional, and noisy data, we perform a dimension-reduction approach in the training process and a weighted voting approach in the prediction process prior to parallelization. Extensive experimental results indicate the superiority and notable advantages of the PRF algorithm over the relevant algorithms implemented by Spark MLlib and other studies in terms of the classification accuracy, performance, and scalability. With the expansion of the scale of the random forest model and the Spark cluster, the advantage of the PRF algorithm is more obvious.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Conditional variable importance for random forests
Strobl, C., Boulesteix, A.-L., Kneib, T., Augustin, T., & Zeileis, A. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-307 · Cited by 3,254
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
Analysis of a Random Forests Model
Gérard Biau, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.0208 · Cited by 661
Analysis of a random forests model
BiauGérard (2012) · Journal of Machine Learning Research · doi:10.5555/2503308.2343682 · Cited by 575
Xu, Y., Li, K., Hu, J., & Li, K. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.122 · Cited by 390
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
Comparing Boosting and Bagging Techniques With Noisy and Imbalanced Data
Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A. (2011) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2010.2084081 · Cited by 300
Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud
Warneke, D., & Kao, O. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.65 · Cited by 276
Robust and Accurate Shape Model Matching Using Random Forest Regression-Voting
Lindner, C., Bromiley, P. A., Ionita, M. C., & Cootes, T. F. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2382106 · Cited by 267
PLANET: massively parallel learning of tree ensembles with MapReduce
Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687569 · Cited by 267
Big Data Analytics framework for Peer-to-Peer Botnet detection using Random Forests
Singh, K., Guntuku, S. C., Thakur, A., & Hota, C. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.066 · Cited by 265
Multiple Kernel Learning for Dimensionality Reduction
Lin, Y.-Y., Liu, T.-L., & Fuh, C.-S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.183 · Cited by 245
Transformation-invariant clustering using the EM algorithm
Frey, B. J., & Jojic, N. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1159942 · Cited by 205
Scheduling Precedence Constrained Stochastic Tasks on Heterogeneous Cluster Systems
Li, K., Tang, X., Veeravalli, B., & Li, K. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2013.205 · Cited by 196
Self-citationA Tensor-Based Approach for Big Data Representation and Dimensionality Reduction
Kuang, L., Hao, F., Yang, L. T., Lin, M., Luo, C., & Min, G. (2014) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2014.2330516 · Cited by 177
Parallel boosted regression trees for web search ranking
Tyree, S., Weinberger, K. Q., Agrawal, K., & Paykin, J. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963461 · Cited by 161
Ray, P. K., Mohanty, S. R., Kishor, N., & Catalão, J. P. S. (2014) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2013.2278865 · Cited by 159
Bernard, S., Adam, S., & Heutte, L. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.04.003 · Cited by 144
Energy-Aware Scheduling of MapReduce Jobs for Big Data Applications
Mashayekhy, L., Nejad, M., Grosu, D., Zhang, Q., & Shi, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2358556 · Cited by 136
Recursive Support Vector Machines for Dimensionality Reduction
Tao, Q., Chu, D., & Wang, J. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.908267 · Cited by 65
Evolutionary Scheduling of Dynamic Multitasking Workloads for Big-Data Analytics in Elastic Cloud
Zhang, F., Cao, J., Tan, W., et al. (2014) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2014.2348196 · Cited by 58
Interpretable models from distributed data via merging of decision trees
Andrzejak, A., Langner, F., & Zabala, S. (2013) · IEEE Symposium on Computational Intelligence and Data Mining (CIDM) · doi:10.1109/cidm.2013.6597210 · Cited by 42
Distributed Stochastic Aware Random Forests -- Efficient Data Mining for Big Data
Assunção, J., Fernandes, P., Lopes, L., & Gómez, S. N. (2013) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdata.congress.2013.68 · Cited by 17
Cited by
Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges
Yang, R., Yu, F. R., Si, P., Yang, Z., & Zhang, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2894727 · Cited by 688
Chen, K., Chen, H., Zhou, C., Huang, Y., Qi, X., Shen, R., Liu, F., Zuo, M., Zou, X., Wang, J., et al. (2020) · Water Research · doi:10.1016/j.watres.2019.115454 · Cited by 580
Machine learning algorithms for social media analysis: A survey
T.K., B., Annavarapu, C. S. R., & Bablani, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100395 · Cited by 276
Ghaleb, E. A. A., Dominic, P. D. D., Fati, S. M., Muneer, A., & Ali, R. F. (2021) · Sustainability · doi:10.3390/su13158379 · Cited by 134
Romanov, S., Siqueira, A. S., de Bruin, J., Teijema, J., Hofstee, L., & van de Schoot, R. (2024) · Data Intelligence · doi:10.1162/dint_a_00244 · Cited by 7
Metadata
- Authors
- Chen, J., Li, K., Tang, Z., Bilal, K., Yu, S., Weng, C., & Li, K.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2017-04-01
- Volume
- 28
- Issue
- 4
- Pages
- 919-933
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2517850251
- Cited by
- 435
- References
- 25
- FWCI
- 99.58
- Type
- journal article
- Language
- en
- Open access
- green
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
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.