Boundary optimization for rough sets

DOI10.1016/J.DISC.2018.05.023zbMATH Open1392.05010arXiv1709.05109OpenAlexW2963112516MaRDI QIDQ724858FDOQ724858

Authors: Konrad Engel, Tran Dan Thu 

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $n>mge2$ be integers and let $mathcalA=A_1,dots,A_m$ be a partition of $[n]=1,dots,n$. For $Xsubseteq[n]$, its $mathcalA$-boundary region $mathcalA(X)$ is defined to be the union of those blocks $A_i$ of $mathcalA$ for which $A_{i}capXeqemptyset$ and $A_{i}cap([n]setminusX)eqemptyset$. For three different probability distributions on the power set of $[n]$, partitions $mathcalA$ of $[n]$ are determined such that the expected cardinality of the $mathcalA$-boundary region of a randomly chosen subset of $[n]$ is minimal and maximal, respectively. The problem can be reduced to an optimization problem for integer partitions of $n$. In the most difficult case, the concave-convex shape of the corresponding weight function as well as several other inequalities are proved using an integral representation of the weight function. In one case, there is an interesting analogon to the AZ-identity. The study is motivated by the rough set theory.

Full work available at URL: https://arxiv.org/abs/1709.05109

Recommendations

• scientific article; zbMATH DE number 2215651
• Optimal approximation sets of rough sets
• scientific article; zbMATH DE number 5299876
• scientific article; zbMATH DE number 2185775
• Optimal Set Partitioning

zbMATH Keywords

optimizationrough setsintegral representationset partitioninteger partitionboundary regionAZ-identityconcave-convex shape

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Rough sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An identity in combinatorial extremal theory
• Optimal integer partitions
• An AZ-style identity and Bollobás deficiency

Cited In (5)

• Qualitative analysis of basic notions in parametric rough convex programming (parameters in the objective function and feasible region is a rough set)
• Title not available (Why is that?)
• Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
• Lattice representations with set partitions induced by pairings
• Title not available (Why is that?)

This page was built for publication: Boundary optimization for rough sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724858)