Browse › Natural Language Processing › Personality Recognition in Conversation › CPED

Personality Recognition in Conversation archive 2025-07-28

CPED Benchmark (Personality Recognition in Conversation)

4 rows 4 with code listed 7 metrics Dataset page

Given a speaker's conversation with others, it is required to recognize the speaker's personality traits through the conversation record, which includes two scenarios, (1) 1-1 conversations: the robot recognizes the personality traits of the speaker through the conversation between them (e.g., psychological counseling), (2) 1-N conversations : the robot listens to the speaker's conversations with other N people and then recognizes the speaker's personality traits (e.g., group chatbot, home service robot). Since 1-N includes the case of 1-1, we only discusses PRC in 1-N conversations. The task of PRC in 1-N conversations can be formulated as:

Perᵢ = argmax_(Per′ᵢ)P(Per′ᵢ | C_(i,j), ⋯, C_(i,N))

where Perᵢ=[Neu, Ext, Ope, Agr, Con] is a 5-dimensional vector representing Neuroticism, Extraversion, Openness, Agreeableness, and Conscientiousness. C_(i,j) is the conversations between Speakerᵢ and Speakerⱼ (1 ≤j ≤N).

The archive carries no text for this table; the description above is the archive's text for the task Personality Recognition in Conversation. archive 2025-07-28

Over time archive 2025-07-28

The chart needs JavaScript; the table below carries every value.

Direction inferred from the metric name, not from the archive: Accuracy (%) (higher is better), Macro-F1 (higher is better), Accuracy of Neurotism (higher is better), Accuracy of Extraversion (higher is better), Accuracy of Openness (higher is better), Accuracy of Agreeableness (higher is better), Accuracy of Conscientiousness (higher is better). Points are placed at the row's paper date; 4 of 4 rows carry one.

Results archive 2025-07-28

Archive rows end at the archive snapshot, 2025-07-28: no result published after that date is in this table. Rank is the archive's row order at that snapshot; not re-ranked here. Metric values are the archive's strings. Column headers sort the table in your browser; each row keeps its archive rank.

Paper Code Ran Syntology Report
1 BERTₛₛₑₙₑₜᶜ 67.2574.0853.2778.2155.4285.8963.48 – Paper Code 2022 linked, not harvested report
2 BERTˢ 67.2372.9350.7578.0857.9385.7663.60 – Paper Code 2022 linked, not harvested report
3 BERTᶜ 66.3272.6955.2978.0853.9080.9863.35 – Paper Code 2022 linked, not harvested report
4 BERTₛₑₙₑₜᶜ 66.0271.8953.477.7155.4281.9961.59 – Paper Code 2022 linked, not harvested report

All 4 rows shown. 4 link to a paper page on this site; 0 are marked as using additional training data in the archive. No GitHub stars are tracked; "Code" is the first repository the archive lists for the row. The archive carries no row tags, review links or community-submitted rows for this table; none are shown. archive 2025-07-28

Syntology Ran reads "N of M ran · U unverified": of the M code samples Syntology harvested from repositories linked to that row's paper (joined by arXiv id), N executed on a synthesized input and the other U = M−N are unverified (harvested, no recorded run). It counts code from repositories linked to that row's paper, not this result: the row's number was not reproduced and nothing here is a correctness claim. The other cell texts mean no graph line for the row: "linked, not harvested" (the archive links code, Syntology has not harvested it), "no code linked" (no code link in the archive), "not matched" (the row's paper URL matched no paper on this site). 0 rows have a graph line, from 0 distinct papers; 0 rows (0 papers) have at least one sample that ran. Counting each paper once: Syntology ran 0 of 0 samples; 0 unverified. Separately, 0 of those 0 are pointer-only (licence): the site points at that code rather than redistributing it, a licence property recorded for ran and unverified samples alike; each cell's tooltip carries the row's own pointer-only count. Read from the graph 2026-09-25. Per-sample status is on the paper page.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections