Big-data feature screening using bregman divergence

Producción científica: Conference contributionrevisión exhaustiva

Resumen

Modern biomedical data usually are big: they have high dimensions and/or massive volumes as a result of fast advancement in sensing and information technologies. Many components of the data, however, may not play any important role for tasks of interest. Reducing the dimensionality of the data turns out to be critical for obtaining accurate result and a good generalization capability. This paper introduces an approach for using Bregman divergence to describe the discriminating capability of a subset of features. An important advantage of this method is that the nonlinear relationship existing in the data can be exploited with the Bregman divergence. Moreover, the optimization of the proposed discrimination measure turns out to be particularly simple, which leads to a fast algorithm.

Idioma originalEnglish
Título de la publicación alojadaProceedings of the 2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011
Páginas219-223
Número de páginas5
EstadoPublished - 2011
Evento2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011 - Las Vegas, NV, United States
Duración: jul 18 2011jul 21 2011

Serie de la publicación

NombreProceedings of the 2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011
Volumen1

Conference

Conference2011 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2011
País/TerritorioUnited States
CiudadLas Vegas, NV
Período7/18/117/21/11

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition

Huella

Profundice en los temas de investigación de 'Big-data feature screening using bregman divergence'. En conjunto forman una huella única.

Citar esto