skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Advanced Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Primo Advanced Search Query Term
Input search text:
Show Results with:
criteria input
Qualquer
Show Results with:
Qualquer
Primo Advanced Search prefilters
Tipo de material:
criteria input
Todos os itens
Produção Intelectual da USP
Busca Simples
This feature requires javascript
Hierarchical classification on batch and streaming data with applications to entomology
Parmezan, Antonio Rafael Sabino
Biblioteca Digital de Teses e Dissertações da USP; Universidade de São Paulo; Instituto de Ciências Matemáticas e de Computação 2022-02-25
Acesso online
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Hierarchical classification on batch and streaming data with applications to entomology
Autor:
Parmezan, Antonio Rafael Sabino
Orientador:
Batista, Gustavo Enrique de Almeida Prado Alves
Assuntos:
Aprendizado De Máquina
;
Fluxo De Dados
;
Mudança De Conceito
;
Classificação Hierárquica
;
Aprendizado Em Lote
;
Concept Drift
;
Batch Learning
;
Hierarchical Classification
;
Machine Learning
;
Data Stream
Notas:
Tese (Doutorado)
Descrição:
Traditional supervised machine learning algorithms conduct data classification in a flat way, i.e., they seek to associate each example with a class belonging to a finite, devoid of structural dependencies and usually small, set of classes. However, there are more challenging problems in which classes can be divided or grouped into subclasses or superclasses, respectively. This structural dependency between classes demands the application of methods prepared to deal with hierarchical classification. An algorithm for hierarchical classification considers the structural information embedded in the class hierarchy and uses it to decompose the original problems feature space into subproblems with fewer classes. Such decomposition reduces the complexity of the classification function as well as the prediction error. This thesis advances the state-ofthe-art by proposing novel algorithms for hierarchical classification considering two learning paradigms: (i) batch, where learning takes place offline employing a sample of fixed-size examples (ideally) coming from a stationary probability distribution. Each observation within the sample is independently and identically distributed; and (ii) streaming, in which learning is performed online from a usually uninterrupted and ordered sequence of examples available, at various update rates and without human intervention, by systems or devices. The features that describe the streaming examples may drift over time due to the non-stationary nature of the environment in which they are. In this context, the main contributions of this thesis include: (i) the most extensive and comprehensive study ever done to understand the impact of climatic-environmental conditions on the bee and wasp wing-beat frequencies. From the practical standpoint, the work builds base components for (online) (hierarchical) classification of flying insects; (ii) a method that combines local approaches to quickly and efficiently obtain a hierarchical decision model that faithfully represents the music genre identification scenario. We also validated the approach on hymenopteran data; (iii) a reference process that uses optical sensors and hierarchical classifiers to identify pollinating flying insects under natural field conditions. The results obtained provided answers to ten research questions; (iv) the first algorithm for hierarchical classification of data streams. It is based on nearest neighbors and works incrementally; (v) a framework and (vi) a collection of methods for hierarchical labeling of streaming data.
DOI:
10.11606/T.55.2022.tde-03102022-171351
Editor:
Biblioteca Digital de Teses e Dissertações da USP; Universidade de São Paulo; Instituto de Ciências Matemáticas e de Computação
Data de criação/publicação:
2022-02-25
Formato:
Adobe PDF
Idioma:
Inglês
Links
Este item no Dedalus
Teses e Dissertações USP
Acesso ao doi
E-mail do autor
E-mail do orientador
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
9
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_PRODUCAO)
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript