Condici�n: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. T. N� de ref. del art�culo: 1582626210

Contactar al vendedor

Comprar nuevo

EUR 162,51

Convertir moneda

Gastos de env�o: EUR 48,99

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Finding Communities in Social Networks Using Graph Embeddings

David B. Skillicorn

Publicado por Springer Nature Switzerland, Springer Nature Switzerland Jun 2024, 2024

ISBN 10: 3031609158 ISBN 13: 9783031609152

Nuevo Tapa dura

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Buch. Condici�n: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection. 188 pp. Englisch. N� de ref. del art�culo: 9783031609152

Contactar al vendedor

Comprar nuevo

EUR 192,59

Convertir moneda

Gastos de env�o: EUR 23,00

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Finding Communities in Social Networks Using Graph Embeddings

David B. Skillicorn

Publicado por Springer Nature Switzerland, Springer Nature Switzerland, 2024

ISBN 10: 3031609158 ISBN 13: 9783031609152

Nuevo Tapa dura

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Buch. Condici�n: Neu. Druck auf Anfrage Neuware - Printed after ordering - Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection. N� de ref. del art�culo: 9783031609152

Contactar al vendedor

Comprar nuevo

EUR 192,59

Convertir moneda

Gastos de env�o: EUR 30,26

De Alemania a Estados Unidos de America

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Finding Communities in Social Networks Using Graph Embeddings (Hardcover)

Mosab Alfaqeeh

Publicado por Springer International Publishing AG, Cham, 2024

ISBN 10: 3031609158 ISBN 13: 9783031609152

Nuevo Tapa dura

Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Hardcover. Condici�n: new. Hardcover. Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N� de ref. del art�culo: 9783031609152

Contactar al vendedor