2007 Innovations in Information Technologies (IIT) 2007
DOI: 10.1109/iit.2007.4430480
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…There are also various simplification methods which does not simply follow the typical grouping-merging flow. The research in [16] apply several matrix decomposition methods, including the previously mentioned SVD, semi discrete matrix decomposition (SDD) and non-negative matrix factorization (NMF), for reducing the rank of the binary matrix converted from the formal context. However, unlike the method proposed in [3], they do not merge any objects or attributes after decomposition.…”
Section: Other Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…There are also various simplification methods which does not simply follow the typical grouping-merging flow. The research in [16] apply several matrix decomposition methods, including the previously mentioned SVD, semi discrete matrix decomposition (SDD) and non-negative matrix factorization (NMF), for reducing the rank of the binary matrix converted from the formal context. However, unlike the method proposed in [3], they do not merge any objects or attributes after decomposition.…”
Section: Other Methodsmentioning
confidence: 99%
“…However, unlike the method proposed in [3], they do not merge any objects or attributes after decomposition. Instead, they directly approximate the reconstructed low-ranked matrix back into a binary matrix and use it as the final result for the reduction [16,17]. Additionally, a novel method called Adaptive Evolutionary Clustering Algorithm Star (Adaptive ECA*) is proposed in [10], which is specially designed for the task of deriving concept hierarchies from text.…”
Section: Other Methodsmentioning
confidence: 99%
“…The literature describes a variety of techniques for controlling the complexity and size of formal contexts, formal concepts, concept lattices, and implications. To enhancing FCA scalability there are popular research techniques include iceberg concept lattices [10], matrix decompositions [42], conceptual scaling for many-valued contexts [43], the reduction of the concept lattices based on rough set [44], and other. In [39], the authors divided concept lattice reduction techniques into three categories.…”
Section: Current Issues and Research Directionsmentioning
confidence: 99%
“…In fact, if an object, attribute or incidence can be removed or changed in a way that the resulting concept lattice is isomorphic to the original one, then such elements are redundant. Among the most important models based on this technique are (ASWANI KUMAR and SRINIVAS, 2010;Codocedo et al, 2011;Snasel et al, 2007).…”
Section: Redundant Information Removalmentioning
confidence: 99%