Nikunj C. Oza received his B.S. in Mathematics with Computer Science
from the Massachusetts Institute of Technology (MIT) in 1994. He received his M.S. (in 1998) and Ph.D. (in 2001) in Computer Science from the University of California at Berkeley. He then joined NASA Ames Research Center and is a member of their Intelligent Data Understanding (IDU) group. He leads of a team applying data mining to the problem of health management for aerospace vehicles. His 40+ research papers represent his research interests which include machine learning (especially ensemble learning and online learning), data mining, fault detection, integration of machine learning with automated planning and other areas of Artificial Intelligence, and their applications to Aeronautics and Earth Science. He received the 2007 Arch T. Colwell Award in 2007 for co-authoring one of the five most innovative technical papers selected out of over 3300 SAE technical papers published in 2005.
Last Added Resources
-
Detecting Anomalies in Multivariate Data Sets with Switching Sequences and Continuous Streams
A Publication, Multiple Kernel Learning based Heterogeneous Algorithm (MKAD) - 10 years, 7 months ago
Shared By: Nikunj Oza
The world-wide aviation system is one of the most complex dynamical systems ever developed and is generating data at an extremely rapid rate. Most modern ...
-
Sparse Solutions for Single Class SVMs: A Bi-Criterion Approach
A Publication, Nikunj Oza's Collection - 11 years, 8 months ago
Shared By: Nikunj Oza
In this paper we propose an innovative learning algorithm - a variation of One-class Support Vector Machines (SVMs) learning algorithm to produce sparser solutions ...
-
Pseudo-Label Generation for Multi-Label Text Classification
A Publication, Nikunj Oza's Collection - 11 years, 8 months ago
Shared By: Nikunj Oza
With the advent and expansion of social networking, the amount of generated text data has seen a sharp increase. In order to handle such a ...
Nikunj's Projects (11)
-
Deep Learning for Aviation ...
2 members
-
-
-
Need help?
Visit our help center