2021
DOI: 10.3390/math9222889
|View full text |Cite
|
Sign up to set email alerts
|

Granule-Based-Classifier (GbC): A Lattice Computing Scheme Applied on Tree Data Structures

Abstract: Social robots keep proliferating. A critical challenge remains their sensible interaction with humans, especially in real world applications. Hence, computing with real world semantics is instrumental. Recently, the Lattice Computing (LC) paradigm has been proposed with a capacity to compute with semantics represented by partial order in a mathematical lattice data domain. In the aforementioned context, this work proposes a parametric LC classifier, namely a Granule-based-Classifier (GbC), applicable in a math… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 50 publications
(60 reference statements)
0
4
0
Order By: Relevance
“…The abovementioned needs, namely, regarding agricultural robotic end effectors, call for intelligent modeling that may also deal with structures. In the latter context, the lattice computing (LC) information processing paradigm [95] emerges to be promising [96,97] because it lends itself to mathematically rigorous analysis and design, as it will be demonstrated in a future work.…”
Section: Discussionmentioning
confidence: 99%
“…The abovementioned needs, namely, regarding agricultural robotic end effectors, call for intelligent modeling that may also deal with structures. In the latter context, the lattice computing (LC) information processing paradigm [95] emerges to be promising [96,97] because it lends itself to mathematically rigorous analysis and design, as it will be demonstrated in a future work.…”
Section: Discussionmentioning
confidence: 99%
“…We stress that this paper describes one possible approach led by the aesthetics of the authors among an infinite number of other possible approaches. One alternative approach would be to relate the two different domains using an isomorphic mapping between two different mathematical lattices [34]. Regarding possibilities closer to our work, some were tested during the process; however, these are a small fraction compared to what could be explored.…”
Section: Discussionmentioning
confidence: 99%
“…The polar coordinates for each node constitute the spatial arrangement of the nodes and their relation to each other. In this work, a human face was represented as a tree data structure induced from the facial landmarks, as presented in [39,40]. In this representation, selected landmarks were utilized to consequently construct a tree hierarchy of features, which was then used as a computational primitive in the context of lattice computing.…”
Section: Face Representationmentioning
confidence: 99%