paper-with-me

홈 › Papers

Hierarchical Overlapping Belief Estimation by Structured Matrix Factorization

2020-02-13 · Chaoqi Yang, Jinyang Li, Ruijie Wang, Shuochao Yao, Huajie Shao, Dongxin Liu, Shengzhong Liu, Tianshi Wang, Tarek F. Abdelzaher

Much work on social media opinion polarization focuses on a flat categorization of stances (or orthogonal beliefs) of different communities from media traces. We extend in this work in two important respects. First, we detect not only points of disagreement between communities, but also points of agreement. In other words, we estimate community beliefs in the presence of overlap. Second, in lieu of flat categorization, we consider hierarchical belief estimation, where communities might be hierarchically divided. For example, two opposing parties might disagree on core issues, but within a party, despite agreement on fundamentals, disagreement might occur on further details. We call the resulting combined problem a hierarchical overlapping belief estimation problem. To solve it, this paper develops a new class of unsupervised Non-negative Matrix Factorization (NMF) algorithms, we call Belief Structured Matrix Factorization (BSMF). Our proposed unsupervised algorithm captures both the latent belief intersections and dissimilarities, as well as a hierarchical structure. We discuss the properties of the algorithm and evaluate it on both synthetic and real-world datasets. In the synthetic dataset, our model reduces error by 40%. In real Twitter traces, it improves accuracy by around 10%. The model also achieves 96.08% self-consistency in a sanity check.

📄 PDF Abstract BibTeX arXiv:2002.05797

Code (1)

ycq091044/narrative-detection 공식 구현

Similar Papers 제목 키워드 기반

Adaptive Estimation in Structured Factor Models with Applications to Overlapping Clustering

2017-04-23 · Xin Bing, Florentina Bunea, Yang Ning, Marten Wegkamp

This work introduces a novel estimation method, called LOVE, of the entries and structure of a loading matrix A in a sparse latent factor model X = AZ + E, for an observable random vector X in Rp, with correlated unobser…

Clustering

Group-Aware Matrix Estimation and Latent Subspace Recovery

2026-05-19 · Hamza Golubovic, Matthew Shen, Genevera I. Allen, Tarek M. Zikry arxiv

Modern matrix completion problems often involve heterogeneous data whose rows simultaneously belong to many meta-categories, such as demographic and age groups in recommendation systems, or region and recording session l…

Recommendation Systems

Fast and Accurate Normal Estimation for Point Cloud via Patch Stitching

2021-03-30 · Jun Zhou, Wei Jin, Mingjie Wang, Xiuping Liu 외

This paper presents an effective normal estimation method adopting multi-patch stitching for an unstructured point cloud. The majority of learning-based approaches encode a local patch around each point of a whole model …

Retrieval

Scoring Time Intervals using Non-Hierarchical Transformer For Automatic Piano Transcription

2024-04-15 · Yujia Yan, Zhiyao Duan

The neural semi-Markov Conditional Random Field (semi-CRF) framework has demonstrated promise for event-based piano transcription. In this framework, all events (notes or pedals) are represented as closed time intervals …

Music Transcription

Generalized Conditional Gradient for Sparse Estimation

2014-10-17 · Yao-Liang Yu, Xinhua Zhang, Dale Schuurmans

Structured sparsity is an important modeling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design. In this paper we i…

Dictionary LearningMatrix CompletionMulti-class Classification