SciELO - Scientific Electronic Library Online

 
vol.22 issue4Semi Supervised Graph Based Keyword Extraction Using Lexical Chains and Centrality MeasuresConstruction of Paraphrase Graphs as a Means of News Clusters Extraction author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

On-line version ISSN 2007-9737Print version ISSN 1405-5546

Abstract

VU, Tu; BUI, Xuan; THAN, Khoat  and  ICHISE, Ryutaro. A Flexible Stochastic Method for Solving the MAP Problem in Topic Models. Comp. y Sist. [online]. 2018, vol.22, n.4, pp.1317-1327.  Epub Feb 10, 2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-22-4-3078.

The estimation of the posterior distribution is the core problem in topic models, unfortunately it is intractable. There are approximation and sampling methods proposed to solve it. However, most of them do not have any clear theoretical guarantee of neither quality nor rate of convergence. Online Maximum a Posteriori Estimation (OPE) is another approach with concise guarantee on quality and convergence rate, in which we cast the estimation of the posterior distribution into a non-convex optimization problem. In this paper, we propose a more general and flexible version of OPE, namely Generalized Online Maximum a Posteriori Estimation (G-OPE), which not only enhances the flexibility of OPE in different real-world situations but also preserves key advantage theoretical characteristics of OPE when comparing to the state-of-the-art methods. We employ G-OPE as inference a document within large text corpora. The experimental and theoretical results show that our new approach performs better than OPE and other state-of-the-art methods.

Keywords : Topic models; posterior inference; online MAP estimation; large-scale learning; non-convex optimization.

        · text in English     · English ( pdf )