Behavior of the Concept Lattice Reduction to visualizing data after Using Matrix Decompositions

High complexity of formal concept, analysis algorithms and lattice construction algorithms are main problems today. If we want to compute all concepts from huge incidence matrix, complexity plays a great role. In some cases, we do not need to compute all concepts, but only some of them. Our research focuses on behavior of the concept lattice reduction after using matrix decompositions. Modified matrix has lower dimensions and acts as input for some known algorithms for lattice construction. In this paper we want to describe the deferent between methods for matrix decompositions and describe their influence on the concept lattice.