Given a fixed graph H, the H-free editing problem asks whether we can edit at most k edges to make contain no induced copy of H. We obtain polynomial kernel for this when H is diamond. The incompressibility dichotomy being 3-connected and classical complexity suggest that except complete/empty graph, problems admit kernels only few small graphs Therefore, believe our result an essential step to...

As it is not clear how to choose an appropriate kernel function for a specific learning problem, this paper examines the performance of three kernel functions with varied parameters for online handwritten character recognition. The three kernel functions evaluated are the polynomial, complete polynomial, and radial basis functions. Results show that the three functions perform comparably with t...

We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be imple...

Problem statement: To accept the inputs as spoken word utterances uttered by various speakers, recognize the corresponding spoken words and initiate action pertaining to that word. Approach: A novel Linear-Polynomial (LP) Kernel function was used to construct support vector machines to classify the spoken word utterances. The support vector machines were constructed using various kernel functio...

In this paper, we introduce a new technique to give evidence for combinatorial problems that they cannot be preprocessed in polynomial time such that resulting instances always have a size bounded by a polynomial in a specified parameter (or, in short: do not have a polynomial kernel); these results are assuming the validity of certain complexity theoretic assumptions. We build upon a framework...

Recent studies have shown strong correlation between social networking data and national influenza rates. We expanded upon this success to develop an automated text mining system that classifies Twitter messages in real time into six syndromic categories based on key terms from a public health ontology. 10-fold cross validation tests were used to compare Naive Bayes (NB) and Support Vector Mach...

Kernel methods such as support vector machines (SVMs) have attracted a great deal of popularity in the machine learning and natural language processing (NLP) communities. Polynomial kernel SVMs showed very competitive accuracy in many NLP problems, like part-of-speech tagging and chunking. However, these methods are usually too inefficient to be applied to large dataset and real time purpose. I...

For a non-negative integer $$\ell $$ , the -leaf power of tree T is simple graph G on leaves such that two vertices are adjacent in if and only their distance at most . We provide polynomial kernel for problem deciding whether we can delete k to make an input 3-leaf some tree. More specifically, present polynomial-time algorithm instance (G, k) output equivalent $$(G',k')$$ $$k'\leqslant k$$ $$...