Cayley graphs as classifiers for data mining: the influence of asymmetries

DOI10.1016/j.disc.2008.11.030zbMath1206.05050OpenAlexW2042466864MaRDI QIDQ1044901

John Yearwood, Joseph F. Ryan, Andrei V. Kelarev

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/57052

zbMATH Keywords

Cayley graphsfinite state automatonendomorphism monoidsperiodic semigroupclassification: monoid

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (only showing first 100 items - show all)

Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Metric and strong metric dimension in commuting graphs of finite groups ⋮ On the order supergraph of the power graph of a finite group ⋮ Cayley graphs of groupoids and generalized fat-trees ⋮ Normal subgroup based power graph of finite groups ⋮ On two-sided Cayley graphs of semigroups and groups ⋮ Connectivity of superpower graphs of some non-abelian finite groups ⋮ Beyond symmetry in generalized Petersen graphs ⋮ On groups with chordal power graph, including a classification in the case of finite simple groups ⋮ On the clique number and independence number of the cyclic graph of a semigroup ⋮ SYMMETRY GEOMETRY BY PAIRINGS ⋮ Perfect codes in proper reduced power graphs of finite groups ⋮ Signless and normalized Laplacian spectrums of the power graph and its supergraphs of certain finite groups ⋮ THE REGULAR GRAPH OF A NONCOMMUTATIVE RING ⋮ Some properties of various graphs associated with finite groups ⋮ A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY ⋮ Strong metric dimensions for power graphs of finite groups ⋮ On transitive Cayley graphs of pseudo-unitary homogeneous semigroups ⋮ On Combinatorial Properties of Bands ⋮ INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES ⋮ THE JOIN OF SPLIT GRAPHS WHOSE QUASI-STRONG ENDOMORPHISMS FORM A MONOID ⋮ Graph variety generated by linear terms ⋮ Internet security applications of the Munn rings ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ CAYLEY SUM GRAPHS OF IDEALS OF A COMMUTATIVE RING ⋮ The annihilator graph of a commutative semigroup ⋮ On enhanced power graphs of certain groups ⋮ Projective zero divisor graphs of partially ordered sets ⋮ Annihilator graphs with four vertices ⋮ The join of split graphs whose completely regular endomorphisms form a monoid ⋮ Rees semigroups of digraphs for classification of data. ⋮ Forbidden subgraphs in reduced power graphs of finite groups ⋮ Note on structural properties of graphs ⋮ Automorphism Group of Generalized Cayley Graph of Upper Triangular Matrices ⋮ On the connected power graphs of semigroups of homogeneous elements of graded rings ⋮ The power graph of a torsion-free group of nilpotency class 2 ⋮ Some properties of the idempotent graph of a ring ⋮ On enhanced power graphs of finite groups ⋮ On the Cayley \(\mathcal D\)-saturated property of semigroups. ⋮ End-regular and End-orthodox generalized lexicographic products of bipartite graphs ⋮ Finite groups with the same power graph ⋮ The structure of Cayley graphs of dihedral groups of Valencies 1, 2 and 3 ⋮ Edge-transitivity of Cayley graphs generated by transpositions ⋮ On transitive generalized Cayley graphs of semigroups ⋮ On the saturated numerical semigroups ⋮ Hidden symmetries in simple graphs ⋮ On Cayley graphs of completely 0-simple semigroups ⋮ On the generalization of Cayley graphs of commutative rings ⋮ On the connectivity of enhanced power graphs of finite groups ⋮ Unit graphs of rings of polynomials and power series ⋮ A survey on enhanced power graphs of finite groups ⋮ Automorphism groups of some generalized Cayley graphs ⋮ Graphs and ranks of monoids ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3 ⋮ The endomorphism monoids and automorphism groups of Cayley graphs of semigroups ⋮ Finite groups whose intersection power graphs are toroidal and projective-planar ⋮ Line graph characterization of power graphs of finite nilpotent groups ⋮ On the metric dimension of Cayley graphs ⋮ Semigroups of strong endomorphisms of infinite graphs and hypergraphs. ⋮ The power index of a graph ⋮ Rainbow tetrahedra in Cayley graphs ⋮ Perfect codes in power graphs of finite groups ⋮ On color-automorphism vertex transitivity of semigroups ⋮ The regular digraph associated to a poset ⋮ Vertex connectivity of the power graph of a finite cyclic group II ⋮ Generalized Cayley graphs of semigroups. II. ⋮ Generalized Cayley graphs of semigroups. I. ⋮ On Cayley graphs of semilattices of semigroups. ⋮ A problem on generalized Cayley graphs of semigroups. ⋮ A study of enhanced power graphs of finite groups ⋮ Generalized Cayley graphs associated to commutative rings ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Certain properties of the enhanced power graph associated with a finite group ⋮ On the independence number of the power graph of a finite group ⋮ The strong metric dimension of the power graph of a finite group ⋮ A description of the Cayley graphs of homogeneous semigroups ⋮ Classification systems based on combinatorial semigroups ⋮ Fibonacci-like growth of numerical semigroups of a given genus. ⋮ The structure and metric dimension of the power graph of a finite group ⋮ Centroid sets with largest weight in Munn semirings for data mining applications ⋮ When is the cayley graph of a semigroup isomorphic to the cayley graph of a group ⋮ Finite groups whose noncyclic graphs have positive genus ⋮ The structure of isomorphic digraph from powers modulo \(p^e\) ⋮ The Complexity of Power Graphs Associated With Finite Groups ⋮ An algorithm for finding minimal generating sets of finite groups ⋮ On the Cayley graphs of completely simple semigroups ⋮ Pairings and related symmetry notions ⋮ BIPARTITE DIVISOR GRAPH FOR THE PRODUCT OF SUBSETS OF INTEGERS ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ On the Cayley graphs of completely simple semigroups. ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ On Cayley graphs of rectangular groups ⋮ Zero divisor graph of a lattice with respect to an ideal ⋮ CAYLEY GRAPHS OF PARTIALLY ORDERED SETS ⋮ Graphs and their associated inverse semigroups ⋮ \(D\)-saturated property of the Cayley graphs of semigroups. ⋮ On the automorphism groups of vertex-transitive Cayley digraphs of monoids ⋮ INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Finite groups with star-free noncyclic graphs

