Attribute reductions in object-oriented concept lattices

详细信息    查看全文

• 作者：Jian-Min Ma (1)
  Yee Leung (2)
  Wen-Xiu Zhang (3)
  
• 关键词：Attribute rank ; Object ; oriented concept lattice ; Object ; oriented consistent set ; Object ; oriented reduction ; Object ; oriented discernibility matrix
• 刊名：International Journal of Machine Learning and Cybernetics
• 出版年：2014
• 出版时间：October 2014
• 年：2014
• 卷：5
• 期：5
• 页码：789-813
• 全文大小：598 KB
• 参考文献：1. Carpineto C, Romano G (2004) Exploiting the potential of concept lattices for information retrieval with CREDO. J Univers Comput Sci 10(8):985鈥?013
  2. Cole R, Eklund P, Stumme G (2003) Document retrieval for e-mail search and discovery using formal concept analysis. Appl Artif Intell 17(3):257鈥?80 CrossRef
  3. Elloumi S, Jaam J, Hasnah A, Jaoua A, Nafkha I (2004) A multi-level conceptual data reduction approach based on the Lukasiewicz implication. Inf Sci 163(4):253鈥?62 CrossRef
  4. Ganter B, Wille R (1999) Formal concept analysis. Mathematical Foundations. Springer, Berlin
  5. Gediga G, Duentsch I (2002) Modal-style operators in qualitative data analysis. In: Proceedings of the 2002 IEEE international conference on data mining, pp 155鈥?62
  6. Hereth J, Stumme G, Wille R, Wille U (2000) Conceptual knowledge discovery and data analysis. Lecture Notes in Artificial Intelligence 1867. Springer, Berlin, pp 421鈥?37
  7. Hu K, Sui Y, Lu Y, Wang J, Shi C (2001) Concept approximation in concept lattice. In: Cheung D, Williams GJ, Q Li (eds) Knowledge discovery and data mining, proceedings of the 5th Pacific- Asia conference, PAKDD 2001. Lecture Notes in Computer Science 2035. Springer, London, pp 167鈥?73
  8. Kang XP, Li DY, Wang SG, Qu KS (2013) Rough set model based on formal concept analysis. Inf Sci 222(10):611鈥?25 CrossRef
  9. Kent RE (1996) Rough concept analysis: a synthesis of rough sets and formal concept analysis. Fundam Inf 27:169鈥?81
  10. Kim M, Compton P (2004) Evolutionary document management and retrieval for specialized domains on the web. Int J Hum Comput Stud 60(2):201鈥?41 CrossRef
  11. Kryszkiewicz M (2001) Comparative study of alternative types of knowledge reduction in insistent systems. Int J Intell Syst 16:105鈥?20 CrossRef
  12. Kuznetsov SO (2004) Machine learning and formal concept analysis. In: Eklund P (ed) ICFCA 2004. Lecture Notes in artificial intelligence 2961. Springer, Berlin, pp 287鈥?12
  13. Leung Y, Wu WZ, Zhang WX (2006) Knowledge acquisition in incomplete information systems: a rough set approach. Eur J Oper Res 168(1):164鈥?80 CrossRef
  14. Li JH, Mei CL, Cherukuri AK, Zhang X (2013) On rule acquisition in decision formal contexts. Int J Mach Learn Cybern 4(6):721鈥?31 CrossRef
  15. Li JH, Mei CL, Lv YJ (2013) Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction. Int J Approx Reason 54(2): 149鈥?65 CrossRef
  16. Li LF, Zhang JK (2010) Attribute reduction in fuzzy concept lattices based on the T implication. Knowl Based Syst 23:497鈥?03 CrossRef
  17. Ma JM, Zhang WX, Wang X (2006) Dependence space of concept lattices based on rough set. In: 2006 IEEE international conference on granular computing, pp 20鈥?04
  18. Maji P, Paul S (2012) Rough-fuzzy clustering for grouping functionally similar genes from microarray data. In: IEEE/ACM transactions on computational biology and bioinformatics, pp 1鈥?4
  19. Maji P, Paul S (2011) Rough set based maximum relevance-maximum significance criterion and gene selection from microarray data. Int J Approx Reason 52(3):408鈥?26 CrossRef
  20. Maji P, Paul S (2010) Rough sets for selection of molecular descriptors to predict biological activity of molecules. IEEE Trans Syst Man Cybern Part C Appl Rev 40(6):639鈥?48 CrossRef
  21. Maji P, Pal SK (2010) Feature selection using f-information measures in fuzzy approximation spaces. IEEE Trans Knowl Data Eng 22(6):854鈥?67 CrossRef
  22. Maji P, Pal SK (2007) Rough set based generalized fuzzy C-means algorithm and quantitative indices. IEEE Trans Syst Man Cybern Part B Cybern 37(6):1529鈥?540 CrossRef
  23. Maji P., Pal SK (2007) Rough-fuzzy C-medoids algorithm and selection of bio-basis for amino acid sequence analysis. IEEE Trans Knowl Data Eng 19(6):859鈥?72 CrossRef
  24. Mi JS, Wu WZ, Zhang WX (2004) Approaches to knowledge reductions based on variable precision rough sets model. Inf Sci 159(3-4):255鈥?72 CrossRef
  25. Mi JS, Leung Y, Wu WZ (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl Based Syst 23:504鈥?11 CrossRef
  26. Pagliani P (1993) From concept lattices to approximation spaces: algebraic structures of some spaces of partial objects. Fundam Inf 18:1鈥?5
  27. Paul S, Maji P (2012) Gene ontology based quantitative index to select functionally diverse genes. Int J Mach Learn Cybern 1鈥?7
  28. Pawlak Z (1982) Rough sets. Int J Comput Inf Sc 11:341鈥?56 CrossRef
  29. Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Ecient mining of association rules using closed itemset lattices. Inf Syst 24(1):25鈥?6 CrossRef
  30. Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. In: Slowinski R (ed) Intelligent decision support: handbook of applications and advances of the rough sets theory. Kluwer, Boston, pp 331鈥?62
  31. Stumme G, Taouil R, Bastide Y, Pasquier N, Lakhal L (2002) Computing iceberg concept lattices with TITANIC. Data Knowl Eng 42(2):189鈥?22 CrossRef
  32. Taylor PJ, Catalano ., Walker DRF (2002) Measurement of the world City network. Urban Stud 39(13):2367鈥?376 CrossRef
  33. Valtchev P, Missaoui R, Godin R (2004) Formal concept analysis for knowledge discovery and data mining: the new challenges. In: Eklund P (ed) ICFCA 2004. Lecture Notes in artificial intelligence 2961. Springer, Berlin, pp 352鈥?71
  34. Wei L, Qi JJ, Zhang WX (2008) Attribute reduction theory of concept lattice based on decision formal contexts, science in China. Ser F C Inf Sci 51(7):910C923
  35. Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel, Dordrecht, pp 445鈥?70
  36. Wolff KE (2001) A conceptual view of knowledge bases in rough set theory. In: Ziarko W, Yao YY (eds) Rough sets and current trends in computing 2000. Lecture Notes in computer science 2005. Springer, Berlin, pp 220鈥?28
  37. Wu WZ, Zhang M, Li HZ, Mi JS (2005) Knowledge reduction in random information systems via Dempster-Shafer theory of evidence. Inf Sci 174(3-4):143鈥?64 CrossRef
  38. Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEEE Trans Knowl Data Eng 21(10):461鈥?474
  39. Yao YY (2004) Concept lattices in rough set theory. In: Dick S, Kurgan L, Pedrycz W, Reformat M (eds) Proceedings of 2004 annual meeting of the North American fuzzy information processing society (NAFIPS 2004),pp 796鈥?01
  40. Yao YY (2004) A Comparative study of formal concept analysis and rough set theory in data analysis. In: Tsumoto S, Slowinski R, Jan Komorowski H, Grzymala-Busse JW (eds) Rough sets and current trends in computing 2004, LNAI 3066, Springer, Berlin, pp 59鈥?8
  41. Yao YY, Chen YH (2004) Rough set approximations in formal concept analysis. In: Dick S, Kurgan L, Pedrycz W, Reformat M (eds) Proceedings of 2004 annual meeting of the North American fuzzy information processing society (NAFIPS 2004), June 27鈥?0, pp 73鈥?8
  42. Zhang WX, Wei L, Qi JJ (2005) Attribute reduction theory and approach to concept analysis. Sci China Ser F Inf Sci 48(6):713鈥?26 CrossRef
  
• 作者单位：Jian-Min Ma (1)
  Yee Leung (2)
  Wen-Xiu Zhang (3)
  
  1. Department of Mathematics and Information Science, Faculty of Science, Chang鈥檃n University, Xi鈥檃n, Shaan鈥檟i, 710064, People鈥檚 Republic of China
  2. Department of Geography and Resource Management, Center for Environmental Policy and Resource Management and Insititute of Space and Earth Information Science, The Chinese University of Hong Kong, Hong Kong, Hong Kong
  3. Faculty of Science, Institute for Information and System Sciences, Xi鈥檃n Jiaotong University, Xi鈥檃n, Shaan鈥檟i, 710049, People鈥檚 Republic of China
  
• ISSN：1868-808X

文摘

Attribute reduction is one of the main issues in the study of concept lattice. This paper mainly deals with attribute reductions of an object-oriented concept lattice constructed on the basis of rough set. Attribute rank of object-oriented concept lattice is first defined, and relationships between attribute rank and object-oriented concepts are then discussed. Based on attribute rank, generating algorithm of object-oriented concepts is investigated. The object-oriented consistent set and object-oriented reduction of an object-oriented concept lattice are defined. Adjustment theorems of the object-oriented consistent set, and the necessary and sufficient conditions for a attribute subset to be an object-oriented consistent set of an object-oriented concept lattice are discussed. Then the object-oriented discernibility matrix of an object-oriented concept lattice is defined and its properties are also studied. Based on the object-oriented discernibility matrix, an approach to object-oriented reductions of an object-oriented concept lattice is proposed, and the attribute characteristics are also analyzed.