Related papers: Another Generic Setting for Entity Resolution: Bas…
Entity resolution is a widely studied problem with several proposals to match records across relations. Matching textual content is a widespread task in many applications, such as question answering and search. While recent methods achieve…
We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…
Entity matching (EM) is a fundamental task in data integration and analytics, essential for identifying records that refer to the same real-world entity across diverse sources. In practice, datasets often differ widely in structure, format,…
The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…
For a given ergodic measure preserving transformation T of a standard measure space each finite labelled partition defines an ergodic stationary process. There is a complete metric on the space of partitions which is separable. Various…
We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…
We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…
For this paper, we studied the time evolution of a system of coagulating particles under a generalized electrorheological (ER) kernel with real power, $K\left(i,j\right) = \left( \frac{1}{i}+\frac{1}{j} \right)^\alpha$, and monodisperse…
Real-world applications frequently seek to solve a general form of the Entity Matching (EM) problem to find associated entities. Such scenarios include matching jobs to candidates in job targeting, matching students with courses in online…
In this paper we presents further developments regarding the enrichment of the basic Theory of Order Completion. In particular, spaces of generalized functions are constructed that contain generalized solutions to all systems of continuous,…
Correlations in Einstein-Podolsky-Rosen (EPR) scenarios, captured by \textit{assemblages} of unnormalised quantum states, have recently caught the attention of the community, both from a foundational and an information-theoretic…
Entity disambiguation (ED), which links the mentions of ambiguous entities to their referent entities in a knowledge base, serves as a core component in entity linking (EL). Existing generative approaches demonstrate improved accuracy…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…
This paper covers automated settlement of receivables in non-governmental organizations. We tackle the problem with entity matching techniques. We consider setup, where base algorithm is used for preliminary ranking of matches, then we…
This paper deals with the issue of conceptual models role in capturing semantics and aligning them to serve the remaining development phases of systems design. Specifically, the entity-relationship (ER) model is selected as an example of…
In this article we develop a convergence theory for goal-oriented adaptive finite element algorithms designed for a class of second-order semilinear elliptic equations. We briefly discuss the target problem class, and introduce several…
Conceptual modelling using the entity relationship (ER) model has been widely used for database design for a long period of time. However, studies indicate that creating a satisfactory relational model representation from an ER model is…
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being applied in practical settings on large real-life datasets.…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
Edge (or N\'ed\'elec) finite elements are theoretically sound and widely used by the computational electromagnetics community. However, its implementation, specially for high order methods, is not trivial, since it involves many…