An Asymptotic Ensemble Learning Framework for Big Data Analysis
In order to enable big data analysis when data volume goes beyond the available computing resources, we propose a new method for big data analysis. This method uses only a few random sample data blocks of a big data set to obtain approximate results for the entire data set. The random sample partiti...
Main Authors: | Salman Salloum, Joshua Zhexue Huang, Yulin He, Xiaojun Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8586790/ |
Similar Items
-
Exploring and cleaning big data with random sample data blocks
by: Salman Salloum, et al.
Published: (2019-06-01) -
Distributed Data Strategies to Support Large-Scale Data Analysis Across Geo-Distributed Data Centers
by: Tamer Z. Emara, et al.
Published: (2020-01-01) -
wsrf: An R Package for Classification with Scalable Weighted Subspace Random Forests
by: He Zhao, et al.
Published: (2017-03-01) -
ENRICHMENT OF ENSEMBLE LEARNING USING K-MODES RANDOM SAMPLING
by: Balamurugan Mahalingam, et al.
Published: (2017-10-01) -
Scalable Spectral Clustering With Nyström Approximation: Practical and Theoretical Aspects
by: Farhad Pourkamali-Anaraki
Published: (2020-01-01)