paper-with-me

홈 › Papers

Formal Context Generation using Dirichlet Distributions

2018-09-28 · Maximilian Felde, Tom Hanika

We suggest an improved way to randomly generate formal contexts based on Dirichlet distributions. For this purpose we investigate the predominant way to generate formal contexts, a coin-tossing model, recapitulate some of its shortcomings and examine its stochastic model. Building up on this we propose our Dirichlet model and develop an algorithm employing this idea. By comparing our generation model to a coin-tossing model we show that our approach is a significant improvement with respect to the variety of contexts generated. Finally, we outline a possible application in null model generation for formal contexts.

📄 PDF Abstract BibTeX arXiv:1809.11160

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dirichlet Flow Matching with Applications to DNA Sequence Design

2024-02-08 · Hannes Stark, Bowen Jing, Chenyu Wang, Gabriele Corso 외

Discrete diffusion or flow models could enable faster and more controllable sequence generation than autoregressive models. We show that na\"ive linear flow matching on the simplex is insufficient toward this goal since …

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

Small-Variance Asymptotics for Exponential Family Dirichlet Process Mixture Models

2012-12-01 · NeurIPS 2012 12 · Ke Jiang, Brian Kulis, Michael. I. Jordan

Links between probabilistic and non-probabilistic learning algorithms can arise by performing small-variance asymptotics, i.e., letting the variance of particular distributions in a graphical model go to zero. For instan…

Clustering

Advances in Using Grammars with Latent Annotations for Discontinuous Parsing

2020-07-01 · WS 2020 7 · Kilian Gebhardt

We present new experiments that transfer techniques from Probabilistic Context-free Grammars with Latent Annotations (PCFG-LA) to two grammar formalisms for discontinuous parsing: linear context-free rewriting systems an…

Sharper Perturbed-Kullback-Leibler Exponential Tail Bounds for Beta and Dirichlet Distributions

2025-08-11 · Pierre Perrault arxiv

This paper presents an improved exponential tail bound for Beta distributions, refining a result in [15]. This improvement is achieved by interpreting their bound as a regular Kullback-Leibler (KL) divergence one, while …