<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>2013</title>
<link href="http://localhost:8080/xmlui/handle/123456789/7221" rel="alternate"/>
<subtitle/>
<id>http://localhost:8080/xmlui/handle/123456789/7221</id>
<updated>2026-04-12T04:49:06Z</updated>
<dc:date>2026-04-12T04:49:06Z</dc:date>
<entry>
<title>Computational Reduction Method for Support Vector Machine</title>
<link href="http://localhost:8080/xmlui/handle/123456789/7222" rel="alternate"/>
<author>
<name>Agrawal, Ritu Ramkumar</name>
</author>
<id>http://localhost:8080/xmlui/handle/123456789/7222</id>
<updated>2020-11-06T09:18:30Z</updated>
<published>2013-05-01T00:00:00Z</published>
<summary type="text">Computational Reduction Method for Support Vector Machine
Agrawal, Ritu Ramkumar
The data classification is the main analyzing method for the information&#13;
extracting. Classification in data mining has gained a lot of importance in literature&#13;
and it has a great deal of application areas from medicine to astronomy, from banking&#13;
to text classification, and so on. It can be described as supervised learning algorithm&#13;
as it assigns class labels to data objects based on the relationship between the data&#13;
items with a pre-defined class label. The classification techniques are help to learn a&#13;
model from a set of training data and to classify a test data well into one of the&#13;
classes.&#13;
This dissertation builds upon the ideas introduced work by Vladimir N. Vapnik,&#13;
Y. J. Lee and O. L. Mangasarian in Support Vector Machine for data Classification&#13;
Problems. This research is related to the study of the existing SVM classification&#13;
algorithm and new scheme that reduces the complexity of SVM. The proposed&#13;
scheme describes the new scheme based on computational reduction in support vector&#13;
machine that provides reasonably increase the evaluation speed without affecting the&#13;
performance of the standard support vector machine. It helps other researchers in&#13;
studying the existing algorithms as well as developing innovative algorithms for&#13;
applications or requirements which are not available.&#13;
xi&#13;
From the results, we conclude that with the help of proposed RSV approach, no.&#13;
of support vectors for temporal dataset reduces compared to standard SVM. Hence it&#13;
gives faster execution and better performance for real time large databases&#13;
applications. Therefore Efficiency of SVM algorithm should also increase in case of&#13;
temporal dataset analysis compared to standard SVM.
For Full Thesis Kindly Contact to Respective Library
</summary>
<dc:date>2013-05-01T00:00:00Z</dc:date>
</entry>
</feed>
