Knowledge reduction is one of critical problems in data mining and information processing. It can simplify the structure of the lattice during the construction of fuzzy-crisp concept lattice. In terms of fuzzy-crisp concept, we develop an order-class matrix to represent extents and intents of concepts, respectively. In order to improve the computing efficiency, it is necessary to reduce the size of lattices as much as possible. Therefore the judgement theorem of meet-irreducible elements is proposed. To deal with attribute reductions, we develop a discernibility Boolean matrix in formal fuzzy contexts by preserving extents of meet-irreducible elements via order-class matrix. A heuristic attribute-reduction algorithm is proposed. Then we extend the proposed model to consistent formal fuzzy decision contexts. Our methods present a new framework for knowledge reduction in formal fuzzy contexts.
AkramM. and SarwarM., Transversals of m-polar fuzzy hypergraphs with applications, Journal of Intelligent & Fuzzy Systems33(1) (2017), 351–364.
2.
BuruscoA. and Fuentes-GonzálezR., Concept lattices defined from implication operators, Fuzzy Sets & Systems114(3) (2000), 431–436.
3.
CarpinetoC. and RomanoG., A lattice conceptual clustering system and its application to browsing retrieval, Machine Learning24(2) (1996), 95–122.
4.
ChenJ., MiJ. and LinY., A graph approach for knowledge reduction in formal contexts, Knowledge-Based Systems148 (2018), 177–188.
5.
ChenJ., MiJ., XieB. and LinY., A fast attribute reduction method for large formal decision contexts, International Journal of Approximate Reasoning106 (2019), 1–17.
6.
FormicaA., Similarity reasoning in formal concept analysis: from one-to many-valued contexts, Knowledge and Information Systems60(2) (2019), 715–739.
7.
GanterB. and WilleR., Formal Concept Analysis, Berlin: Springer (1999).
8.
GeorgescuG. and PopescuA., Non-dual fuzzy connections, Archive for Mathematical Logic43(8) (2004), 1009–1039.
9.
GhoraiG. and PalM., Novel concepts of strongly edge irregular m-polar fuzzy graphs, International Journal of Applied and Computational Mathematics3(4) (2017), 3321–3332.
10.
HaoS., ShiC., NiuZ. and CaoL., Concept coupling learning for improving concept lattice-based document retrieval, Engineering Applications of Artificial Intelligence69 (2018), 65–75.
11.
JoshiR., A new multi-criteria decision-making method based on intuitionistic fuzzy informat, Journal of Ambient Intelligence and Humanized Computing11 (2020), 739–753.
12.
KrajčiS., Cluster based efficient generation of fuzzy concepts, Neural Network World13(5) (2003), 521–530.
13.
LiF. and ZhangJ., Attribute reduction in fuzzy concept lattices based on the T implication, Knowledge-Based Systems23(6) (2010), 497–503.
14.
LiJ., MeiC. and LvY., Knowledge reduction in real decision formal contexts, Information Sciences189 (2012), 191–207.
15.
LiK., ShaoM. and WuW., A data reduction method in formal fuzzy contexts, International Journal of Machine Learning and Cybernetics8(4) (2017), 1145–1155.
16.
LinY. and LiJ., A Boolean matrix approach for granular reduction in formal fuzzy contexts, Journal of Intelligent and Fuzzy Systems37(4) (2019), 5217–5228.
17.
LinY., LiJ., TanA. and ZhangJ., Granular matrix-based knowledge reductions of formal fuzzy contexts, International Journal of Machine Learning and Cybernetics11(3) (2020), 643–656.
18.
MaoH. and MiaoH., Attribute reduction based on directed graph in formal fuzzy contexts, Journal of Intelligent & Fuzzy Systems34(6) (2018), 4139–4148.
19.
PandeyA.C., RajpootD.S. and SaraswatM., Feature selection method based on hybrid data transformation and binary binomial cuckoo search, Journal of Ambient Intelligence and Humanized Computing11 (2020), 719–738.
QiJ., Attribute reduction in formal contexts based on a new discernibility matrix, Journal of Applied Mathematics and Computing30 (1–2) (2009), 305–314.
22.
SkowronA., Boolean reasoning for implication rules generation, methodologies for intelligent systems: 295–305, Springer-Verlag, (1993).
23.
SkowronA. and RauszerC., The discernibility matrices and functions in information systems, Intelligent decision support. Springer, Dordrecht, (1992), 331–362.
24.
SinghP. and KumarC., A method for decomposition of fuzzy formal context, Procedia Engineering38 (2012), 1852–1857.
25.
ShaoM. and LeungY., Relations between granular reduct and dominance reduct in formal contexts, Knowledge-Based Systems65 (2014), 1–11.
26.
ShaoM., LeungY., WangX. and WuW., Granular reducts of formal fuzzy contexts, Knowledge-Based Systems114 (2016), 156–166.
27.
SinghP. and GaniA., Fuzzy concept lattice reduction using Shannon entropy and Huffman coding, Journal of Applied Non-Classical Logics25(2) (2015), 101–119.
28.
SarwarM. and AkramM., Certain algorithms for computing strength of competition in bipolar fuzzy graphs, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems25(06) (2017), 877–896.
29.
WilleR., Restructuring lattice theory: an approach based on hierarchies of concepts, Ordered sets, Springer, Dordrecht, (1982), 445–470.
30.
WeiL., QiJ. and ZhangW., Attribute reduction theory of concept lattice based on decision formal contexts, Science in China Series F: Information Sciences51(7) (2008), 910–923.
31.
WangH. and ZhangW., Approaches to knowledge reduction in generalized consistent decision formal context, Mathematical and Computer Modelling48(11–12) (2008), 1677–1684.
32.
WuW., LeungY. and MiJ., Granular computing and knowledge reduction in formal contexts, IEEE Transactions on Knowledge and Data Engineering21(10) (2009), 1461–1474.
33.
WeiL. and WanQ., Granular transformation and irreducible element judgment theory based on pictorial diagrams, IEEE Transactions on Cybernetics46(2) (2017), 380–387.
34.
YahiaS., ArourK., SlimaniA. and JaouaA., Discovery of compact rules in relational databases, Information Science Journal4(3) (2000), 497–511.
35.
YaoW. and LuL., Fuzzy Galois connections on fuzzy posets, Mathematical Logic Quarterly55(1) (2009), 105–112.
36.
YangB. and HuB., Matrix representations and interdependency on L-fuzzy covering-based approximation operators, International Journal of Approximate Reasoning96 (2018), 57–77.
37.
ZhangJ., LuoZ., LiC., ZhouC. and LiS., Manifold regularized discriminative feature selection for multi-label learning, Pattern Recognition95 (2019), 136–150.
38.
ZhangJ., LiC., SunZ., LuoZ., ZhouC. and LiS., Towards a unified multi-source-based optimization framework for multi-label learning, Applied Soft Computing76 (2019), 425–435.
39.
ZhangJ., LiC., CaoD., LinY., SuS., DaiL. and LiS., Multi-label learning with label-specific features by resolving label correlations, Knowledge-Based Systems159 (2018), 148–157.
40.
ZhangW., WeiL. and QiJ., Attribute reduction theory and approach of concept lattices, Sci China: Ser E-Inf Sci35(6) (2005), 628–639.
41.
ZhangW., WeiL. and QiJ., Attribute reduction in concept lattice based on discernibility matrix, International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, Springer, Berlin, Heidelberg, (2005), 157–165.
42.
ZhangW., MaJ. and FanS., Variable threshold concept lattices, Information Sciences177(22) (2007), 4883–4892.
