To the reduct problems of decision system, the paper proposes the notion of dynamic core according to the dynamic reduct model. It describes various formal definitions of dynamic core, and discusses some properties about dynamic core. All of these show that dynamic core possesses the essential characters of the feature core.

To the reduct problems of decision system, the paper proposes the notion of dynamic core according to the dynamic reduct model. It describes various formal definitions of dynamic core, and discusses some properties about dynamic core. All of these show that dynamic core possesses the essential characters of the feature core.

Let C1 and C2 be strong amalgamation classes of finite structures, with disjoint finite signatures σ and τ . Then C1∧C2 denotes the class of all finite (σ∪τ)-structures whose σ-reduct is from C1 and whose τ -reduct is from C2. We prove that when C1 and C2 are Ramsey, then C1 ∧ C2 is also Ramsey. We also discuss variations of this statement, and give several examples of new Ramsey classes derive...

Granularrules have been extensively used for classification in fuzzy datasets to promote the advancement of artificial intelligence. However, due diversity data types, how improve readability extracted granular rules while ensuring efficiency is always a challenge. Since reduct computing (GrC) can simplify real complex problem and dataset, this article carries out rule learning from perspective...

We present a new quick algorithm for the solution of the well-known point location problem and for the more specific problem of point-in-polygon determination. Previous approaches to this problem are presented in the first sections of this paper. In the remainder of the paper, we present a new quick location algorithm based on a quaternary partition of the space, as well as its associated cost ...

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. The idea of algorithm is connected with so-called boundary subtables. After constr...