scholarly journals Methods of classification and algorithms of graph coloring

2021 ◽  
Vol 16 ◽  
pp. 135
Author(s):  
V.A. Perepelitsa ◽  
I.V. Kozin ◽  
S.V. Kurapov
Keyword(s):  
Graph Coloring ◽  
Optimality Criterion ◽  
Proper Coloring ◽  
Proximity Measure ◽  
Adjacency Graph ◽  
Finite Set

We study the connection between classifications on finite set and the problem of graph coloring. We consider the optimality criterion for classification of special type: h-classifications, which are built on the base of proximity measure. It is shown that the problem of finding the optimal h-classification can be reduced to the problem of coloring of non-adjacency graph vertices by the smallest possible number of colors. We consider algorithms of proper coloring of graph vertices.

Analysis of statistical coefficients and autoregressive parameters over intrinsic mode functions (IMFs) for epileptic seizure detection

2020 ◽  
Vol 65 (6) ◽  
pp. 693-704
Author(s):  
Rafik Djemili
Keyword(s):  
Involuntary Movement ◽  
Epileptic Seizures ◽  
Intrinsic Mode Functions ◽  
Eeg Signals ◽  
Time Segment ◽  
Feature Extraction Method ◽  
Mode Decomposition ◽  
Finite Set ◽  
Student’S T

AbstractEpilepsy is a persistent neurological disorder impacting over 50 million people around the world. It is characterized by repeated seizures defined as brief episodes of involuntary movement that might entail the human body. Electroencephalography (EEG) signals are usually used for the detection of epileptic seizures. This paper introduces a new feature extraction method for the classification of seizure and seizure-free EEG time segments. The proposed method relies on the empirical mode decomposition (EMD), statistics and autoregressive (AR) parameters. The EMD method decomposes an EEG time segment into a finite set of intrinsic mode functions (IMFs) from which statistical coefficients and autoregressive parameters are computed. Nevertheless, the calculated features could be of high dimension as the number of IMFs increases, the Student’s t-test and the Mann–Whitney U test were thus employed for features ranking in order to withdraw lower significant features. The obtained features have been used for the classification of seizure and seizure-free EEG signals by the application of a feed-forward multilayer perceptron neural network (MLPNN) classifier. Experimental results carried out on the EEG database provided by the University of Bonn, Germany, demonstrated the effectiveness of the proposed method which performance assessed by the classification accuracy (CA) is compared to other existing performances reported in the literature.

On certain coloring parameters of Mycielski graphs of some graphs

2018 ◽  
Vol 10 (03) ◽  
pp. 1850030
Author(s):  
N. K. Sudev ◽  
K. P. Chithra ◽  
K. A. Germina ◽  
S. Satheesh ◽  
Johan Kok
Keyword(s):  
Graph Coloring ◽  
Random Variable ◽  
Proper Coloring ◽  
Discrete Random Variable ◽  
Variable Formula ◽  
Statistical Measures ◽  
Random Experiment ◽  
Mean And Variance

Coloring the vertices of a graph [Formula: see text] according to certain conditions can be considered as a random experiment and a discrete random variable [Formula: see text] can be defined as the number of vertices having a particular color in the proper coloring of [Formula: see text]. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph coloring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the coloring parameters of the Mycielskian of certain standard graphs.

Classification of Encryption Algorithms using Fisher’s Discriminant Analysis

2016 ◽  
Vol 67 (1) ◽  
pp. 59 ◽  
Author(s):  
Prabhat Kumar Ray ◽  
Shrikant Ojha ◽  
Bimal Kumar Roy ◽  
Ayanendranath Basu
Keyword(s):  
Machine Learning ◽  
Discriminant Analysis ◽  
Block Cipher ◽  
Good Classification ◽  
Finite Set ◽  
Encryption Algorithms ◽  
Fisher’S Discriminant Analysis

<p>Fisher’s Discriminant Analysis (FDA) is a method used in statistics and machine learning which can often lead to good classification between several populations by maximizing the separation between the populations. We will present some applications of FDA that discriminate between cipher texts in terms of a finite set of encryption algorithms. Specifically, we use ten algorithms, five each of stream and block cipher types. Our results display good classification with some of the features. In the present case we have little in terms of an existing standard; however, our limited study clearly shows that further exploration of this issue could be worthwhile.</p>

Application of optimization tasks in cluster analysis

10.12737/7483 ◽  
2014 ◽  
Vol 8 (7) ◽  
pp. 0-0
Author(s):  
Олег Сдвижков ◽  
Oleg Sdvizhkov
Keyword(s):  
Cluster Analysis ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Clustering Algorithms ◽  
Clustering Methods ◽  
Number Of Clusters ◽  
Homogeneous Groups ◽  
Finite Set ◽  
Minimum Number

