paper-with-me

홈 › Papers

Centroid estimation based on symmetric KL divergence for Multinomial text classification problem

2018-08-29 · Jiangning Chen, Heinrich Matzinger, Haoyan Zhai, Mi Zhou

We define a new method to estimate centroid for text classification based on the symmetric KL-divergence between the distribution of words in training documents and their class centroids. Experiments on several standard data sets indicate that the new method achieves substantial improvements over the traditional classifiers.

📄 PDF Abstract BibTeX arXiv:1808.10261

Code (0)

등록된 구현이 없습니다.

Tasks

General Classificationtext-classificationText Classification

Similar Papers 제목 키워드 기반

On the symmetrical Kullback-Leibler Jeffreys centroids

2013-03-29 · Frank Nielsen

Due to the success of the bag-of-word modeling paradigm, clustering histograms has become an important ingredient of modern information processing. Clustering histograms can be performed using the celebrated $k$-means ce…

Clustering

On Hölder projective divergences

2017-01-14 · Frank Nielsen, Ke Sun, Stéphane Marchand-Maillet

We describe a framework to build distances by measuring the tightness of inequalities, and introduce the notion of proper statistical divergences and improper pseudo-divergences. We then consider the H\"older ordinary an…

Clustering

Fast Maximum Likelihood Estimation and Supervised Classification for the Beta-Liouville Multinomial

2020-06-12 · Steven Michael Lakin, Zaid Abdo

The multinomial and related distributions have long been used to model categorical, count-based data in fields ranging from bioinformatics to natural language processing. Commonly utilized variants include the standard m…

ClassificationComputational EfficiencyGeneral Classificationparameter estimation

Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming

2016-12-07 · Marco F. Cusumano-Towner, Vikash K. Mansinghka

A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Me…

Probabilistic Programming

Bregman Centroid Guided Cross-Entropy Method

2025-06-02 · Yuliang Gu, Hongpeng Cao, Marco Caccamo, Naira Hovakimyan

The Cross-Entropy Method (CEM) is a widely adopted trajectory optimizer in model-based reinforcement learning (MBRL), but its unimodal sampling strategy often leads to premature convergence in multimodal landscapes. In t…

DiversityModel-based Reinforcement Learning