Acoustic Modeling using Vector Quantization in Kernel Feature Space and Classification using String Kernel based Support Vector Machines

Author(s):  
R. Anitha ◽  
C. Chandra Sekhar
2004 ◽  
Vol 26 (1-2) ◽  
pp. 45-55
Author(s):  
Torsten Mattfeldt ◽  
Danilo Trijic ◽  
Hans‐Werner Gottfried ◽  
Hans A. Kestler

The subclassification of incidental prostatic carcinoma into the categories T1a and T1b is of major prognostic and therapeutic relevance. In this paper an attempt was made to find out which properties mainly predispose to these two tumor categories, and whether it is possible to predict the category from a battery of clinical and histopathological variables using newer methods of multivariate data analysis. The incidental prostatic carcinomas of the decade 1990–99 diagnosed at our department were reexamined. Besides acquisition of routine clinical and pathological data, the tumours were scored by immunohistochemistry for proliferative activity and p53‐overexpression. Tumour vascularization (angiogenesis) and epithelial texture were investigated by quantitative stereology. Learning vector quantization (LVQ) and support vector machines (SVM) were used for the purpose of prediction of tumour category from a set of 10 input variables (age, Gleason score, preoperative PSA value, immunohistochemical scores for proliferation and p53‐overexpression, 3 stereological parameters of angiogenesis, 2 stereological parameters of epithelial texture). In a stepwise logistic regression analysis with the tumour categories T1a and T1b as dependent variables, only the Gleason score and the volume fraction of epithelial cells proved to be significant as independent predictor variables of the tumour category. Using LVQ and SVM with the information from all 10 input variables, more than 80 of the cases could be correctly predicted as T1a or T1b category with specificity, sensitivity, negative and positive predictive value from 74–92%. Using only the two significant input variables Gleason score and epithelial volume fraction, the accuracy of prediction was not worse. Thus, descriptive and quantitative texture parameters of tumour cells are of major importance for the extent of propagation in the prostate gland in incidental prostatic adenocarcinomas. Classical statistical tools and neuronal approaches led to consistent conclusions.


1998 ◽  
Vol 10 (4) ◽  
pp. 955-974 ◽  
Author(s):  
Massimiliano Pontil ◽  
Alessandro Verri

Support vector machines (SVMs) perform pattern recognition between two point classes by finding a decision surface determined by certain points of the training set, termed support vectors (SV). This surface, which in some feature space of possibly infinite dimension can be regarded as a hyperplane, is obtained from the solution of a problem of quadratic programming that depends on a regularization parameter. In this article, we study some mathematical properties of support vectors and show that the decision surface can be written as the sum of two orthogonal terms, the first depending on only the margin vectors (which are SVs lying on the margin), the second proportional to the regularization parameter. For almost all values of the parameter, this enables us to predict how the decision surface varies for small parameter changes. In the special but important case of feature space of finite dimension m, we also show that there are at most m + 1 margin vectors and observe that m + 1 SVs are usually sufficient to determine the decision surface fully. For relatively small m, this latter result leads to a consistent reduction of the SV number.


Author(s):  
ZHAOWEI SHANG ◽  
YUAN YAN TANG ◽  
BIN FANG ◽  
JING WEN ◽  
YAT ZHOU ONG

The fusion of wavelet technique and support vector machines (SVMs) has become an intensive study in recent years. Considering that the wavelet technique is the theoretical foundation of multiresolution analysis (MRA), it is valuable for us to investigate the problem of whether a good performance could be obtained if we combine the MRA with SVMs for signal approximation. Based on the fact that the feature space of SVM and the scale subspace in MRA can be viewed as the same Reproducing Kernel Hilbert Spaces (RKHS), a new algorithm named multiresolution signal decomposition and approximation based on SVM is proposed. The proposed algorithm which approximates the signals hierarchically at different resolutions, possesses better approximation of smoothness for signal than conventional MRA due to using the approximation criterion of the SVM. Experiments illustrate that our algorithm has better approximation of performance than the MRA when being applied to stationary and non-stationary signals.


Sign in / Sign up

Export Citation Format

Share Document