Computational Methods for Intelligent Information Access
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A semidiscrete matrix decomposition for latent semantic indexing information retrieval
ACM Transactions on Information Systems (TOIS)
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
What is the Dimension of Your Binary Data?
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
A Linear Delay Algorithm for Building Concept Lattices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
Formal concept analysis constrained by attribute-dependency formulas
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Hi-index | 0.00 |
Since the availability of social networks data and the range of these data have significantly grown in recent years, new aspects have to be considered. In this paper, we use combination of Formal Concept Analysis and well-known matrix factorization methods to address computational complexity of social networks analysis and clarity of their visualization. The goal is to reduce the dimension of social network data and to measure the amount of information, which has been lost during the reduction. Presented example containing real data proves the feasibility of our approach.