Batch kernel SOM and related Laplacian methods for social network analysis

@article{Boulet2008BatchKS,
  title={Batch kernel SOM and related Laplacian methods for social network analysis},
  author={Romain Boulet and B. Jouve and F. Rossi and N. Villa-Vialaneix},
  journal={Neurocomputing},
  year={2008},
  volume={71},
  pages={1257-1273}
}
  • Romain Boulet, B. Jouve, +1 author N. Villa-Vialaneix
  • Published 2008
  • Computer Science, Mathematics
  • Neurocomputing
  • 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… CONTINUE READING
    112 Citations
    Using SOMbrero for clustering and visualizing graphs
    • 10
    • Highly Influenced
    • PDF
    Mining a medieval social network by kernel SOM and related methods
    • 7
    • Highly Influenced
    • PDF
    Multiple Kernel Self-Organizing Maps
    • 17
    • PDF
    Social Networks Analysis using External Community Relationship
    • 2
    Dense and sparse vertex connectivity in networks

    References

    SHOWING 1-10 OF 84 REFERENCES
    Finding community structure in very large networks.
    • 5,081
    • PDF
    Defining and identifying communities in networks.
    • 1,975
    • PDF
    Spectral Kernel Methods for Clustering
    • 97
    • PDF
    Finding and evaluating community structure in networks.
    • M. Newman, M. Girvan
    • Physics, Medicine
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2004
    • 10,354
    • PDF
    Detecting network communities: a new systematic and efficient algorithm
    • 424
    • PDF
    Computing Communities in Large Networks Using Random Walks
    • 1,898
    • PDF
    A comparison between dissimilarity SOM and kernel SOM for clustering the vertices of a graph
    • 29
    • Highly Influential
    • PDF
    Uncovering the overlapping community structure of complex networks in nature and society
    • 4,409
    • PDF
    Diffusion kernels on graphs and other discrete structures
    • 459
    • PDF
    Random graph models of social networks
    • M. Newman, D. Watts, S. Strogatz
    • Medicine, Computer Science
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2002
    • 1,215
    • PDF