• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

M?quina de vetores-suporte intervalar

Takahashi, Adriana 26 September 2012 (has links)
Made available in DSpace on 2014-12-17T14:55:12Z (GMT). No. of bitstreams: 1 AdrianaT_TESE.pdf: 618602 bytes, checksum: 8ea994949daea03408599ce92036681a (MD5) Previous issue date: 2012-09-26 / The Support Vector Machines (SVM) has attracted increasing attention in machine learning area, particularly on classification and patterns recognition. However, in some cases it is not easy to determinate accurately the class which given pattern belongs. This thesis involves the construction of a intervalar pattern classifier using SVM in association with intervalar theory, in order to model the separation of a pattern set between distinct classes with precision, aiming to obtain an optimized separation capable to treat imprecisions contained in the initial data and generated during the computational processing. The SVM is a linear machine. In order to allow it to solve real-world problems (usually nonlinear problems), it is necessary to treat the pattern set, know as input set, transforming from nonlinear nature to linear problem. The kernel machines are responsible to do this mapping. To create the intervalar extension of SVM, both for linear and nonlinear problems, it was necessary define intervalar kernel and the Mercer s theorem (which caracterize a kernel function) to intervalar function / As m?quinas de vetores suporte (SVM - Support Vector Machines) t?m atra?do muita aten??o na ?rea de aprendizagem de m?quinas, em especial em classifica??o e reconhecimento de padr?es, por?m, em alguns casos nem sempre ? f?cil classificar com precis?o determinados padr?es entre classes distintas. Este trabalho envolve a constru??o de um classificador de padr?es intervalar, utilizando a SVM associada com a teoria intervalar, de modo a modelar com uma precis?o controlada a separa??o entre classes distintas de um conjunto de padr?es, com o objetivo de obter uma separa??o otimizada tratando de imprecis?es contidas nas informa??es do conjunto de padr?es, sejam nos dados iniciais ou erros computacionais. A SVM ? uma m?quina linear, e para que ela possa resolver problemas do mundo real, geralmente problemas n?o lineares, ? necess?rio tratar o conjunto de padr?es, mais conhecido como conjunto de entrada, de natureza n?o linear para um problema linear, as m?quinas kernels s?o respons?veis por esse mapeamento. Para a extens?o intervalar da SVM, tanto para problemas lineares quanto n?o lineares, este trabalho introduz a defini??o de kernel intervalar, bem como estabelece o teorema que valida uma fun??o ser um kernel, o teorema de Mercer para fun??es intervalares

Page generated in 0.1042 seconds