Cites Work

• Endomorphism spectra of graphs
• Periodic gossiping in commuted networks
• Logical aspects of Cayley-graphs: the group case
• On Cayley graphs of bands
• A formula for multiple classifiers in data mining based on Brandt semigroups
• On transitive Cayley graphs of strong semilattices of right (left) groups
• E-unitary inverse monoids and the Cayley graph of a group presentation
• Designing fault-tolerant systems using automorphisms
• Processor interconnection networks from Cayley graphs
• On the isomorphism problem for finite Cayley graphs of bounded valency
• Methods and problems of communication in usual networks
• On congruences of automata defined by directed graphs
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• Directed graphs and combinatorial properties of semigroups
• An answer to a question of Kelarev and Praeger on Cayley graphs of semigroups.
• Formal properties of finite automata and applications. LITP Spring school on theoretical computer science, Ramatuelle, France, May 23-27, 1988. Proceedings
• A global optimization approach to classification
• A combinatorial property and Cayley graphs of semigroups
• On transitive Cayley graphs of groups and semigroups
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Characterizations of Clifford semigroup digraphs
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Finite state automata: A geometric approach
• The forwarding index of communication networks
• SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS
• Group Action Graphs and Parallel Architectures
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
• A survey of gossiping and broadcasting in communication networks
• A group-theoretic model for symmetric interconnection networks
• Representations and routing for Cayley graphs (computer networks)
• Algebraic Graph Theory
• Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
• Finite normal edge-transitive Cayley graphs
• Two Algorithms For Languages Recognized By Graph Algebras
• OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
• Cayley graphs with optimal fault tolerance
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
• REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cayley graphs as classifiers for data mining: the influence of asymmetries