Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/36872
Title: A Framework for Admissible Kernel Function in Support Vector Machines using Lévy Distribution
Researcher: Sangeetha, R
Guide(s): Kalpana, B
Keywords: Support vector machine
kernel function
Hilbert space
Upload Date: 11-Mar-2015
University: Avinashilingam Deemed University For Women
Completed Date: 30/04/2013
Abstract: With the massive amount of data being generated in everyday life it is increasingly important to develop a powerful framework for analysis interpretation and extraction of interesting knowledge that could help in decision making The confluence of intertwined disciplines like statistics machine learning pattern recognition artificial and computational intelligence have enriched data mining applications in various domains including healthcare security and remote surveillance Due to the rapid incidence of nonlinear ill posedness in real world problems empirical modeling is receiving greater impetus in building up a data model To address and convert an illposed problem into well posed one reliable and flexible models with some form of capacity control is needed to balance the data fitting Regularization statistical learning theory structural risk minimization SRM and kernel based algorithms are elegantly combined to form a defined framework called as support vector machines SVMs The basic idea of SVM is to build an optimal and feasible classifier model with three successful strategies namely learning ability robustness and computational efficiency Two major issues of SVM are kernel selection and maximum margin classifiers In training a SVM it is important to select a kernel and its parameters But there is no premise to determine the choice of an appropriate kernel function for a particular domain This research work focuses on the first issue ie the choice of the kernel function based on which a novel framework for admissible kernel function is proposed Additionally the curse of dimensionality is a major hindrance in machine learning and data mining In order to avoid this problem and strengthen the proposed framework a new technique based on fuzzy rough sets with differential evolution is created and experimented Further the proposed model is proved theoretically and empirically to solve classification problems newline
Pagination: 
URI: http://hdl.handle.net/10603/36872
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
rsangeetha_chapter1.pdfAttached File342.84 kBAdobe PDFView/Open
rsangeetha_chapter2.pdf272.07 kBAdobe PDFView/Open
rsangeetha_chapter3.pdf431.51 kBAdobe PDFView/Open
rsangeetha_chapter4.pdf1.68 MBAdobe PDFView/Open
rsangeetha_chapter5.pdf750.72 kBAdobe PDFView/Open
rsangeetha_chapter6.pdf737.97 kBAdobe PDFView/Open
rsangeetha_chapter7.pdf332.49 kBAdobe PDFView/Open
rsangeetha_chapter8.pdf119.92 kBAdobe PDFView/Open
rsangeetha_chapter9.pdf439.46 kBAdobe PDFView/Open
rsangeetha_intro.pdf425.6 kBAdobe PDFView/Open


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