The Community for Technology Leaders
RSS Icon
Issue No.10 - October (2009 vol.21)
pp: 1461-1474
Wei-Zhi Wu , Zhejiang Ocean University, Zhoushan
Yee Leung , The Chinese University of Hong Kong, Hong Kong
Ju-Sheng Mi , Hebei Normal University, Shijiazhuang
Granular computing and knowledge reduction are two basic issues in knowledge representation and data mining. Granular structure of concept lattices with application in knowledge reduction in formal concept analysis is examined in this paper. Information granules and their properties in a formal context are first discussed. Concepts of a granular consistent set and a granular reduct in the formal context are then introduced. Discernibility matrices and Boolean functions are, respectively, employed to determine granular consistent sets and calculate granular reducts in formal contexts. Methods of knowledge reduction in a consistent formal decision context are also explored. Finally, knowledge hidden in such a context is unraveled in the form of compact implication rules.
Concept lattices, data mining, formal contexts, granular computing, granules, knowledge reduction, rough sets.
Wei-Zhi Wu, Yee Leung, Ju-Sheng Mi, "Granular Computing and Knowledge Reduction in Formal Contexts", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 10, pp. 1461-1474, October 2009, doi:10.1109/TKDE.2008.223
[1] M. Barbut and B. Monjardet, Order et Classification: Algeèbre et Combinatoire. Hachette, 1970.
[2] A. Bargiela and W. Pedrycz, Granular Computing: An Introduction. Kluwer Academic Publishers, 2002.
[3] A. Bargiela and W. Pedrycz, “Toward a Theory of Granular Computing for Human-Centered Information Processing,” IEEE Trans. Fuzzy Systems, vol. 16, no. 2, pp. 320-330, Apr. 2008.
[4] R. Belohlavek, “A Note on Variable Threshold Concept Lattices: Threshold-Based Operators Are Reducible to Classical Concept-Forming Operators,” Information Sciences, vol. 177, no. 15, pp.3186-3191, 2007.
[5] M. Beynon, “Reducts within the Variable Precision Rough Sets Model: A Further Investigation,” European J. Operational Research, vol. 134, no. 3, pp. 592-605, 2001.
[6] C. Carpineto and G. Romano, “Galois: An Order Theoretic Approach to Conceptual Clustering,” Proc. Int'l Conf. Machine Learning (ICML '93), P. Utgoff, ed., pp. 33-40, 1993.
[7] C. Carpineto and G. Romano, “Exploiting the Potential of Concept Lattices for Information Retrieval with CREDO,” J. Universal Computer Science, vol. 10, no. 8, pp. 985-1013, 2004.
[8] C. Carpineto and G. Romano, “A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval,” Machine Learning, vol. 10, pp. 95-122, 1996.
[9] X.H. Chen and Y.Y. Yao, “A Multiview Approach for Intelligent Data Analysis Based on Data Operators,” Information Sciences, vol. 178, nos. 1/2, pp. 1-20, 2008.
[10] R. Cole, P. Eklund, and G. Stumme, “Document Retrieval for E-Mail Search and Discovery Using Formal Concept Analysis,” Applied Artificial Intelligence, vol. 17, no. 3, pp. 257-280, 2003.
[11] B.A. Davey and H.A. Priestley, Introduction to Lattices and Order. Cambridge Univ. Press, 2002.
[12] J.S. Deogun and J. Saquer, “Concept Approximations for Formal Concept Analysis,” Proc. Eighth Int'l Conf. Conceptual Structures —Logical, Linguistic, and Computational Issues (ICCS '00), pp. 73-83, 2000.
[13] S. Elloumi, J. Jaam, A. Hasnah, A. Jaoua, and I. Nafkha, “A Multi-Level Conceptual Data Reduction Approach Based on the Lukasiewicz Implication,” Information Sciences, vol. 163, no. 4, pp. 253-262, 2004.
[14] B. Ganter and R. Wille, Formal Concept Analysis, Mathematical Foundations. Springer, 1999.
[15] J. Grzymala-Busse and X. Zuo, “Classification Strategies Using Certain and Possible Rules,” Lecture Notes in Artificial Intelligence, vol. 1424, pp. 37-44, Springer, 1998.
[16] J. Hereth, G. Stumme, R. Wille, and U. Wille, “Conceptual Knowledge Discovery and Data Analysis,” Lecture Notes in Artificial Intelligence, vol. 1867, pp. 421-437, Springer-Verlag, 2000.
[17] T.B. Ho, “An Approach to Concept Formation Based on Formal Concept Analysis,” IEICE Trans. Information and Systems, vol. E78-D, no. 5, pp. 553-559, 1995.
[18] K. Hu, Y. Sui, Y. Lu, J. Wang, and C. Shi, “Concept Approximation in Concept Lattice,” Proc. Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '01), pp. 167-173, 2001.
[19] Rough Set Theory and Granular Computing, M. Inuiguchi, S. Hirano, and S. Tsumoto, eds. Springer, 2002.
[20] R. Jensen and Q. Shen, “Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 12, pp. 1457-1471, Dec. 2004.
[21] R.E. Kent, “Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis,” Fundamenta Informaticae, vol. 27, pp. 169-181, 1996.
[22] M. Kryszkiewicz, “Comparative Study of Alternative Types of Knowledge Reduction in Insistent Systems,” Int'l J. Intelligent Systems, vol. 16, pp. 105-120, 2001.
[23] S.O. Kuznetsov, “Machine Learning and Formal Concept Analysis,” Int'l Conf. Formal Concept Analysis (ICFCA '04), pp. 287-312, 2004.
[24] Y. Leung, M.M. Fischer, W.-Z. Wu, and J.-S. Mi, “A Rough Set Approach for the Discovery of Classification Rules in Interval-Valued Information Systems,” Int'l J. Approximate Reasoning, vol. 47, no. 2, pp. 233-246, 2008.
[25] Y. Leung and D. Li, “Maximal Consistent Block Technique for Rule Acquisition in Incomplete Information Systems,” Information Sciences, vol. 153, pp. 85-106, 2003.
[26] Y. Leung, W.-Z. Wu, and W.-X. Zhang, “Knowledge Acquisition in Incomplete Information Systems: A Rough Set Approach,” European J. Operational Research, vol. 168, no. 1, pp. 164-180, 2006.
[27] Y. Li, S.C.K. Shiu, and S.K. Pal, “Combining Feature Reduction and Case Selection in Building CBR Classifiers,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 3, pp. 415-429, Mar. 2006.
[28] T.Y. Lin, Y.Y. Yao, and L.A. Zadeh, Data Mining, Rough Sets and Granular Computing. Physica-Verlag, 2002.
[29] M. Liu, M.W. Shao, W.X. Zhang, and C. Wu, “Reduction Method for Concept Lattices Based on Rough Set Theory and Its Application,” Computers and Math. with Applications, vol. 53, no. 9, pp. 1390-1410, 2007.
[30] J.-M. Ma, W.-X. Zhang, Y. Leung, and X.-X. Song, “Granular Computing and Dual Galois Connection,” Information Sciences, vol. 177, no. 23, pp. 5365-5377, 2007.
[31] P. Maji and S.K. Pal, “Rough-Fuzzy C-Medoids Algorithm and Selection of Bio-Basis for Amino Acid Sequence Analysis,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 6, pp. 859-872, June 2007.
[32] E. Marczewski, “A General Scheme of Independence in Mathematics,” Bulletin de l'Academie Polonaise des Sciences. Serie des Sciences Mathematiques, Astronomiques, et Physiques, vol. 6, pp. 731-736, 1958.
[33] J.-S. Mi, W.-Z. Wu, and W.-X. Zhang, “Approaches to Knowledge Reductions Based on Variable Precision Rough Sets Model,” Information Sciences, vol. 159, nos. 3/4, pp. 255-272, 2004.
[34] P.H.P. Nguyen and D. Corbett, “A Basic Mathematical Framework for Conceptual Graphs,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 2, pp. 261-271, Feb. 2006.
[35] G.D. Oosthuizen, “Rough Sets and Concept Lattices,” Proc. Int'l Workshop Rough Sets and Knowledge Discovery (RSKD '93), W.Ziarko, ed., pp. 24-31, 1994.
[36] P. Pagliani, “From Concept Lattices to Approximation Spaces: Algebraic Structures of Some Spaces of Partial Objects,” Fundamenta Informaticae, vol. 18, pp. 1-25, 1993.
[37] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Efficient Mining of Association Rules Using Closed Itemset Lattices,” Information Systems, vol. 24, no. 1, pp. 25-46, 1999.
[38] Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, 1991.
[39] W. Pedrycz ed. Granular Computing: An Emerging Paradigm, Physica-Verlag, 2001.
[40] M.-W. Shao, M. Liu, and W.-X. Zhang, “Set Approximations in Fuzzy Formal Concept Analysis” Fuzzy Sets and Systems, vol. 158, no. 23, pp. 2627-2640, 2007.
[41] A. Skowron, “Boolean Reasoning for Implication Rules Generation,” Methodologies for Intelligent Systems, pp. 295-305, Springer-Verlag, 1993.
[42] A. Skowron and C. Rauszer, “The Discernibility Matrices and Functions in Information Systems,” Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp.331-362, Kluwer Academic Publishers, 1992.
[43] A. Skowron and J. Stepaniuk, “Information Granules: Towards Foundations of Granular Computing,” Int'l J. Intelligent Systems, vol. 16, pp. 57-85, 2001.
[44] G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal, “Computing Iceberg Concept Lattices with TITANIC,” Data and Knowledge Eng., vol. 42, no. 2, pp. 189-222, 2002.
[45] G. Stumme, R. Wille, and U. Wille, “Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods,” Lecture Notes in Artificial Intelligence, vol. 1510, pp. 450-458, Springer-Verlag, 1998.
[46] P. Valtchev, R. Missaoui, and R. Godin, “Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenge,” Proc. Int'l Conf. Formal Concept Analysis (ICFCA '04), pp. 352-371, 2004.
[47] F.J. Venter, G.D. Oosthuizen, and J.D. Roos, “Knowledge Discovery in Databases Using Lattices,” Expert Systems with Applications, vol. 13, no. 4, pp. 259-264, 1997.
[48] L. Wei, J.-J. Qi, and W.-X. Zhang, “Attribute Reduction Theory of Concept Lattice Based on Decision Formal Contexts,” Science in China: Series F—Information Sciences, vol. 51, no. 7, pp. 910-923, 2008.
[49] R. Wille, “Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts,” Ordered Sets, I. Rival, ed., pp. 445-470, Reidel, 1982.
[50] R. Wille, “Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies,” Formal Concept Analysis, B.Ganter et al., eds., pp. 1-33, Springer-Verlag, 2005.
[51] R. Wille, “Concept Lattices and Conceptual Knowledge Systems,” Computers and Math. with Applications, vol. 23, nos. 6-9, pp. 493-515, 1992.
[52] K.E. Wolff, “A Conceptual View of Knowledge Bases in Rough Set Theory,” Proc. Int'l Conf. Rough Sets and Current Trends in Computing (RSCTC '00), pp. 220-228, 2001.
[53] W.-Z. Wu, M. Zhang, H.-Z. Li, and J.-S. Mi, “Knowledge Reduction in Random Information Systems via Dempster-Shafer Theory of Evidence,” Information Sciences, vol. 174, nos. 3/4, pp.143-164, 2005.
[54] W.-Z. Wu, “Attribute Reduction Based on Evidence Theory in Incomplete Decision Systems,” Information Sciences, vol. 178, no. 5, pp. 1355-1371, 2008.
[55] Y.Y. Yao, “A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis,” Proc. Fourth Int'l. Conf. Rough Sets and Current Trends in Computing (RSCTC '04), pp. 59-68, 2004.
[56] Y.Y. Yao, “Information Granulation and Rough Set Approximation,” Int'l J. Intelligent Systems, vol. 16, pp. 87-104, 2001.
[57] Y.Y. Yao, “A Partition Model of Granular Computing,” Trans. Rough Sets, vol. I, pp. 232-253, 2004.
[58] Y.Y. Yao, C.-J. Liau, and N. Zhong, “Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions,” Proc. 14th Int'l Symp. Methodologies for Intelligent Systems (ISMIS '03), pp. 152-159, 2003.
[59] L.A. Zadeh, “Fuzzy Sets and Information Granularity,” Advances in Fuzzy Set Theory and Applications, N. Gupta, R. Ragade, and R.Yager, eds., pp. 3-18, North-Holland, 1979.
[60] L.A. Zadeh, “Fuzzy Logic = Computing with Words,” IEEE Trans. Fuzzy Systems, vol. 4, no. 2, pp. 103-111, May 1996.
[61] L.A. Zadeh, “Towards a Theory of Fuzzy Information Granulation and Its Centrality in Human Reasoning and Fuzzy Logic,” Fuzzy Sets and Systems, vol. 90, pp. 111-127, 1997.
[62] W.-X. Zhang, Y. Leung, and W.-Z. Wu, Information Systems and Knowledge Discovery (in Chinese). Science Press, 2003.
[63] W.-X. Zhang, J.-M. Ma, and S.-Q. Fan, “Variable Threshold Concept Lattices,” Information Sciences, vol. 177, no. 22, pp. 4883-4892, 2007.
[64] W.-X. Zhang, J.-S. Mi, and W.-Z. Wu, “Approaches to Knowledge Reductions in Inconsistent Systems,” Int'l J. Intelligent Systems, vol. 21, no. 9, pp. 989-1000, 2003.
[65] W.-X. Zhang, L. Wei, and J.-J. Qi, “Attribute Reduction Theory and Approach to Concept Lattice,” Science in China: Series F —Information Sciences, vol. 48, no. 6, pp. 713-726, 2005.
[66] Y.-Q. Zhang, “Constructive Granular Systems with Universal Approximation and Fast Knowledge Discovery,” IEEE Trans. Fuzzy Systems, vol. 13, no. 1, pp. 48-57, Feb. 2005.
[67] W. Zhu and F.-Y. Wang, “On Three Types of Covering-Based Rough Sets,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 8, pp. 1131-1144, Aug. 2007.
[68] W. Zhu and F.-Y. Wang, “Reduction and Axiomization of Covering Generalized Rough Sets,” Information Sciences, vol. 152, pp. 217-230, 2003.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool