Related papers: A Note on Rough Set Algebra and Core Regular Doubl…
PCA is one of the most widely used dimension reduction techniques. A related easier problem is "subspace learning" or "subspace estimation". Given relatively clean data, both are easily solved via singular value decomposition (SVD). The…
In formal concept analysis, the collection of protoconcepts of any context forms a double Boolean algebra (dBa) which is fully contextual. Semiconcepts of a context form a pure dBa. The present article is a study on topological…
In this work, we study the robust subspace tracking (RST) problem and obtain one of the first two provable guarantees for it. The goal of RST is to track sequentially arriving data vectors that lie in a slowly changing low-dimensional…
Reinforcement learning (RL) is recognized as lacking generalization and robustness under environmental perturbations, which excessively restricts its application for real-world robotics. Prior work claimed that adding regularization to the…
Emergences of computers and information technological revolution made tremendous changes in the real world and provides a different dimension for the intelligent data analysis. Well formed fact, the information at right time and at right…
Solving algebra problems (APs) continues to attract significant research interest as evidenced by the large number of algorithms and theories proposed over the past decade. Despite these important research contributions, however, the body…
This paper extends the theory of rough convergence from normed linear spaces to the more abstract setting of Riesz spaces. We introduce and systematically develop the concept of rough $\mathbb{c}$-convergence ($rc$-convergence) for nets. A…
A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…
The multiparticle spacetime algebra (MSTA) is an extension of Dirac theory to a multiparticle setting, which was first studied by Doran, Gull and Lasenby. The geometric interpretation of this algebra, which it inherits from its one-particle…
Ryabinkin-Kohut-Staroverov (RKS) theory builds a bridge between wave function theory and density functional theory by using quantities from the former to produce accurate exchange-correlation potentials needed by the latter. In this work,…
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 in this research, with a surprising algebraic semantics. The granules are based on ideas…
We propose a new ensemble prediction method, Random Subset Averaging (RSA), tailored for settings with many covariates, particularly in the presence of strong correlations. RSA constructs candidate models via binomial random subset strategy…
In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…
Both algebraic and computational approaches for dealing with similarity spaces are well known in generalized rough set theory. However, these studies may be said to have been confined to particular perspectives of distinguishability in the…
We investigate Refined Algebraic Quantization (RAQ) with group averaging in a constrained Hamiltonian system with unreduced phase space T^*R^4 and gauge group SL(2,R). The reduced phase space M is connected and contains four mutually…
In this paper, we show that every quasiorder $R$ induces a Nelson algebra $\mathbb{RS}$ such that the underlying rough set lattice $RS$ is algebraic. We note that $\mathbb{RS}$ is a three-valued {\L}ukasiewicz algebra if and only if $R$ is…
In this paper, the mining of hybrid association rules with rough set approach is investigated as the algorithm RSHAR.The RSHAR algorithm is constituted of two steps mainly. At first, to join the participant tables into a general table to…
We consider solving linear optimization (LO) problems with uncertain objective coefficients. For such problems, we often employ robust optimization (RO) approaches by introducing an uncertainty set for the unknown coefficients. Typical RO…
Relative Geologic Time (RGT) estimation from seismic data is a cornerstone of subsurface structural modeling, depositional evolution analysis, and reservoir characterization, supporting horizon correlation and depositional system…