Social Networks and Questions of Big Data. Graph search for communities with corresponding keywords


Trabajo de Seminario, 2017

5 Páginas, Calificación: 1.3


Resumen o Introducción

This essay deals with a graph search for communities with corresponding keywords.

The era of big data and world-spanning social networks has highlighted the necessity of ways to make sense of this vast amount of information. Data can be arranged in a graph of connected vertices, therefore giving it a basic structure. If the vertices are further described by keywords, the structure is called an attributed graph. This paper discusses a query algorithm that scans these attributed graphs for communities that are not only structurally linked - therefore forming subgraphs - but also share the same keywords. This method might give new insights into the composition of large networks, highlight interesting connections and give opportunities for effectively targeted marketing. As a specific use case, the idea of the attributed community query is applied to the example of a film recommendation program.

Detalles

Título
Social Networks and Questions of Big Data. Graph search for communities with corresponding keywords
Universidad
LMU Munich  (Institut für Informatik)
Curso
Recent Developments in Data Science
Calificación
1.3
Autor
Año
2017
Páginas
5
No. de catálogo
V369515
ISBN (Ebook)
9783668471757
Tamaño de fichero
572 KB
Idioma
Inglés
Palabras clave
community, graph, network, search, mining, social network, data, informatics
Citar trabajo
Andrea Attwenger (Autor), 2017, Social Networks and Questions of Big Data. Graph search for communities with corresponding keywords, Múnich, GRIN Verlag, https://www.grin.com/document/369515

Comentarios

  • No hay comentarios todavía.
Leer eBook
Título: Social Networks and Questions of Big Data. Graph search for communities with corresponding keywords



Cargar textos

Sus trabajos académicos / tesis:

- Publicación como eBook y libro impreso
- Honorarios altos para las ventas
- Totalmente gratuito y con ISBN
- Le llevará solo 5 minutos
- Cada trabajo encuentra lectores

Así es como funciona