Attribute reduction based on maximal rules in decision formal context

References

• R. Agrawal, T. Imielinski and A. Swami, “Mining association rules between sets of items in large databases,” Proceedings of the ACM SIGMOD Conference on Management of data, Washington, DC, USA: ACM Press, 207–216 (1993). doi:10.1145/170035.170072
   Google Scholar
• P. Y. Bastide, R. Taouil and L. Lakhal, “Discovering frequent closed item sets for association rules,” Proceedings of 7th International Conference Database Theory (ICDT99), Jerusalem, Israel: Springer–Verlag, 398–416 (1999). doi:10.1007/3-540-49257-7_25
   Google Scholar
• R. Belohlavek, B. D. Baets, J. Outrata and V. Vychodil, “Inducing decision trees via concept lattices,” International Journal of General Systems, 38, 1563–5104 (2009). doi: 10.1080/03081070902857563
   Web of Science ®Google Scholar
• A. Berry and A. Sigayret, “Representing a concept lattice by a graph,” Discrete Applied Mathematics, 144, 27–42 (2004). doi:10.1016/j.dam.2004.02.016
   Web of Science ®Google Scholar
• C. Carpineto and G. Romano, “A lattice conceptual clustering system and its application to browsing retrieval,” Maching Learning, 10, 95–122 (1996). doi: 10.1007/BF00058654
   Google Scholar
• R. Cole, P. Eklund and G. Stumme, “Document retrieval for e–mail search and discovery using formal concept analysis,” Applied Artificial Intelligence, 17, 257–280 (2003). doi:10.1080/713827120
   Web of Science ®Google Scholar
• B. Ganter and R. Wille, “Formal concept analysis: Mathematical Foundations,” Springer, Berlin, 1999.
   Google Scholar
• L. K. Guo, F. P. Huang, Q. G. Li and G. Q. Zhang, “Power contexts and their concept lattices,” Discrete Mathematics, 311, 2049–2063 (2011). doi:10.1016/j.disc.2011.04.033
   Web of Science ®Google Scholar
• S. K. Harms and J. S. Deogun, “Sequencial accociation rule with time lags,” Journal of Intelligent Information Systems, 22, 7–22 (2004). doi:10.1023/A:1025824629047
   Web of Science ®Google Scholar
• Y. Leung and D. Y. Li, “Maximal consistent block technique for rule acquisition in incomplete information systems,” Information Sciences, 153, 85–106 (2003). doi:10.1016/S0020-0255(03)00061-6
   Web of Science ®Google Scholar
• J. H. Li, C. L. Mei and Y. J. Lv, “A heuristic knowledge-reduction method for decision formal contexts,” Computers and Mathematics with Applications, 61, 1096–1106 (2011). doi:10.1016/j.camwa.2010.12.060
   Web of Science ®Google Scholar
• J. H. Li, C. L. Mei and Y. J. Lv, “Knowledge reduction in formal decision contexts based on an order-preserving mapping,” International Journal of General Systems, 41, 143–161 (2012). doi:10.1080/03081079.2011.634410.
   Web of Science ®Google Scholar
• M. Z. Li and J. S. Mi, “The strong direct product of formal contexts,” Information Sciences, 226, 47–67 (2013). doi:10.1016/j.ins.2012.10.032
   Web of Science ®Google Scholar
• 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 Mathematics with Applications, 53, 1390–1410 (2007). doi: 10.1016/j.camwa.2006.03.040
   Web of Science ®Google Scholar
• E. Marczewski, “A general scheme of independence in mathematics,” Bulletin de L Academie of Polonaise des Sciences–Serie des Sciences Mathematiques Astronomiques et Physiques, 6, 731–736 (1958).
   Google Scholar
• J. Medina, “Relating attribute reduction in formal, object-oriented and property-oriented concept lattices,” Computers and Mathematics with Applications, 64, 1992–2002 (2012). doi:10.1016/j.camwa.2012.03.087
   Web of Science ®Google Scholar
• J. Medina, M. Ojeda–Aciego and J. Ruiz–Calviño, “Relating generalized concept lattices and concept lattices for non–commutative conjunctors,” Applied Mathematics Letters, 21, 1296–1300 (2008). doi:10.1016/j.aml.2007.12.026
   Web of Science ®Google Scholar
• J. Medina, M. Ojeda-Aciego and J. Ruiz-Calvi, “Formal concept analysis via multi-adjoint concept lattices,” Fuzzy Sets and Systems, 160, 130–144 (2009). doi:10.1016/j.fss.2008.05.004
   Web of Science ®Google Scholar
