Divide and Conquer Framework with Feature Partitioning Concepts
Divide and Conquer Framework with Feature Partitioning Concepts
| dc.contributor.author | Kadappa, Vijayakumar | |
| dc.contributor.author | Negi, Atul | |
| dc.date.accessioned | 2022-03-27T05:52:46Z | |
| dc.date.available | 2022-03-27T05:52:46Z | |
| dc.date.issued | 2018-11-01 | |
| dc.description.abstract | Divide-And-Conquer (DC) approach is a classical well-Adopted paradigm for designing algorithms. In current big data scenarios, processing of voluminous and variety of data is required. One of the characteristics is, large-dimensional data that needs to be analyzed; for example, high resolution images used in social media are used for sentiment analysis. Our research is oriented towards discovering approaches where stage-by-stage processing is done to bring out most salient features from high-dimensional data. However, we observe that data block processing, in most of the conventional approaches, does not scale well for higher dimensionality. Instead, we think of making blocks along the feature set and we propose a divideand-conquer based feature extraction framework based on feature set partitioning. We demonstrate the effectiveness of the proposed framework using various feature set partitioning based PCA approaches. | |
| dc.identifier.citation | 1st International Conference on Data Science and Analytics, PuneCon 2018 - Proceedings | |
| dc.identifier.uri | 10.1109/PUNECON.2018.8745391 | |
| dc.identifier.uri | https://ieeexplore.ieee.org/document/8745391/ | |
| dc.identifier.uri | https://dspace.uohyd.ac.in/handle/1/8562 | |
| dc.subject | Divide and Conquer | |
| dc.subject | Feature Extraction | |
| dc.subject | Pattern Recognition | |
| dc.subject | PCA | |
| dc.title | Divide and Conquer Framework with Feature Partitioning Concepts | |
| dc.type | Conference Proceeding. Conference Paper | |
| dspace.entity.type |
Files
License bundle
1 - 1 of 1