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
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
What is the Dimension of Your Binary Data?
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Formal concept analysis constrained by attribute-dependency formulas
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Distributed formal concept analysis algorithms based on an iterative mapreduce framework
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Social-Based Conceptual Links: Conceptual Analysis Applied to Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A bottom-up algorithm of vertical assembling concept lattices
International Journal of Data Mining and Bioinformatics
From Frequent Features to Frequent Social Links
International Journal of Information System Modeling and Design
| 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 address computational complexity of social networks analysis and clarity of their visualization. Our approach uses combination of Formal Concept Analysis and well-known matrix factorization methods. The goal is to reduce the dimension of social network data and to measure the amount of information which is lost during the reduction.