Eintrag weiter verarbeiten
Covering-Based Rough Sets on Eulerian Matroids
Gespeichert in:
Zeitschriftentitel: | Journal of Applied Mathematics |
---|---|
Personen und Körperschaften: | , , |
In: | Journal of Applied Mathematics, 2013, 2013, S. 1-8 |
Format: | E-Article |
Sprache: | Englisch |
veröffentlicht: |
Hindawi Limited
|
Schlagwörter: |
author_facet |
Yang, Bin Lin, Ziqiong Zhu, William Yang, Bin Lin, Ziqiong Zhu, William |
---|---|
author |
Yang, Bin Lin, Ziqiong Zhu, William |
spellingShingle |
Yang, Bin Lin, Ziqiong Zhu, William Journal of Applied Mathematics Covering-Based Rough Sets on Eulerian Matroids Applied Mathematics |
author_sort |
yang, bin |
spelling |
Yang, Bin Lin, Ziqiong Zhu, William 1110-757X 1687-0042 Hindawi Limited Applied Mathematics http://dx.doi.org/10.1155/2013/254797 <jats:p>Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.</jats:p> Covering-Based Rough Sets on Eulerian Matroids Journal of Applied Mathematics |
doi_str_mv |
10.1155/2013/254797 |
facet_avail |
Online Free |
finc_class_facet |
Mathematik |
format |
ElectronicArticle |
fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzI1NDc5Nw |
id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzI1NDc5Nw |
institution |
DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 |
imprint |
Hindawi Limited, 2013 |
imprint_str_mv |
Hindawi Limited, 2013 |
issn |
1110-757X 1687-0042 |
issn_str_mv |
1110-757X 1687-0042 |
language |
English |
mega_collection |
Hindawi Limited (CrossRef) |
match_str |
yang2013coveringbasedroughsetsoneulerianmatroids |
publishDateSort |
2013 |
publisher |
Hindawi Limited |
recordtype |
ai |
record_format |
ai |
series |
Journal of Applied Mathematics |
source_id |
49 |
title |
Covering-Based Rough Sets on Eulerian Matroids |
title_unstemmed |
Covering-Based Rough Sets on Eulerian Matroids |
title_full |
Covering-Based Rough Sets on Eulerian Matroids |
title_fullStr |
Covering-Based Rough Sets on Eulerian Matroids |
title_full_unstemmed |
Covering-Based Rough Sets on Eulerian Matroids |
title_short |
Covering-Based Rough Sets on Eulerian Matroids |
title_sort |
covering-based rough sets on eulerian matroids |
topic |
Applied Mathematics |
url |
http://dx.doi.org/10.1155/2013/254797 |
publishDate |
2013 |
physical |
1-8 |
description |
<jats:p>Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.</jats:p> |
container_start_page |
1 |
container_title |
Journal of Applied Mathematics |
container_volume |
2013 |
format_de105 |
Article, E-Article |
format_de14 |
Article, E-Article |
format_de15 |
Article, E-Article |
format_de520 |
Article, E-Article |
format_de540 |
Article, E-Article |
format_dech1 |
Article, E-Article |
format_ded117 |
Article, E-Article |
format_degla1 |
E-Article |
format_del152 |
Buch |
format_del189 |
Article, E-Article |
format_dezi4 |
Article |
format_dezwi2 |
Article, E-Article |
format_finc |
Article, E-Article |
format_nrw |
Article, E-Article |
_version_ |
1792341499659157506 |
geogr_code |
not assigned |
last_indexed |
2024-03-01T16:20:12.38Z |
geogr_code_person |
not assigned |
openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Covering-Based+Rough+Sets+on+Eulerian+Matroids&rft.date=2013-01-01&genre=article&issn=1687-0042&volume=2013&spage=1&epage=8&pages=1-8&jtitle=Journal+of+Applied+Mathematics&atitle=Covering-Based+Rough+Sets+on+Eulerian+Matroids&aulast=Zhu&aufirst=William&rft_id=info%3Adoi%2F10.1155%2F2013%2F254797&rft.language%5B0%5D=eng |
SOLR | |
_version_ | 1792341499659157506 |
author | Yang, Bin, Lin, Ziqiong, Zhu, William |
author_facet | Yang, Bin, Lin, Ziqiong, Zhu, William, Yang, Bin, Lin, Ziqiong, Zhu, William |
author_sort | yang, bin |
container_start_page | 1 |
container_title | Journal of Applied Mathematics |
container_volume | 2013 |
description | <jats:p>Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.</jats:p> |
doi_str_mv | 10.1155/2013/254797 |
facet_avail | Online, Free |
finc_class_facet | Mathematik |
format | ElectronicArticle |
format_de105 | Article, E-Article |
format_de14 | Article, E-Article |
format_de15 | Article, E-Article |
format_de520 | Article, E-Article |
format_de540 | Article, E-Article |
format_dech1 | Article, E-Article |
format_ded117 | Article, E-Article |
format_degla1 | E-Article |
format_del152 | Buch |
format_del189 | Article, E-Article |
format_dezi4 | Article |
format_dezwi2 | Article, E-Article |
format_finc | Article, E-Article |
format_nrw | Article, E-Article |
geogr_code | not assigned |
geogr_code_person | not assigned |
id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzI1NDc5Nw |
imprint | Hindawi Limited, 2013 |
imprint_str_mv | Hindawi Limited, 2013 |
institution | DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1 |
issn | 1110-757X, 1687-0042 |
issn_str_mv | 1110-757X, 1687-0042 |
language | English |
last_indexed | 2024-03-01T16:20:12.38Z |
match_str | yang2013coveringbasedroughsetsoneulerianmatroids |
mega_collection | Hindawi Limited (CrossRef) |
physical | 1-8 |
publishDate | 2013 |
publishDateSort | 2013 |
publisher | Hindawi Limited |
record_format | ai |
recordtype | ai |
series | Journal of Applied Mathematics |
source_id | 49 |
spelling | Yang, Bin Lin, Ziqiong Zhu, William 1110-757X 1687-0042 Hindawi Limited Applied Mathematics http://dx.doi.org/10.1155/2013/254797 <jats:p>Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.</jats:p> Covering-Based Rough Sets on Eulerian Matroids Journal of Applied Mathematics |
spellingShingle | Yang, Bin, Lin, Ziqiong, Zhu, William, Journal of Applied Mathematics, Covering-Based Rough Sets on Eulerian Matroids, Applied Mathematics |
title | Covering-Based Rough Sets on Eulerian Matroids |
title_full | Covering-Based Rough Sets on Eulerian Matroids |
title_fullStr | Covering-Based Rough Sets on Eulerian Matroids |
title_full_unstemmed | Covering-Based Rough Sets on Eulerian Matroids |
title_short | Covering-Based Rough Sets on Eulerian Matroids |
title_sort | covering-based rough sets on eulerian matroids |
title_unstemmed | Covering-Based Rough Sets on Eulerian Matroids |
topic | Applied Mathematics |
url | http://dx.doi.org/10.1155/2013/254797 |