Analyzing social networks using FCA: Complexity aspects

Proceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009

Volumn 3, Issue , 2009, Pages 38-41

  Snášel, Václav ^a   Horák, Zdeněk ^a   Kočíbová, Jana ^a   Abraham, Ajith ^b  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Concept lattice; Correlation dimension; Matrix factorization; Two mode social network

Indexed keywords

AMOUNT OF INFORMATION; CONCEPT LATTICES; CORRELATION DIMENSION; FORMAL CONCEPT ANALYSIS; MATRIX FACTORIZATIONS; SOCIAL NETWORKS; SOCIAL NETWORKS ANALYSIS;

INFORMATION ANALYSIS; INTELLIGENT AGENTS; SOCIAL NETWORKING (ONLINE); VISUALIZATION;

SOCIAL SCIENCES COMPUTING;

EID: 84856895573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI-IAT.2009.225     Document Type: Conference Paper

References (13)

1. R. Belohlavek, V. Sklenar: Formal concept analysis constrained by attribute-dependency formulas ICFCA, vol. 3403, pp. 176-191 (2005)
2. A. Davis, B. B. Gardner, M. R. Gardner: Deep South: A Social Anthropological Study of Caste and Class, University of Chicago Press (1965)
3. L. Egghe, R. Rousseau: Classical retrieval and overlap measures satisfy the requirements for rankings based on a Lorenz curve, Information Processing and Management, vol. 42, pp. 106-120 (2006)
4. M. Farach-Colton, Y. Huang: A linear delay algorithm for building concept lattices, Combinatorial Pattern Matching: 19th Annual Symposium (2008)
5. L. C. Freeman: Graphical Techniques for Exploring Social Network Data, Models and Methods in Social Network Analysis (2005)
6. L. C. Freeman: Visualizing social networks, Journal of social structure, vol. 1 (2000)
7. L. C. Freeman, D. R. White: Using Galois Lattices to Represent Network Data, Sociological Methodology, vol. 23, pp. 127-146 (1993)
8. B. Ganter, R. Wille: Formal Concept Analysis: Mathematical Foundations, Springer-Verlag, New York (1997)
9. T. G. Kolda, D. P. O'Leary: A semidiscrete matrix decomposition for latent semantic indexing information retrieval, ACM Transactions on Information Systems (TOIS), vol. 16, pp. 322-346 (1998)
10. S. O. Kuznetsov, S. A. Obedkov: Comparing Performance of Algorithms for Generating Concept Lattices, Journal of Experimental and Theoretical Artificial Intelligence, vol. 14, pp. 189-216 (2002)
11. D. Lee, H. Seung: Learning the parts of objects by nonnegative matrix factorization, Nature, vol. 401, pp. 788-791 (1999)
12. T. Letsche, M. W. Berry, S. T. Dumais: Computational methods for intelligent information access, Proceedings of the 1995 ACM/IEEE Supercomputing Conference (1995)
13. N. Tatti, T. Mielikainen, A. Gionis, H. Mannila: What is the dimension of your binary data?, Proceedings of the Sixth International Conference on Data Mining, pp. 603-612 (2006)