• J. S. Mi, Y. Leung and W. Z. Wu, “Approaches to attribute reduction in concept lattices induced by axialities,” Knowledge–Based Systems, 23, 504–511 (2010). doi:10.1016/j.knosys.2010.03.007
   Web of Science ®Google Scholar
• T. T. Nguyen, S. C. Hui and K. Y. Chang, “A lattice– based approach for mathematical search using Formal Concept Analysis,” Expert Systems with Applications, 39, 5820–5828 (2012). doi:10.1016/j.eswa.2011.11.085
   Web of Science ®Google Scholar
• T. Oyama, K. Kitano and T. K. Satou, “Extraction of knowledge on protein–protein interaction by association rule discovery,” Bioinformatics, 18, 705–714 (2002). doi:10.1093/bioinformatics/18.5.705
   PubMed Web of Science ®Google Scholar
• Z. Pawlak, “Rough sets,” International Journal of Computer and Information Science, 11, 341–356 (1982). doi:10.1007/BF01001956
   Web of Science ®Google Scholar
• J. R. Quinlan, “Simplifying decision trees,” International Journal of Man–Machine Studies, 27, 221–234 (1987). doi:10.1016/S0020-7373(87)80053-6
   Google Scholar
• K. S. Qu, Y. H. Zhai, J. Y. Liang and M. Chen, “Study of decision implications based on formal concept analysis,” International Journal of General Systems, 36, 147–156 (2007). doi:10.1080/03081070600913650
   Web of Science ®Google Scholar
• Y. C. Shao and K. Y. Qin, “Fuzzy Soft Sets and Fuzzy Soft Lattices,” International Journal of Computational Intelligence Systems, 5, 1135–1147 (2012). doi: 10.1080/18756891.2012.747667
   Web of Science ®Google Scholar
• P. Tonella, “Using a concept lattice of decomposition slices for program understanding and impact analysis,” IEEE Transactions on Software Engineering, 29, 495–509 (2003). doi:10.1109/TSE.2003.1205178
   Web of Science ®Google Scholar
• X. Wang and W. X. Zhang, “Relations of attribute reduction between object and property oriented concept lattices,” Knowledge Based Systems, 21, 398–403 (2008). doi:10.1016/j.knosys.2008.02.005
   Web of Science ®Google Scholar
• H. Wang and W. X. Zhang, “Approaches to knowledge reduction in generalized consistent decision formal context,” Mathematical and Computer Modelling, 48, 1677–1684 (2008). doi:10.1016/j.mcm.2008.06.007
   Web of Science ®Google Scholar
• 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, 51, 910–923 (2008). doi:10.1007/s11432-008-0067-4
   Google Scholar
• R. Wille, “Restructuring lattice theory: an approach based on hierarchies of concepts,” Formal Concept Analysis, 314–339 (2009). doi:10.1007/978-3-642-01815-2_23
   Google Scholar
• K. E. Wolff, “A conceptual view of knowledge bases in rough set theory,” Lecture Notes in Computer Science, 220–228 (2005). doi:10.1007/3-540-45554-X_26
   Google Scholar
• W. Z. Wu, Y. Leung and J. S. Mi, “Granular computing and knowledge reduction in formal context,” IEEE Transactions on Knowledge and Data Engineering, 21, 1461–1474 (2009). doi:10.1109/TKDE.2008.223
   Web of Science ®Google Scholar
• Y. Y. Yao, “A comparative study of formal concept analysis and rough set theory in data analysis,” In: S. Tsumoto, R. Slowinski, H. Jan Komorowski, J.W. Grzymala–Busse (Eds.) Springer, Berlin, 59–68 (2004). doi:10.1007/978-3-540-25929-9_6
   Google Scholar
• H. Z. Yang, Y. Leung and M. W. Shao, “Rule acquisition and attribute reduction in real decision formal contexts,” Soft Computing, 15, 1115–1128 (2011). doi:10.1007/s00500-010-0578-y
   Web of Science ®Google Scholar
• L. Yang, Y. H. Wang and Y. Xu, “A Combination Algorithm of Multiple Lattice-Valued Concept Lattices,” International Journal of Computational Intelligence Systems, 6, 881–892 (2013). doi:10.1080/18756891.2013.807109
   Web of Science ®Google Scholar
• W. X. Zhang, L. Wei and J. J. Qi, “Attribute reduction in concept lattice based on discernibility matrix,” Lecture Notes in Computer Science, 3642, 157–165 (2005). doi:10.1007/11548706_17
   Google Scholar