Semantic-based Unsupervised Framing Analysis (SUFA): A Novel Approach for Computational Framing Analysis

• URL: http://arxiv.org/abs/2505.15563v1
• Date: Wed, 21 May 2025 14:19:22 GMT
• Title: Semantic-based Unsupervised Framing Analysis (SUFA): A Novel Approach for Computational Framing Analysis
• Authors: Mohammad Ali, Naeemul Hassan,
• Abstract summary: This research presents a novel approach to computational framing analysis, called Semantic Relations-based Unsupervised Framing Analysis (SUFA)<n>SUFA leverages semantic relations and dependency parsing algorithms to identify and assess entity-centric emphasis frames in news media reports.
• Score: 1.7878880883737438
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This research presents a novel approach to computational framing analysis, called Semantic Relations-based Unsupervised Framing Analysis (SUFA). SUFA leverages semantic relations and dependency parsing algorithms to identify and assess entity-centric emphasis frames in news media reports. This innovative method is derived from two studies -- qualitative and computational -- using a dataset related to gun violence, demonstrating its potential for analyzing entity-centric emphasis frames. This article discusses SUFA's strengths, limitations, and application procedures. Overall, the SUFA approach offers a significant methodological advancement in computational framing analysis, with its broad applicability across both the social sciences and computational domains.

Related papers

• Evaluating LLM-based Agents for Multi-Turn Conversations: A Survey [64.08485471150486]
  This survey examines evaluation methods for large language model (LLM)-based agents in multi-turn conversational settings.<n>We systematically reviewed nearly 250 scholarly sources, capturing the state of the art from various venues of publication.
  arXiv  Detail & Related papers  (2025-03-28T14:08:40Z)
• Learning to Align Multi-Faceted Evaluation: A Unified and Robust Framework [61.38174427966444]
  Large Language Models (LLMs) are being used more and more extensively for automated evaluation in various scenarios.<n>Previous studies have attempted to fine-tune open-source LLMs to replicate the evaluation explanations and judgments of powerful proprietary models.<n>We propose a novel evaluation framework, ARJudge, that adaptively formulates evaluation criteria and synthesizes both text-based and code-driven analyses.
  arXiv  Detail & Related papers  (2025-02-26T06:31:45Z)
• QuaLLM: An LLM-based Framework to Extract Quantitative Insights from Online Forums [10.684484559041284]
  This study introduces QuaLLM, a novel framework to analyze and extract quantitative insights from text data on online forums.<n>We applied this framework to analyze over one million comments from two of Reddit's rideshare worker communities.<n>We uncover significant worker concerns regarding AI and algorithmic platform decisions, responding to regulatory calls about worker insights.
  arXiv  Detail & Related papers  (2024-05-08T18:20:03Z)
• Cross-domain Chinese Sentence Pattern Parsing [67.1381983012038]
  Sentence Pattern Structure (SPS) parsing is a syntactic analysis method primarily employed in language teaching. Existing SPSs rely heavily on textbook corpora for training, lacking cross-domain capability. This paper proposes an innovative approach leveraging large language models (LLMs) within a self-training framework.
  arXiv  Detail & Related papers  (2024-02-26T05:30:48Z)
• Key Design Choices in Source-Free Unsupervised Domain Adaptation: An In-depth Empirical Analysis [16.0130560365211]
  This study provides a benchmark framework for Source-Free Unsupervised Domain Adaptation (SF-UDA) in image classification. The study empirically examines a diverse set of SF-UDA techniques, assessing their consistency across datasets. It exhaustively evaluates pre-training datasets and strategies, particularly focusing on both supervised and self-supervised methods.
  arXiv  Detail & Related papers  (2024-02-25T13:37:36Z)
• BIDRN: A Method of Bidirectional Recurrent Neural Network for Sentiment Analysis [0.0]
  Deep Bidirectional Recurrent Neural Networks are used in this study to analyze sentiment. This dataset can be used to train and evaluate sentiment analysis models capable of extracting impartial opinions.
  arXiv  Detail & Related papers  (2023-11-13T12:36:53Z)
• Multimodal Relation Extraction with Cross-Modal Retrieval and Synthesis [89.04041100520881]
  This research proposes to retrieve textual and visual evidence based on the object, sentence, and whole image. We develop a novel approach to synthesize the object-level, image-level, and sentence-level information for better reasoning between the same and different modalities.
  arXiv  Detail & Related papers  (2023-05-25T15:26:13Z)
• A Decomposition-Based Approach for Evaluating and Analyzing Inter-Annotator Disagreement [1.8416014644193066]
  We propose a novel method to conceptually decompose an existing annotation into separate levels.<n>We suggest two distinct strategies in order to actualize this approach.<n>We conclude by suggesting how to extend and generalize our approach, as well as use it for other purposes.
  arXiv  Detail & Related papers  (2022-06-11T07:02:50Z)
• A Simple Information-Based Approach to Unsupervised Domain-Adaptive Aspect-Based Sentiment Analysis [58.124424775536326]
  We propose a simple but effective technique based on mutual information to extract their term. Experiment results show that our proposed method outperforms the state-of-the-art methods for cross-domain ABSA by 4.32% Micro-F1.
  arXiv  Detail & Related papers  (2022-01-29T10:18:07Z)
• Architectures of Meaning, A Systematic Corpus Analysis of NLP Systems [0.0]
  The framework is validated in the full corpus of Semeval tasks. It provides a systematic mechanism to interpret a largely dynamic and exponentially growing field.
  arXiv  Detail & Related papers  (2021-07-16T21:10:43Z)
• f-Domain-Adversarial Learning: Theory and Algorithms [82.97698406515667]
  Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain. We derive a novel generalization bound for domain adaptation that exploits a new measure of discrepancy between distributions based on a variational characterization of f-divergences.
  arXiv  Detail & Related papers  (2021-06-21T18:21:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.