1 resultado para Bloom Filter
em Universidad de Alicante
Filtro por publicador
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- Aquatic Commons (8)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (3)
- Aston University Research Archive (61)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (7)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (18)
- Boston University Digital Common (2)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (77)
- CentAUR: Central Archive University of Reading - UK (52)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (94)
- Cochin University of Science & Technology (CUSAT), India (11)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- Deakin Research Online - Australia (49)
- Digital Commons - Michigan Tech (9)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (2)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (1)
- DigitalCommons - The University of Maine Research (3)
- DigitalCommons@The Texas Medical Center (2)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (67)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (5)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (107)
- Publishing Network for Geoscientific & Environmental Data (32)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (58)
- Queensland University of Technology - ePrints Archive (53)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad de El Salvador (28)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (27)
- School of Medicine, Washington University, United States (2)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (17)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (6)
- Université de Montréal (1)
- Université de Montréal, Canada (1)
- University of Michigan (39)
- University of Queensland eSpace - Australia (15)
- WestminsterResearch - UK (5)
Resumo:
In this paper, we propose a novel filter for feature selection. Such filter relies on the estimation of the mutual information between features and classes. We bypass the estimation of the probability density function with the aid of the entropic-graphs approximation of Rényi entropy, and the subsequent approximation of the Shannon one. The complexity of such bypassing process does not depend on the number of dimensions but on the number of patterns/samples, and thus the curse of dimensionality is circumvented. We show that it is then possible to outperform a greedy algorithm based on the maximal relevance and minimal redundancy criterion. We successfully test our method both in the contexts of image classification and microarray data classification.