Abstract We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably one-types, then it reduct. Similarly, $Th(M)$ is not small, $M^{eq}$ reduct, and T $\omega $ -stable, the elementary diagram of some model

Dense pairs of geometric topological fields have tame open core, that is, every definable subset in the pair is already reduct. We fix a minor gap published version van den Dries's seminal work on dense o-minimal groups, and show unary function agrees with reduct, off small subset, set internal to predicate. For certain without independence property, whenever underlying group contained dense-co...

Essentially, the solution to an attribute reduction problem can be viewed as a reduct searching process. Currently, among various strategies, meta-heuristic has received extensive attention. As new emerging approach, forest optimization algorithm (FOA) is introduced solving of in this study. To further improve classification performance selected attributes reduct, ensemble framework also develo...

The research of attribute characters in information system which contains core, necessary, unnecessary is a basic and important issue in attribute reduct. Many methods for the judgement of attribute characters are based on the relationship between the objects and attributes. In this paper, a new type of judgement theorems which are absolutely based on the relationship among attributes is propos...

This work was supported by Science and Technology Commission of Shanghai Municipality, No.705931 ABSTRACT In the view of granularity, this paper analyzes the influence of three attribute reducts on an information system, finding that the possible reduct and − μ decision reduct will make the granule view coarser, while discernible reduct will not change the granule view. In addition, we investig...

The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernabilitymatrixes to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format...

This paper proposes a reduct construction method based on discernibility matrix simplification. The method works with genetic algorithm. To identify potential problems and prevent complete failure of bearings, a new method based on rule-based classifier ensemble is presented. Genetic algorithm is used for feature reduction. The generated rules of the reducts are used to build the candidate base...

In this paper, on the basis of studying the limitations of the basic rough set model, we present a general rough set model, which is based on a family set of tolerance relations which is based on a family set of tolerance relations instead of equivalence relations between objects. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect ...