arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.5567cs.AI
收藏

基于通过拟阵的序列传递关系的正则集闭集格

Closed-set lattice of regular sets based on a serial and transitive relation through matroids

Minnan Normal University(闽南师范大学)

Qingyin Li, William Zhu

摘要:

粗糙集是数据采掘中数据预处理的有效方法。拟阵以线性代数和图论为基础,在许多领域有着广泛的应用。粗糙集和拟阵都与格密切相关。对于论域上的序列传递关系,广义粗糙集的所有正则集的集合是一个格。本文利用拟阵格构造拟阵,并研究拟阵格与拟阵闭集格之间的关系。首先,证明了基于序列传递关系的正则集的集合是半模格。然后,通过半模格的高度函数构造拟阵。最后,我们提出了一种从半模格中求出拟阵所有闭集的方法。借用拟阵,结果表明,格理论提供了一个有趣的角度来研究粗糙集。

英文摘要:

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a serial and transitive relation on a universe, the collection of all the regular sets of the generalized rough set is a lattice. In this paper, we use the lattice to construct a matroid and then study relationships between the lattice and the closed-set lattice of the matroid. First, the collection of all the regular sets based on a serial and transitive relation is proved to be a semimodular lattice. Then, a matroid is constructed through the height function of the semimodular lattice. Finally, we propose an approach to obtain all the closed sets of the matroid from the semimodular lattice. Borrowing from matroids, results show that lattice theory provides an interesting view to investigate rough sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