Using Kernels to Harness the Complexity of Big Data Applications
-
Published:2022-05
Issue:03
Volume:31
Page:
-
ISSN:0218-2130
-
Container-title:International Journal on Artificial Intelligence Tools
-
language:en
-
Short-container-title:Int. J. Artif. Intell. Tools
Affiliation:
1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong, China
Abstract
This paper presents the concept of kernels to address the complexity of solving big-data applications. Their solution strategies often require evaluating domain-dependent subspaces on the big data and selecting the best result. As the data space in these problems is so vast that it is infeasible to scan the data once, we need domain-specific methods for identifying promising and manageable subspaces with a high density of solutions before looking for individual ones. To this end, we introduce kernels to represent some properties of the statistical quality, average density, or probability of solutions in a subspace to prune subspaces with suboptimal kernels. We classify various past approaches based on their analysis methods and illustrate each by an example. Our results confirm that kernels can effectively harness the complexity of solving big-data applications.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Artificial Intelligence,Artificial Intelligence