Attribute Reduction of Concept Lattices Based on Matroidal Approach
Keywords:
attribute reduction, matroid, bipartite graph, concept latticeAbstract
For a context, a matroid is induced by an equivalentrelation which is produced from the above bipartite graph. Each
member in one of Zhang's three attribute classes is characterized
through the above matroid. After that, this paper searches out the
composition of a reduct set. All these results show the potential
and merit in using matroidal approaches for designing and studying
concept lattice.
References
R.Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, in:
I.Rival (Eds.), Ordered Sets, Dordrecht Boston, Reidel, 1982, pp.445-470.
C.Carpineto, G.Romano, Concept Data Analysis: Theory and Applications, John Wiley
& Sons Ltd., England, 2004.
B.Ganter, R.Wille, Formal Concept Analysis: Mathematical Foundations, SpringerVerlag
Berlin, Heidelberg, 1999. (German vesion: Springer, Heidelberg, 1996)
B.Ganter, G.Stumme, R.Wille, Formal Concept Analysis: Foundations and Applications,
Springer-Verlag Berlin, Heidelberg, 2005.
J.Mi, Y.Leung, W.Wu, Approaches to attribute reduction in concept lattices induced
by axialities, Knowl.-Based Syst., 23(2010)504-511.
V.Snasel, M.Polovincak, H.M.Dahwa, Concept lattice reduction by singular value decomposition,
Proceedings of the Spring Young Researcher’s Colloquium on Database
and Information Systems, Moscow, 2007.
X.Wang, Approaches to attribute reduction in concept lattices based on rough set theory,
Intern. J. of Hybrid Inf. Technol., 5(2)(2012)67-79.
W.X.Zhang, L.Wei, J.Qi, Attribute reduction theory and approach to concept lattice,
Sci. in China, series F: Inf. Sci., 48(6)(2005)713-726.
H.Whitney, On the abstract properties of linear dependence, Am. J. of Math.,
(3)(1935)509-533.
H.Mao, The relation between matroid and concept lattice, Adv. in Math.(China),
(3)(2006)361-365.(in Chinese with English summary)
H.Mao, On closure axioms for a matroid using Galois connections, Math. Commun.,
(2)(2009)425-432.
H.Mao, On lattice-theoretical construction of matroids, Annu. of the Alexandru Ioan
Cuza Univ.-Math., 59(1)(2013)201-208.
H.Mao, Characterization and reduction of concept lattices through matroid theory, Inf.
Sci., 281(10)(2014) 338-354.
J.Tang, K.She, W.Zhu, Matroidal structure of rough sets from the viewpoint of graph
theory, J. of Appl. Math., vol.2012, Article ID 973920, 27 pages.
S.Wang, Q.Zhu, W.Zhu, F.Min, Matroidal structure of rough sets and its characterization
to attribute reduction, Knowl.-Based Syst., 36(2012)155-161.
Abello J, Pogel A J, Miller L. Breadth first search graph partitions and concept lattices.
J. of Univer. Comput. Sci., 10(8)(2004)934-954.
G.Gr¨atzer, Lattice Theory: Foundation, Birkh¨auser, Basel, 2011.
D.J.A.Welsh, Matroid Theory, Academic Press, London, 1976.
J.A.Bondy, U.S.R.Murty, Graph Theory with Applications, Elsevier Science Publishing
Co. Inc., New York, 1976.
Downloads
Published
Issue
Section
License
Copyright © The Author(s). This article is published under the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
