Multi-stage machine learning model for hierarchical tie valence prediction
dc.contributor.author | Singh, K | |
dc.contributor.author | Lee, S | |
dc.contributor.author | Labianca, GJ | |
dc.contributor.author | Fagan, JM | |
dc.contributor.author | Cha, M | |
dc.date.accessioned | 2023-05-26T08:12:03Z | |
dc.date.issued | 2023-02-28 | |
dc.date.updated | 2023-05-25T14:16:34Z | |
dc.description.abstract | Individuals interacting in organizational settings involving varying levels of formal hierarchy naturally form a complex network of social ties having different tie valences (e.g., positive and negative connections). Social ties critically affect employees' satisfaction, behaviors, cognition, and outcomes - yet identifying them solely through survey data is challenging because of the large size of some organizations or the often hidden nature of these ties and their valences. We present a novel deep learning model encompassing NLP and graph neural network techniques that identifies positive and negative ties in a hierarchical network. The proposed model uses human resource attributes as node information and web-logged work conversation data as link information. Our findings suggest that the presence of conversation data improves the tie valence classification by 8.91% compared to employing user attributes alone. This gain came from accurately distinguishing positive ties, particularly for male, non-minority, and older employee groups. We also show a substantial difference in conversation patterns for positive and negative ties with positive ties being associated with more messages exchanged on weekends, and lower use of words related to anger and sadness. These findings have broad implications for facilitating collaboration and managing conflict within organizational and other social networks. | en_GB |
dc.description.sponsorship | Institute for Basic Sciences (IBS), Republic of Korea | en_GB |
dc.description.sponsorship | National Research Foundation of Korea (NRF) | en_GB |
dc.format.extent | 1-20 | |
dc.identifier.citation | Vol. 17, No. 6, article 83 | en_GB |
dc.identifier.doi | https://doi.org/10.1145/3579096 | |
dc.identifier.grantnumber | IBS-R029-C2 | en_GB |
dc.identifier.grantnumber | RS-2022-00165347 | en_GB |
dc.identifier.uri | http://hdl.handle.net/10871/133234 | |
dc.identifier | ORCID: 0000-0002-9412-8421 (Labianca, Giuseppe Joe) | |
dc.identifier | ScopusID: 6602878730 (Labianca, Giuseppe Joe) | |
dc.identifier | ResearcherID: K-6074-2015 (Labianca, Giuseppe Joe) | |
dc.language.iso | en | en_GB |
dc.publisher | Association for Computing Machinery (ACM) | en_GB |
dc.rights | © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org | en_GB |
dc.subject | Signed link prediction | en_GB |
dc.subject | sentiment embeddings | en_GB |
dc.subject | graph neural networks | en_GB |
dc.subject | tie-valence prediction | en_GB |
dc.subject | organizational social network | en_GB |
dc.title | Multi-stage machine learning model for hierarchical tie valence prediction | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2023-05-26T08:12:03Z | |
dc.identifier.issn | 1556-4681 | |
exeter.article-number | ARTN 83 | |
dc.description | This is the final version. Available from the Association for Computing Machinery via the DOI in this record. | en_GB |
dc.description | Data availability: Due to our non-disclosure agreement with the organization and our Institutional Review Board data management protocol, the raw data cannot be shared. | en_GB |
dc.identifier.eissn | 1556-472X | |
dc.identifier.journal | ACM Transactions on Knowledge Discovery from Data | en_GB |
dc.relation.ispartof | ACM Transactions on Knowledge Discovery from Data, 17(6) | |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en_GB |
dcterms.dateAccepted | 2022-12-16 | |
rioxxterms.version | VoR | en_GB |
rioxxterms.licenseref.startdate | 2023-02-28 | |
rioxxterms.type | Journal Article/Review | en_GB |
refterms.dateFCD | 2023-05-26T08:04:47Z | |
refterms.versionFCD | VoR | |
refterms.dateFOA | 2023-05-26T08:12:50Z | |
refterms.panel | C | en_GB |
refterms.dateFirstOnline | 2023-02-28 |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's licence is described as © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee
provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and
the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be
honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists,
requires prior specific permission and/or a fee. Request permissions from permissions@acm.org