Algebraic, Topological, and Mereological Foundations of Existential
Granules
- URL: http://arxiv.org/abs/2308.16157v2
- Date: Fri, 22 Sep 2023 21:54:13 GMT
- Title: Algebraic, Topological, and Mereological Foundations of Existential
Granules
- Authors: A Mani
- Abstract summary: Existential granules are those that determine themselves initially, and interact with their environment subsequently.
It is shown that they fit into multiple theoretical frameworks (axiomatic, adaptive, and others) of granular computing.
The characterization is intended for algorithm development, application to classification problems and possible mathematical foundations of generalizations.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this research, new concepts of existential granules that determine
themselves are invented, and are characterized from algebraic, topological, and
mereological perspectives. Existential granules are those that determine
themselves initially, and interact with their environment subsequently.
Examples of the concept, such as those of granular balls, though inadequately
defined, algorithmically established, and insufficiently theorized in earlier
works by others, are already used in applications of rough sets and soft
computing. It is shown that they fit into multiple theoretical frameworks
(axiomatic, adaptive, and others) of granular computing. The characterization
is intended for algorithm development, application to classification problems
and possible mathematical foundations of generalizations of the approach.
Additionally, many open problems are posed and directions provided.
Related papers
- Ontology Embedding: A Survey of Methods, Applications and Resources [54.3453925775069]
Ontologies are widely used for representing domain knowledge and meta data.
One straightforward solution is to integrate statistical analysis and machine learning.
Numerous papers have been published on embedding, but a lack of systematic reviews hinders researchers from gaining a comprehensive understanding of this field.
arXiv Detail & Related papers (2024-06-16T14:49:19Z) - Ontology Revision based on Pre-trained Language Models [32.92146634065263]
Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology.
Incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers.
To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms.
In this paper, we study how to apply pre-trained models to revise.
arXiv Detail & Related papers (2023-10-27T00:52:01Z) - Higher-order topological kernels via quantum computation [68.8204255655161]
Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data.
We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
arXiv Detail & Related papers (2023-07-14T14:48:52Z) - Parmesan: mathematical concept extraction for education [0.5520082338220947]
We develop a prototype system for searching for and defining mathematical concepts in context, focusing on the field of category theory.
This system depends on natural language processing components including concept extraction, relation extraction, definition extraction, and entity linking.
We also provide two cleaned mathematical corpora that power the prototype system, which are based on journal articles and wiki pages.
arXiv Detail & Related papers (2023-07-13T11:55:03Z) - Granular-ball computing: an efficient, robust, and interpretable
adaptive multi-granularity representation and computation method [54.2899493638937]
Human cognition operates on a "Global-first" cognitive mechanism, prioritizing information processing based on coarse-grained details.
The analysis pattern reliance on the finest granularity and single-granularity makes most existing computational methods less efficient, robust, and interpretable.
Multi-granularity granular-ball computing employs granular-balls of varying sizes to daptively represent and envelop the sample space.
Granular-ball computing is a rare and innovative theoretical approach in AI that can adaptively and simultaneously enhance efficiency, robustness, and interpretability.
arXiv Detail & Related papers (2023-04-21T03:26:29Z) - From axioms over graphs to vectors, and back again: evaluating the
properties of graph-based ontology embeddings [78.217418197549]
One approach to generating embeddings is by introducing a set of nodes and edges for named entities and logical axioms structure.
Methods that embed in graphs (graph projections) have different properties related to the type of axioms they utilize.
arXiv Detail & Related papers (2023-03-29T08:21:49Z) - Granular Directed Rough Sets, Concept Organization and Soft Clustering [0.0]
Up-directed rough sets are introduced and studied by the present author in earlier papers.
This is extended by her in two different granular directions, with a surprising algebraic semantics.
This research is expected to see significant theoretical and practical applications in related domains.
arXiv Detail & Related papers (2022-08-13T11:01:05Z) - Geometric Methods for Sampling, Optimisation, Inference and Adaptive
Agents [102.42623636238399]
We identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making.
We derive algorithms that exploit these geometric structures to solve these problems efficiently.
arXiv Detail & Related papers (2022-03-20T16:23:17Z) - Artificial Cognitively-inspired Generation of the Notion of Topological
Group in the Context of Artificial Mathematical Intelligence [0.0]
We provide the explicit artificial generation (or conceptual computation) for the fundamental mathematical notion of topological groups.
The concept of topological groups is explicitly generated through three different artificial specifications.
arXiv Detail & Related papers (2021-12-05T01:39:34Z) - Formalising Concepts as Grounded Abstractions [68.24080871981869]
This report shows how representation learning can be used to induce concepts from raw data.
The main technical goal of this report is to show how techniques from representation learning can be married with a lattice-theoretic formulation of conceptual spaces.
arXiv Detail & Related papers (2021-01-13T15:22:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.