Data Nuggets: A Method for Reducing Big Data While Preserving Data Structure
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914703403384832 |
|---|---|
| author | Beavers, Traymon E. Cheng, Ge Duan, Yajie Cabrera, Javier Lubomirski, Mariusz Amaratunga, Dhammika Teigler, Jeffrey E. |
| author_facet | Beavers, Traymon E. Cheng, Ge Duan, Yajie Cabrera, Javier Lubomirski, Mariusz Amaratunga, Dhammika Teigler, Jeffrey E. |
| contents | Big data, with NxP dimension where N is extremely large, has created new challenges for data analysis, particularly in the realm of creating meaningful clusters of data. Clustering techniques, such as K-means or hierarchical clustering are popular methods for performing exploratory analysis on large datasets. Unfortunately, these methods are not always possible to apply to big data due to memory or time constraints generated by calculations of order PxN(N-1). To circumvent this problem, typically, the clustering technique is applied to a random sample drawn from the dataset: however, a weakness is that the structure of the dataset, particularly at the edges, is not necessarily maintained. We propose a new solution through the concept of "data nuggets", which reduce a large dataset into a small collection of nuggets of data, each containing a center, weight, and scale parameter. The data nuggets are then input into algorithms that compute methods such as principal components analysis and clustering in a more computationally efficient manner. We show the consistency of the data nuggets-based covariance estimator and apply the methodology of data nuggets to perform exploratory analysis of a flow cytometry dataset containing over one million observations using PCA and K-means clustering for weighted observations. Supplementary materials for this article are available online. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_03099 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Data Nuggets: A Method for Reducing Big Data While Preserving Data Structure Beavers, Traymon E. Cheng, Ge Duan, Yajie Cabrera, Javier Lubomirski, Mariusz Amaratunga, Dhammika Teigler, Jeffrey E. Methodology Computation 62:0 Big data, with NxP dimension where N is extremely large, has created new challenges for data analysis, particularly in the realm of creating meaningful clusters of data. Clustering techniques, such as K-means or hierarchical clustering are popular methods for performing exploratory analysis on large datasets. Unfortunately, these methods are not always possible to apply to big data due to memory or time constraints generated by calculations of order PxN(N-1). To circumvent this problem, typically, the clustering technique is applied to a random sample drawn from the dataset: however, a weakness is that the structure of the dataset, particularly at the edges, is not necessarily maintained. We propose a new solution through the concept of "data nuggets", which reduce a large dataset into a small collection of nuggets of data, each containing a center, weight, and scale parameter. The data nuggets are then input into algorithms that compute methods such as principal components analysis and clustering in a more computationally efficient manner. We show the consistency of the data nuggets-based covariance estimator and apply the methodology of data nuggets to perform exploratory analysis of a flow cytometry dataset containing over one million observations using PCA and K-means clustering for weighted observations. Supplementary materials for this article are available online. |
| title | Data Nuggets: A Method for Reducing Big Data While Preserving Data Structure |
| topic | Methodology Computation 62:0 |
| url | https://arxiv.org/abs/2403.03099 |