Beta-CoRM: A Bayesian approach for n-gram profiles analysis

n -gram profiles have been successfully and widely used to analyse long sequences of potentially differing lengths for clustering or classification. Mainly, machine learning algorithms have been used for this purpose but, despite their predictive performance, these methods cannot discover hidden structures or provide a full probabilistic representation of the data. A novel class of Bayesian generative models designed for n -gram profiles used as binary attributes have been designed to address this. The flexibility of the proposed modelling allows to consider a straightforward approach to feature selection in the generative model. Furthermore, a slice sampling algorithm is derived for a fast inferential procedure, which is applied to synthetic and real data scenarios and shows that feature selection can improve classification accuracy. • We develop a feature allocation model for grouped data with binary attributes and demonstrate its use on n-gram data. • Show how the model can be estimated using a simple, exact Markov chain Monte Carlo method. • Introduce a post-hoc variable selection step which finds variable that maximally discriminate among groups. • The variable selection method leads to better out-of-sample classification accuracy in simulated and real data.

Authors

Institutions

Publication Details

Journal
Computational Statistics & Data Analysis
Published
2024-09-10
DOI
https://doi.org/10.1016/j.csda.2024.108056
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Beta-CoRM: A Bayesian approach for n-gram profiles analysis

Cristiano Villa, Jim E. Griffin, José A. Perusquía
Computational Statistics & Data Analysis
Natural Language Processing Techniques
article

Beta-CoRM: A Bayesian approach for n-gram profiles analysis

Cristiano Villa, Jim E. Griffin, José A. Perusquía
article en

Abstract

n -gram profiles have been successfully and widely used to analyse long sequences of potentially differing lengths for clustering or classification. Mainly, machine learning algorithms have been used for this purpose but, despite their predictive performance, these methods cannot discover hidden structures or provide a full probabilistic representation of the data. A novel class of Bayesian generative models designed for n -gram profiles used as binary attributes have been designed to address this. The flexibility of the proposed modelling allows to consider a straightforward approach to feature selection in the generative model. Furthermore, a slice sampling algorithm is derived for a fast inferential procedure, which is applied to synthetic and real data scenarios and shows that feature selection can improve classification accuracy. • We develop a feature allocation model for grouped data with binary attributes and demonstrate its use on n-gram data. • Show how the model can be estimated using a simple, exact Markov chain Monte Carlo method. • Introduce a post-hoc variable selection step which finds variable that maximally discriminate among groups. • The variable selection method leads to better out-of-sample classification accuracy in simulated and real data.

Computational Statistics & Data AnalysisVol. 202
Duke Kunshan University (CN), University College London (GB), Newcastle University (GB), Universidad Nacional Autónoma de México (MX)
Gaming Technologies Association, University of Kent
Openalex Percentile: Top 87%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.