Analysing Online Social Network Data with Biclustering and Triclustering

In this paper we propose two novel methods for analysing data collected from online social networks. In particular we will do analyses on Vkontake data (Russian online social network). Using biclustering we extract groups of users with similar interests and find communities of users which belong to similar groups. With triclustering we reveal users’ interests as tags and use them to describe Vkontakte groups. After this social tagging process we can recommend to a particular user relevant groups to join or new friends from interesting groups which have a similar taste. We present some preliminary results and explain how we are going to apply these methods on massive data repositories.

[1]  Boris G. Mirkin,et al.  Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data , 2011, RSFDGrC.

[2]  Douglas R. White,et al.  Statistical entailments and the Galois lattice , 1996 .

[3]  Leonid Zhukov,et al.  From Triconcepts to Triclusters , 2011, RSFDGrC.

[4]  Camille Roth,et al.  Towards Concise Representation for Taxonomies of Epistemic Communities , 2006, CLA.

[5]  Camille Roth,et al.  Social and semantic coevolution in knowledge networks , 2010, Soc. Networks.

[6]  Camille Roth,et al.  Generalized Preferential Attachment : Towards Realistic Socio-Semantic Network Models , 2005 .

[7]  Tsuyoshi Murata,et al.  Evaluating Community Structure in Bipartite Networks , 2010, 2010 IEEE Second International Conference on Social Computing.

[8]  Sergei O. Kuznetsov,et al.  On stability of a formal concept , 2007, Annals of Mathematics and Artificial Intelligence.

[9]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[10]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[11]  Linton C. Freeman,et al.  Cliques, Galois lattices, and the structure of human social groups☆ , 1996 .

[12]  Matthieu Latapy,et al.  Basic notions for the analysis of large two-mode networks , 2008, Soc. Networks.

[13]  Pascal Hitzler,et al.  Conceptual Structures: Inspiration and Application, 14th International Conference on Conceptual Structures, ICCS 2006, Aalborg, Denmark, July 16-21, 2006, Proceedings , 2006, ICCS.

[14]  Mohammed J. Zaki,et al.  TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data , 2005, SIGMOD '05.

[15]  Yavorskiy Rostislav.  Research Challenges of Dynamic Socio-Semantic Networks , 2011 .

[16]  Tsuyoshi Murata.  Detecting communities from tripartite networks , 2010, WWW '10.

[17]  Jean-François Boulicaut,et al.  Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery , 2006, ICCS.

[18]  J. Mohr,et al.  The duality of culture and practice: Poverty relief in New York City, 1888--1917 , 1997 .

[19]  Andreas Hotho,et al.  TRIAS--An Algorithm for Mining Iceberg Tri-Lattices , 2006, Sixth International Conference on Data Mining (ICDM'06).

[20]  Lc Freeman,et al.  USING GALOIS LATTICES TO REPRESENT NETWORK DATA , 1993 .

[21]  Tore Opsahl.  Triadic closure in two-mode networks: Redefining the global and local clustering coefficients , 2013, Soc. Networks.

[22]  Vincent Duquenne.  Lattice analysis and the representation of handicap associations , 1996 .