Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10892Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Blekas, K. | en |
| dc.date.accessioned | 2015-11-24T17:01:14Z | - |
| dc.date.available | 2015-11-24T17:01:14Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10892 | - |
| dc.rights | Default Licence | - |
| dc.subject | pattern discovering | en |
| dc.subject | markov random field | en |
| dc.subject | mixture of multinomials model | en |
| dc.subject | expectation-maximization (em) algorithm | en |
| dc.subject | multiple | en |
| dc.subject | algorithm | en |
| dc.subject | alignment | en |
| dc.title | Mixture model based Markov random field for discovering patterns in sequences | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | In this paper a new maximum a posteriori (MAP) approach based on mixtures of multinomials is proposed for discovering probabilistic patterns in sequences. The main advantage of the method is the ability to bypass the problem of overlapping patterns in neighboring positions of sequences by using a Markov random field (MRF) prior. This model consists of two components, the first models the pattern and the second the background. The Expectation-Maximization (EM) algorithm is used to estimate the model parameters and provides closed form updates. Special care is also taken to overcome the known dependence of the EM algorithm to initialization. This is done by applying an adaptive clustering scheme based on the k-means algorithm in order to produce good initial values for the pattern multinomial model. Experiments with artificial sets of sequences show that the proposed approach discovers qualitatively better patterns, in comparison with maximum likelihood (ML) and Gibbs sampling (GS) approaches. | en |
| heal.journalName | Advances in Artificial Intelligence, Proceedings | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| blekas-2006-A Mixture Model Based Markov Random Field for Discovering Patterns in Sequences.pdf | 443.11 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
