Concept Lattice: A rough set approach
Downloads
DOI:
https://doi.org/10.26637/mjm301/002Abstract
Concept lattice is an efficient tool for knowledge representation and knowledge discovery and is applied to many fields successfully. However, in many real life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts. The hierarchical structure of formal concept (called concept lattice) represents a structural information which obtained automatically from the input data table. We deal with the problem in which how further additional information be supplied to utilize the basic object attribute data table. In this paper , we provide rough concept lattice to incorporate the rough set into the concept lattice by using equivalence relation. Some results are established to illustrate the paper.
Keywords:
Rough Set, Formal Concept lattice, Equivalence Relation, LatticeMathematics Subject Classification:
06A15, 06B23, 06D10- Pages: 14-22
- Date Published: 01-01-2015
- Vol. 3 No. 01 (2015): Malaya Journal of Matematik (MJM)
Duntech,I. Gediga, G, Approximation operators in qualitative data analysis, in: H. Swart, E. Orlowska, G. Schmidt, M. Roubens (Eds.). Theory and Application of Relational Structures as Knowledge Instruments, Springer. Heidelloerg, 27(2003), 169-181.
Gediga, G., Duntsch, 1, Modal-style operators in qualitative data analysis, in: Proceedings of the 2002 IEEE International Conference on Data Mining, (2002), 155-162.
Hu, K., Sui, Y., Lu, Y., Wang,J., Shi, C, Concept approximation in concept lattice, knowled ge discovery and data mining, in: Proceedings of the 5th Pacific-Asia Conference, PAKDD 2001, in:, Lecture Notes in Computer Science, Vol. 2035(2001), 167-173.
Kent, R. E, Rough concept analysis, Fundhmerta Informaticme, 1996, 216-233.
Nakamura, A, A Rough Logic Based on Incomplete Information and its Application, Int. ]. Approximate Reasoving, 15(1996), 367-378. DOI: https://doi.org/10.1016/S0888-613X(96)00075-8
Oosthuizen, G. D. The Application of concept lattice to Machine Learning, Techical Report, Lhizersity of Pretaria, South, Africa, (1996).
Oosthwizen, G. D, Rough set and concept lattices, in Rough Sets, and Fuzxy Sets and knowledge Discovery(RSKD'93)(ed. Ziarko, w.p.), Landar : Springer Verlig, (1994), 24-31. DOI: https://doi.org/10.1007/978-1-4471-3238-7_4
Pagliani, P. From concept lattices to approximation spaces: Algebraic structures of some spaces of partial objocts, Fundanenta Jnformaticae, 18(1993), 1-18. DOI: https://doi.org/10.3233/FI-1993-18102
Pomykala, J. Pomykala, J. A. The Stone Algebra of Rough Sets, Bull. Polish. Amd. Sci. (Math), 36(1988). 495-50s.
Pomykala, J. Pomykala, J. A. The Stone Algebra of Rough Sets, Bull. Polich. Acad. Sci. Matil, 36(1988), $495-508$.
Rana, D., Roy, S. K, Lattice for Rough Intervals, Jourual of New Results in Science, 2 (2013), 39-46.
Rana, D, Roy, S. K, Rough Set Approach on Lattice, Journal of Uncertain Systems, 5(1)(2011), 72-80.
Roy, S. K., Bera, S, Rough Modular lattice, Journal of Uncerfain Sysfens, 7(4), (2013), $289-293$.
Rana, D., Roy, S. K, Lattice for Covering Rough Approximations, Mafint foumal of Matematik, 2(3)2014). $222-227$ DOI: https://doi.org/10.26637/mjm203/006
Raney, G. N.: Completely distributive complete lattices, Procedings of American Society, 3(1952), 677-680. DOI: https://doi.org/10.1090/S0002-9939-1952-0052392-3
Roy, S. K., Bera, S, Distributive lattice: a Rough Set Approach, Malirya journal of Matemnutik, 2(3), (2014), $273-276$. DOI: https://doi.org/10.26637/mjm203/013
Saquer, J, Deogun, J. S, Formal rough concept analysis, in: New directions in Rough Sets, Data Mining, and Granular-Soft, in: Lecture Notes in Computer Science, Springer, Berlin, 1711(1999), 91-99, DOI: https://doi.org/10.1007/978-3-540-48061-7_13
Saquer, 1., Deogur. J. Concept approximations for formal concept analysis. Proc. Sth Int. Conf. Conceptual Structures (ICCS 2000), Vol. Il, Working with conceptral Struchures, Dermstadf, Germany, (2000), 73-83.
Shao, M. W. Zhang, W. X, The Set Approximation in Formal Contexts, in: Lecture Notes in Computer science, Springer, Berlin, 3641(2005), 43-53. DOI: https://doi.org/10.1007/11548669_5
Vakarelov, D, A Modal Logic for Similarity Relations in Pawlak Knowledge Representation Systems. Fundamesta lnformaticae, 15(1991), 61-79. DOI: https://doi.org/10.3233/FI-1991-15105
Vakarelov, D, Modal Logic for Knowledge Representation Systems, LNCS 363(1989), 257-277; Theonetical Computer Science, $90(1991), 433-456$
Ward, M, The closure operators of a lattice, Antuls of Mathemutics, Second Series, 43(1942), 191-196. DOI: https://doi.org/10.2307/1968865
Wille, R, Restructring Lattice Theory: an approach based on hierarchies of concepts, in Order Sets(ed. Rival, 1.), Dordrecht. Boston: Reidd (1982), 445-470. DOI: https://doi.org/10.1007/978-94-009-7798-3_15
Wolff, K. E, A conceptual view of knowledge bases in rough set theory, in: Rough Sets and Current Trends in Computing (Second International Conference RSCTC 2000), in: Lecture Notes in Computer Science, Springer, Berlin, 2001, 220-228. DOI: https://doi.org/10.1007/3-540-45554-X_26
Wu, Q. Liu, Z, Real Formal Concept Analysis Based on Grey-Rough Set Theory, Knowledge-Based Systems,22(1)(2009), 3g-45. DOI: https://doi.org/10.1016/j.knosys.2008.06.001
Yao, $Y$. Y, Concept lattices in rough set theory, in: Proceedings of 23rd International Meeting of the North American, Fuzzy Information Processing Society, 2004 DOI: https://doi.org/10.1109/NAFIPS.2004.1337404
Ywo, Y, Y, A comparative study of formal concept analysis and rough set theory in data analysis, rough sets and current trends in computing, in: Proceedings of 3rd International Conference, RSCTM, 2004.
- NA
Similar Articles
- A. Anguraj, J. Palraj, Comparison of four different obstacle models of fluid flow with a slip-like boundary condition , Malaya Journal of Matematik: Vol. 2 No. 04 (2014): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.