Rees semigroups of digraphs for classification of data.
Let \(D=(V,E)\) be a digraph whose vertex set \(V=I\cup\Lambda \) can be split into two non-empty subsets \(I,\Lambda\); \(G\) a group, \(P=[{p_{\lambda i}}]\), \({p_{\lambda i}}\in G\) a \((\Lambda\times I)\)-matrix. Define multiplication on the set \(M_D^0(G;I,\Lambda;P)=\{\theta\cup(g;i,\lambda),\;i\in I,\;\lambda\in\Lambda\}\) by \[ (g_1;i_1,\lambda_1)\cdot(g_2;i_2,\lambda_2)=\begin{cases} (g_1p_{\lambda_1}i_2g_2;i_1,\lambda_2),\text{ if }(i_1,\lambda_2)\in E\\ \theta.\end{cases} \] If this multiplication is associative, \(M_D^0(G;I,\Lambda;P)\) is called the Rees semigroup of the digraph \(D\). For a finite subsemigroup \(S\) of the Rees semigroup of a digraph and for a zero-divisor-free idempotent semiring \(F\) with identity are described all ideals of the semigroup semiring \(F_0[S]\) which have largest possible weight; the weight of a semiring element is the number of its nonzero coefficients; the weight of a subset of elements the lower bound of the weights of nonzero elements in the subset.
- A data mining application of the incidence semirings
- A description of incidence rings of group automata.
- A formula for multiple classifiers in data mining based on Brandt semigroups
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- An algorithm for the optimization of multiple classifiers in data mining based on graphs
- Bipartite graphs and completely 0-simple semigroups.
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Centroid sets with largest weight in Munn semirings for data mining applications
- Classification systems based on combinatorial semigroups
- scientific article; zbMATH DE number 1024386 (Why is no real title available?)
- scientific article; zbMATH DE number 2031101 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Incidence semirings of graphs and visible bases.
- Internet security applications of the Munn rings
- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Optimization and matrix constructions for classification of data.
- Optimization of classifiers for data mining based on combinatorial semigroups
- Optimization of matrix semirings for classification systems.
- Rees matrix constructions for clustering of data.
- Ring constructions and applications
- Undecidable problems for completely 0-simple semigroups.
- Weak commutativity in idempotent semirings.
- Towards classification of semigraphoids.
- Perfect codes in power graphs of finite groups
- Finite groups whose noncyclic graphs have positive genus
- The metric dimension of the enhanced power graph of a finite group
- Ideal basis in constructions defined by directed graphs
- Finite groups with the same power graph
- Incidence semirings of graphs and visible bases.
- Rees matrix constructions for clustering of data.
- Rees matrix seminearring
This page was built for publication: Rees semigroups of digraphs for classification of data.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284651)
