Due to the rapid developments in sensor technologies, wide spread
usage of smart phones and Internet, we have the opportunity and
capability to gather huge amounts of data in different real life
signal processing applications (which was not possible in the
past). Efficient and effective processing of this big data can
significantly improve the performance of many signal processing
algorithms. However, this big data has dimensions and volumes unseen
before in signal processing problems, comes in different varieties and
its quality, quantity and statistics rapidly change in time and among
elements. To accommodate these problems, the big data should be
adaptively processed by signal processing methods since the adaptive
methods (1) can process the data online, i.e., instantly, without any
storage requirement, (2) can constantly adapt to the changing
statistics or quality of the data, hence can be robust and prone to
variations and uncertainties.
However, since the classical adaptive signal processing approaches
are designed for inputs that have much smaller dimensions and fewer
variations, these methods cannot be used effectively or efficiently to
process the big data (or cannot even operate due to computational
issues). Hence, in this project, in order to effectively process
the big data, we aim (1) to develop novel adaptive signal processing
algorithms specifically tuned to effectively operate on large
dimensional data, (2) demonstrate the effectiveness and efficiency of
these approaches in different applications and prove these results
mathematically, and finally (3) construct the big data adaptive signal
processing framework, as the first time, by defining new cost measures
and design methodologies. This is the first national project that is
aimed to introduce a new framework for adaptive processing of big data
and to construct novel adaptive algorithms that are shown to be
effective, efficient and robust on big data.
Sample publications on this topic include:
-- N. D. Vanli and S. S. Kozat, ``A Comprehensive Approach to Universal Nonlinear Regression Based on Trees,'' IEEE Transactions on Signal Processing, 2013.
-- N. D. Vanli and S. S. Kozat, ``A Unified Approach to Universal Prediction: Generalized Upper and Lower Bounds,'' IEEE Transactions on Neural Networks and Learning Systems, 2013.
-- N. D. Vanli, M. O. Sayin and S. S. Kozat, ``Twice Universal Piecewise Linear Regression via Infinite Depth Context Tree Weighting Method,'' IEEE Transactions on Neural Networks and Learning Systems, 2013.
-- H. Ozkan and S. S. Kozat, ``Data Imputation through the Identification of Local Anomalies,'' IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013.
-- H. Ozkan and S. S. Kozat, ``Sequential and Randomized Quantization through AND-OR Graph Modeling,'' IEEE Transactions on Signal Processing, 2013.
FIGURE: Two different paradigms for BIG DATA processing: the classical batch approach and the proposed adaptive approach.