Zobrazeno 1 - 10
of 80
pro vyhledávání: '"James B. Nation"'
Autor:
James B. Nation, Ralph Freese
Publikováno v:
International Journal of Algebra and Computation. 31:219-224
Under broad finiteness conditions, such as the existence of a greatest or least element, a semidistributive lattice has the two element lattice as a homomorphic image, and so, if it has more than two elements, is not simple. However, the existence of
Publikováno v:
Journal of computational biology : a journal of computational molecular cell biology. 28(10)
This study applied two mathematical algorithms, lattice up-stream targeting (LUST) and D-basis, to the identification of prognostic signatures from cancer gene expression data. The LUST algorithm l...
Publikováno v:
Order. 36:65-76
This paper investigates the computational complexity of deciding if a given finite algebra is an expansion of a semilattice. In general this problem is known to be EXP-TIME complete, and we show that even for idempotent algebras, this problem remains
Publikováno v:
Order. 35:133-137
A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter, each of which can be partitioned into an ideal and a filter, etc., until you reach 1-element lattices. In this note, we find a quasi-equational basis for t
Autor:
James B. Nation, Kira Adaricheva
Publikováno v:
Theoretical Computer Science. 658:307-315
Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. We introduce a novel approach for the discovery of a specific se
Autor:
James B. Nation
Publikováno v:
Algebra universalis. 80
Publikováno v:
Studia Logica. 104:305-316
The duality between congruence lattices of semilattices, and algebraic subsets of an algebraic lattice, is extended to include semilattices with operators. For a set G of operators on a semilattice S, we have $${{\rm Con}(S,+,0,G) \cong^{d} {{\rm S}_
We develop a new approach for distributed computing of the association rules of high confidence in a binary table. It is derived from the D-basis algorithm in K. Adaricheva and J.B. Nation (TCS 2017), which is performed on multiple sub-tables of a ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ee49218a98f18fc27215499189f653c
https://zenodo.org/record/1480630
https://zenodo.org/record/1480630
Autor:
James B. Nation
Publikováno v:
Algebra universalis. 79
Autor:
James B. Nation, Joy Nishida
Publikováno v:
Algebra universalis. 79
A stronger version of a known property is shown to hold for the natural equaclosure operator on subquasivariety lattices.