Batch kernel SOM and related Laplacian methods for social network analysis

Details Batch kernel SOM and related Laplacian methods for social network analysis Batch kernel SOM and related Laplacian methods for social network analysis

2008-01-06

arxiv.org/abs/0801.0848v1

Neurocomputing / EEG Neurocomputing (2008) A para\^itre

Statistics

Applications

Scientific paper

Large graphs are natural mathematical models for describing the structure of the data in a wide variety of fields, such as web mining, social networks, information retrieval, biological networks, etc. For all these applications, automatic tools are required to get a synthetic view of the graph and to reach a good understanding of the underlying problem. In particular, discovering groups of tightly connected vertices and understanding the relations between those groups is very important in practice. This paper shows how a kernel version of the batch Self Organizing Map can be used to achieve these goals via kernels derived from the Laplacian matrix of the graph, especially when it is used in conjunction with more classical methods based on the spectral analysis of the graph. The proposed method is used to explore the structure of a medieval social network modeled through a weighted graph that has been directly built from a large corpus of agrarian contracts.

Affiliated with

Also associated with

No associations

Rating

Batch kernel SOM and related Laplacian methods for social network analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Batch kernel SOM and related Laplacian methods for social network analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Batch kernel SOM and related Laplacian methods for social network analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507023