Mining Lurkers in Online Social Networks [electronic resource] : Principles, Models, and Computational Methods / by Andrea Tagarelli, Roberto Interdonato.
Tipo de material: TextoSeries SpringerBriefs in Computer ScienceEditor: Cham : Springer International Publishing : Imprint: Springer, 2018Edición: 1st ed. 2018Descripción: VI, 93 p. 10 illus., 9 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783030002299Tema(s): Computers | Application software | Computer communication systems | Information Systems and Communication Service | Computer Appl. in Social and Behavioral Sciences | Computer Communication NetworksFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 005.7 Clasificación LoC:QA75.5-76.95Recursos en línea: Libro electrónico En: Springer Nature eBookResumen: This SpringerBrief brings order to the wealth of research studies that contribute to shape our understanding of on-line social networks (OSNs) lurking phenomena. This brief also drives the development of computational approaches that can be effectively applied to answer questions related to lurking behaviors, as well as to the engagement of lurkers in OSNs. All large-scale online social networks (OSNs) are characterized by a participation inequality principle, i.e., the crowd of an OSN does not actively contribute, rather it takes on a silent role. Silent users are also referred to as lurkers, since they gain benefit from others' information without significantly giving back to the community. Nevertheless, lurkers acquire knowledge from the OSN, therefore a major goal is to encourage them to more actively participate. Lurking behavior analysis has been long studied in social science and human-computer interaction fields, but it has also matured over the last few years in social network analysis and mining. While the main target audience corresponds to computer, network, and web data scientists, this brief might also help increase the visibility of the topic by bridging different closely related research fields. Practitioners, researchers and students interested in social networks, web search, data mining, computational social science and human-computer interaction will also find this brief useful research material . .Tipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
---|---|---|---|---|---|---|---|
Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | 1 | No para préstamo |
Acceso multiusuario
This SpringerBrief brings order to the wealth of research studies that contribute to shape our understanding of on-line social networks (OSNs) lurking phenomena. This brief also drives the development of computational approaches that can be effectively applied to answer questions related to lurking behaviors, as well as to the engagement of lurkers in OSNs. All large-scale online social networks (OSNs) are characterized by a participation inequality principle, i.e., the crowd of an OSN does not actively contribute, rather it takes on a silent role. Silent users are also referred to as lurkers, since they gain benefit from others' information without significantly giving back to the community. Nevertheless, lurkers acquire knowledge from the OSN, therefore a major goal is to encourage them to more actively participate. Lurking behavior analysis has been long studied in social science and human-computer interaction fields, but it has also matured over the last few years in social network analysis and mining. While the main target audience corresponds to computer, network, and web data scientists, this brief might also help increase the visibility of the topic by bridging different closely related research fields. Practitioners, researchers and students interested in social networks, web search, data mining, computational social science and human-computer interaction will also find this brief useful research material . .
UABC ; Temporal ; 01/01/2021-12/31/2023.