Covering rough sets conceptualize different types of features with their respective generated coverings. By integrating these coverings into a single covering, covering set-based feature selection finds valuable from mixed decision system symbolic, real-valued, missing-valued and set-valued features. Existing approaches to selection, however, are intractable handle large data. Therefore, an eff...

We prove a general lemma (inspired by of Holroyd and Talbot) about the connection largest cardinalities (or weight) structures satisfying some hereditary property substructures same property. use it to show how results concerning forbidden subposet problems in Boolean poset imply analogous subspaces finite vector space. also study generalized subspaces.

This paper introduces a property over agents’ preferences, called Tops Responsiveness Condition. Such a property guarantees that the core in Hedonic Coalition Formation games is not empty. It is also shown that a mechanism exists that selects a stable allocation. It turns out that this mechanism, to be called tops covering, is strategy-proof even if the core is not a singleton. Furthermore, we ...

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...