Cluster analysis [3] is a relatively new branch of mathematics that studies the methods partitioning a set of objects, given a finite set of attributes into homogeneous groups (clusters). Cluster analysis is widely used in psychology, sociology, economics (market segmentation), and many other areas in which there is a problem of classification of objects according to their characteristics. Clustering methods implemented in a package STATISTICA [1] and SPSS [2], they return the partitioning into clusters, clustering and dispersion statistics dendrogram of hierarchical clustering algorithms. MS Excel Macros for main clustering methods and application examples are given in the monograph [5]. One of the central problems of cluster analysis is to define some criteria for the number of clusters, we denote this number by K, into which separated are a given set of objects. There are several dozen approaches [4] to determine the number K. In particular, according to [6], the number of clusters K - minimum number which satisfies where - the minimum value of total dispersion for partitioning into K clusters, N - number of objects. Among the clusters automatically causes the consistent application of abnormal clusters [4]. In 2010, proposed and experimentally validated was a method for obtaining the number of K by applying the density function [4]. The article offers two simple approaches to determining K, where each cluster has at least two objects. In the first number K is determined by the shortest Hamiltonian cycles in the second - through the minimum spanning tree. The examples of clustering with detailed step by step solutions and graphic illustrations are suggested. Shown is the use of macro VBA Excel, which returns the minimum spanning tree to the problems of clustering. The article contains a macro code, with commentaries to the main unit.

scholarly journals On the Number of Similar Instances of a Pattern in a Finite Set

10.37236/4972 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Bernardo M. Ábrego ◽  
Silvia Fernández-Merchant ◽  
Daniel J. Katz ◽  
Levon Kolesnikov
Keyword(s):  
Arithmetic Progression ◽  
Finite Subset ◽  
Upper Bound ◽  
Point Subset ◽  
Finite Set ◽  
Equilateral Triangles ◽  
Optimal Configurations ◽  
Full Classification ◽  
General Method

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is shown to be no more than $\lfloor{(4 n-1)(n-1)/18}\rfloor$. The number of $k$-term arithmetic progressions that lie within an $n$-point subset of the line is shown to be at most $(n-r)(n+r-k+1)/(2 k-2)$, where $r$ is the remainder when $n$ is divided by $k-1$. This upper bound is achieved when the $n$ points themselves form an arithmetic progression, but for some values of $k$ and $n$, it can also be achieved for other configurations of the $n$ points, and a full classification of such optimal configurations is given. These results are achieved using a new general method based on ordering relations.

scholarly journals Measuring the Significance of Policy Outputs with Positive Unlabeled Learning

2020 ◽  
pp. 1-8
Author(s):  
RADOSLAW ZUBEK ◽  
ABHISHEK DASGUPTA ◽  
DAVID DOYLE
Keyword(s):  
United Kingdom ◽  
Construct Validity ◽  
Government Regulations ◽  
New Approach ◽  
The United Kingdom ◽  
Novel Approach ◽  
Pu Learning ◽  
Finite Set ◽  
Small Set

Identifying important policy outputs has long been of interest to political scientists. In this work, we propose a novel approach to the classification of policies. Instead of obtaining and aggregating expert evaluations of significance for a finite set of policy outputs, we use experts to identify a small set of significant outputs and then employ positive unlabeled (PU) learning to search for other similar examples in a large unlabeled set. We further propose to automate the first step by harvesting “seed” sets of significant outputs from web data. We offer an application of the new approach by classifying over 9,000 government regulations in the United Kingdom. The obtained estimates are successfully validated against human experts, by forecasting web citations, and with a construct validity test.

Classification of maps on a finite set under permutation

2020 ◽  
Author(s):  
Juan Luis García Zapata ◽  
Juan‐Antonio Rico‐Gallego
Keyword(s):  
Finite Set ◽  
Classification Of Maps

scholarly journals On the Balmer spectrum for compact Lie groups

2019 ◽  
Vol 156 (1) ◽  
pp. 39-76
Author(s):  
Tobias Barthel ◽  
J. P. C. Greenlees ◽  
Markus Hausmann
Keyword(s):  
Lie Groups ◽  
Lie Group ◽  
Complete Classification ◽  
Prime Ideals ◽  
Compact Lie Group ◽  
Compact Lie Groups ◽  
Finite Set

We study the Balmer spectrum of the category of finite $G$-spectra for a compact Lie group $G$, extending the work for finite $G$ by Strickland, Balmer–Sanders, Barthel–Hausmann–Naumann–Nikolaus–Noel–Stapleton and others. We give a description of the underlying set of the spectrum and show that the Balmer topology is completely determined by the inclusions between the prime ideals and the topology on the space of closed subgroups of $G$. Using this, we obtain a complete description of this topology for all abelian compact Lie groups and consequently a complete classification of thick tensor ideals. For general compact Lie groups we obtain such a classification away from a finite set of primes $p$.

A characterization of piecewise linear homology manifolds

1983 ◽  
Vol 93 (2) ◽  
pp. 271-274 ◽  
Author(s):  
W. J. R. Mitchell
Keyword(s):  
Piecewise Linear ◽  
Subsequent Paper ◽  
Locally Compact ◽  
Locally Finite ◽  
Finite Dimensional ◽  
Finite Set ◽  
Topological Manifolds ◽  
Homology Manifolds

We state and prove a theorem which characterizes piecewise linear homology manifolds of sufficiently large dimension among locally compact finite-dimensional absolute neighbourhood retracts (ANRs). The proof is inspired by Cannon's observation (3) that a piecewise linear homology manifold is a topological manifold away from a locally finite set, and uses Galewski and Stern's work on simplicial triangulations of topological manifolds, the Edwards–Cannon–Quinn characterization of topological manifolds and Siebenmann's work on ends (3, 6, 4, 13, 14, 15, 16). All these tools have suitable relative versions and so the theorem can be extended to the bounded case. However, the most satisfactory extension requires a classification of triangulations of homology manifolds up to concordance. This will be given in a subsequent paper and the bounded case will be postponed to that paper.

Sign in / Sign up

Export Citation Format

Share Document