cd /news/machine-learning/detection-of-self-introductions-in-l… · home topics machine-learning article
[ARTICLE · art-91395] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=· neutral

Detection of Self-Introductions in Legislative Testimony

Researchers at an unnamed institution developed a machine-learning pipeline to detect self-introductions in legislative committee testimony, using a dataset of 1.54 million utterances from five state legislative sessions. The best-performing model, a BERT-augmented XGBoost classifier, achieved an F1 score of 0.9782, reducing test errors from 241 to 207 compared to standard XGBoost. The pipeline, detailed in a paper on arXiv (2608.07891v1), aims to aid speaker identification in government meetings.

read1 min views1 publishedAug 11, 2026

arXiv:2608.07891v1 Announce Type: new Abstract: Self-introductions are common in legislative committee testimonies. Successfully detecting them and extracting the speaker's name is enormously helpful in the task of speaker identification in the context of government meetings. In this paper, we present a pipeline for detection of self-introductions in legislative committee testimony using machine learning. We construct a training dataset from 1.54 million utterances spanning five state legislative sessions, apply a name-matching heuristic to generate automatic labels, and train three classifiers: a decision tree, random forest, and XGBoost to find self-introductions and extract the speaker's name. We construct a feature set combining bag-of-words, positional context, structural signals, introductory phrase indicators, and discourse context features. Among the three classifiers, XGBoost achieves the best performance with an F1 score of 0.9747 and the fewest total errors; adding fine-tuned BERT probability features improves this further. As an extension, we score the full candidate dataset with a fine-tuned BERT classifier and add BERT probability outputs as features. This BERT-augmented XGBoost model improves F1 from 0.9747 to 0.9782 and reduces total test errors from 241 to 207. The primary gain over the decision tree baseline (F1 0.9323) is driven by discourse context features and the boosting ensemble strategy; BERT provides a modest complementary signal. Analysis of false positives reveals that a minority are genuine self-introductions mislabeled due to name inconsistencies in the source data, indicating that measured metrics modestly understate true performance.

── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/detection-of-self-in…] indexed:0 read:1min 2026-08-11 ·