Related papers: Compatibility support mappings in effect algebras
Modern deep learning-based recommendation systems exploit hundreds to thousands of different categorical features, each with millions of different categories ranging from clicks to posts. To respect the natural diversity within the…
In recent years, we have witnessed the proliferation of knowledge graphs (KG) in various domains, aiming to support applications like question answering, recommendations, etc. A frequent task when integrating knowledge from different KGs is…
Effect algebras were introduced in order to describe the structure of effects, i.e. events in quantum mechanics. They are partial algebras describing the logic behind the corresponding events. It is natural to ask how to introduce the…
We show that the notions of homotopy epimorphism and homological epimorphism in the category of differential graded algebras are equivalent. As an application we obtain a characterization of acyclic maps of topological spaces in terms of…
Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…
We explore in depth how categorical data can be processed with embeddings in the context of claim severity modeling. We develop several models that range in complexity from simple neural networks to state-of-the-art attention based…
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…
Embeddings are a fundamental component of many modern machine learning and natural language processing models. Understanding them and visualizing them is essential for gathering insights about the information they capture and the behavior…
In the paper the main attention is paid to conditions on algebras from a given variety which provide coincidence of their algebraic geometries. The main part here play the notions mentioned in the title of the paper.
We introduce many new generalizations of Poisson algebras which can be constructed inside the associative algebra of linear transformations over a vector space.
We review the new approach to the theory of nonlinear $W$-algebras which is developed recently and called {\it conformal linearization}. In this approach $W$-algebras are embedded as subalgebras into some {\it linear conformal} algebras…
Graph embedding techniques are useful to characterize spectral signature relations for hyperspectral images. However, such images consists of disjoint classes due to spatial details that are often ignored by existing graph computing tools.…
In this paper we characterize the effect algebras whose sharp and principal elements coincide. We also give examples of two non-isomorphic effect algebras having the same universum, partial order and orthosupplementation.
We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…
Machine learning models can automatically learn complex relationships, such as non-linear and interaction effects. Interpretable machine learning methods such as partial dependence plots visualize marginal feature effects but may lead to…
Many innovative applications require establishing correspondences among 3D geometric objects. However, the countless possible deformations of smooth surfaces make shape matching a challenging task. Finding an embedding to represent the…
Representation learning on graphs has been gaining attention due to its wide applicability in predicting missing links, and classifying and recommending nodes. Most embedding methods aim to preserve certain properties of the original graph…
Calibration is a frequently invoked concept when useful label probability estimates are required on top of classification accuracy. A calibrated model is a function whose values correctly reflect underlying label probabilities. Calibration…
The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…