Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11344
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorNovakovic J.-
dc.contributor.authorAlempije, Veljovic-
dc.contributor.authorIlic M.-
dc.contributor.authorVeljović, Vladimir-
dc.date.accessioned2021-04-20T18:07:06Z-
dc.date.available2021-04-20T18:07:06Z-
dc.date.issued2018-
dc.identifier.issn2194-5357-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11344-
dc.description.abstract© Springer International Publishing AG 2018. This paper investigates the use of SVM algorithm with PCA method in classification, which is one of the most common task of machine learning. Classification is the problem of identifying to which of a set of categories a new observation belongs, on the basis of a training set of data containing observations (or instances) whose category membership is known. SVM algorithm can produce accurate and robust classification results on a sound theoretical basis, even when input data are non-monotone and non-linearly separable. So they can help to evaluate more relevant information in a convenient way. PCA method reduces the dimensionality and the maximum number of new variables that can be obtained is equal to the original, with new variables are not correlated with each other. Experimental studies have shown that it is possible to improve the accuracy of SVM classification algorithm using PCA method.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceAdvances in Intelligent Systems and Computing-
dc.titleImproving the accuracy of SVM algorithm in classification problems with PCA method-
dc.typeconferenceObject-
dc.identifier.doi10.1007/978-3-319-68321-8_7-
dc.identifier.scopus2-s2.0-85031427093-
Appears in Collections:Faculty of Technical Sciences, Čačak

Page views(s)

439

Downloads(s)

12

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.