Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Orders Are Unwanted: Dynamic Deep Graph Convolutional Network for Personality Detection

About

Predicting personality traits based on online posts has emerged as an important task in many fields such as social network analysis. One of the challenges of this task is assembling information from various posts into an overall profile for each user. While many previous solutions simply concatenate the posts into a long document and then encode the document by sequential or hierarchical models, they introduce unwarranted orders for the posts, which may mislead the models. In this paper, we propose a dynamic deep graph convolutional network (D-DGCN) to overcome the above limitation. Specifically, we design a learn-to-connect approach that adopts a dynamic multi-hop structure instead of a deterministic structure, and combine it with a DGCN module to automatically learn the connections between posts. The modules of post encoder, learn-to-connect, and DGCN are jointly trained in an end-to-end manner. Experimental results on the Kaggle and Pandora datasets show the superior performance of D-DGCN to state-of-the-art baselines. Our code is available at https://github.com/djz233/D-DGCN.

Tao Yang, Jinghao Deng, Xiaojun Quan, Qifan Wang• 2022

Related benchmarks

TaskDatasetResultRank
4-dimensional binary personality classificationPANDORA
Macro-F162.01
23
Personality DetectionKaggle
I/E Score69.52
13
4-dimensional binary personality classificationKaggle
Macro F171.35
10
16-types multiclass personality classificationPANDORA
F1 Score0.2969
10
16-types multiclass personality classificationKaggle
F1 Score (%)30.32
10
Showing 5 of 5 rows

Other info

Follow for update