scholarly journals Collecting survey-based social network information in work organizations

2022 ◽  
Vol 68 ◽  
pp. 31-47
Author(s):  
Filip Agneessens ◽  
Giuseppe (Joe) Labianca
2018 ◽  
pp. 823-862
Author(s):  
Ming Yang ◽  
William H. Hsu ◽  
Surya Teja Kallumadi

In this chapter, the authors survey the general problem of analyzing a social network in order to make predictions about its behavior, content, or the systems and phenomena that generated it. They begin by defining five basic tasks that can be performed using social networks: (1) link prediction; (2) pathway and community formation; (3) recommendation and decision support; (4) risk analysis; and (5) planning, especially causal interventional planning. Next, they discuss frameworks for using predictive analytics, availability of annotation, text associated with (or produced within) a social network, information propagation history (e.g., upvotes and shares), trust, and reputation data. They also review challenges such as imbalanced and partial data, concept drift especially as it manifests within social media, and the need for active learning, online learning, and transfer learning. They then discuss general methodologies for predictive analytics involving network topology and dynamics, heterogeneous information network analysis, stochastic simulation, and topic modeling using the abovementioned text corpora. They continue by describing applications such as predicting “who will follow whom?” in a social network, making entity-to-entity recommendations (person-to-person, business-to-business [B2B], consumer-to-business [C2B], or business-to-consumer [B2C]), and analyzing big data (especially transactional data) for Customer Relationship Management (CRM) applications. Finally, the authors examine a few specific recommender systems and systems for interaction discovery, as part of brief case studies.


2013 ◽  
pp. 103-120
Author(s):  
Giuseppe Berio ◽  
Antonio Di Leva ◽  
Mounira Harzallah ◽  
Giovanni M. Sacco

The exploitation and integration of social network information in a competence reference model (CRAI, Competence, Resource, Aspect, Individual) are discussed. The Social-CRAI model, which extends CRAI to social networks, provides an effective solution to this problem and is discussed in detail. Finally, dynamic taxonomies, a model supporting explorative conceptual search, are introduced and their use in the context of the Social-CRAI model for exploring retrieved information available in social networks is discussed. A real-world example is provided.


2011 ◽  
pp. 149-175 ◽  
Author(s):  
Yutaka Matsuo ◽  
Junichiro Mori ◽  
Mitsuru Ishizuka

This chapter describes social network mining from the Web. Since the end of the 1990s, several attempts have been made to mine social network information from e-mail messages, message boards, Web linkage structure, and Web content. In this chapter, we specifically examine the social network extraction from the Web using a search engine. The Web is a huge source of information about relations among persons. Therefore, we can build a social network by merging the information distributed on the Web. The growth of information on the Web, in addition to the development of a search engine, opens new possibilities to process the vast amounts of relevant information and mine important structures and knowledge.


2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Stanley Sewe ◽  
Philip Ngare ◽  
Patrick Weke

We investigate the filtering problem where the borrower’s time varying credit quality process is estimated using continuous time observation process and her (in this paper we refer to the borrower as female and the lender as male) ego-network data. The hidden credit quality is modeled as a hidden Gaussian mean-reverting process whilst the social network is modeled as a continuous time latent space network model. At discrete times, the network data provides unbiased estimates of the current credit state of the borrower and her ego-network. Combining the continuous time observed behavioral data and network information, we provide filter equations for the hidden credit quality and show how the network information reduces information asymmetry between the borrower and the lender. Further, we consider the case when the network information arrival times are random and solve stochastic optimal control problem for a lender having linear quadratic utility function.


Sign in / Sign up

Export Citation Format

Share Document