Let D be a connected oriented graph. A set S ⊆ V (D) is convex in D if, for every pair of vertices x, y ∈ S, the vertex set of every x− y geodesic (x− y shortest dipath) and y−x geodesic in D is contained in S. The convexity number con(D) of a nontrivial oriented graph D is the maximum cardinality of a proper convex set of D. Let G be a graph and SC(G) = {con(D) : D is an orientation of G} and ...

Abstract Automatic heart disease detection from human heartbeats is a challenging and intellectual assignment in signal processing because periodically monitoring of the beat arrhythmia for patient an essential task to reduce death rate due cardiovascular (CVD). In this paper, focus research design hybrid Convolutional Neural Network (CNN) architecture by making use Grasshopper Optimization Alg...

We concentrate on the problem of feature selection on sign language classification. The goal is to maximize the classification accuracy using a proper subset of features out of totally 22 given features. In this work, we employ two search methods: Hill Climbing approach and Random Walk approach, to select the features. We claim that both algorithms are easy-implemented but reasonable and effici...

microarray data have an important role in identification and classification of the cancer tissues. having a few samples of microarrays in cancer researches is always one of the most concerns which lead to some problems in designing the classifiers. for this matter, preprocessing gene selection techniques should be utilized before classification to remove the noninformative genes from the microa...

Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings – Noetherian semirings, natural numbers – are proper. Properness matters as the equivalence problem for weighted automata over a semiring which is proper and finitely and effectively presented is decidable. Milius generalised the notion of properness from a semiring to a functor. As...

Automatic classification of text documents has become an important research issue now days. Proper classification of text documents requires information retrieval, machine learning and Natural language processing (NLP) techniques. Our aim is to focus on important approaches to automatic text classification based on machine learning techniques viz. supervised, unsupervised and semi supervised. I...

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determine a symmetric loss in full from half of one of its partial losses, introduc...

An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices (u,v), the contains a directed path (a walk) from u to v such that arcs adjacent on (on have distinct colors. The proper connection number pc→(D) (the proper-walk wc→(D)) minimum colours make (properly-walk connected). We prove pc→(Cn(S))≤2 every circulant Cn(S) with S⊆{1,…,n−1},|S|≥2 and 1∈S. Fu...