Mixture Models from Multiresolution 0-1 Data

被引:0
|
作者
Adhikari, Prem Raj [1 ]
Hollmen, Jaakko
机构
[1] Aalto Univ Sch Sci, HIIT, POB 15400, FI-00076 Espoo, Finland
来源
DISCOVERY SCIENCE | 2013年 / 8140卷
关键词
Multiresolution data; Mixture Models; Bayesian Networks;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiresolution data has received considerable research interest due to the practical usefulness in combining datasets in different resolutions into a single analysis. Most models and methods can only model a single data resolution, that is, vectors of the same dimensionality, at a time. This is also true for mixture models, the model of interest. In this paper, we propose a multiresolution mixture model capable of modeling data in multiple resolutions. Firstly, we define the multiresolution component distributions of mixture models from the domain ontology. We then learn the parameters of the component distributions in the Bayesian network framework. Secondly, we map the multiresolution data in a Bayesian network setting to a vector representation to learn the mixture coefficients and the parameters of the component distributions. We investigate our proposed algorithms on two data sets. A simulated data allows us to have full data observations in all resolutions. However, this is unrealistic in all practical applications. The second data consists of DNA aberrations data in two resolutions. The results with multiresolution models show improvement in modeling performance with regards to the likelihood over single resolution mixture models.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 50 条
  • [1] Preservation of Statistically Significant Patterns in Multiresolution 0-1 Data
    Adhikari, Prem Raj
    Hollmen, Jaakko
    PATTERN RECOGNITION IN BIOINFORMATICS, 2010, 6282 : 86 - 97
  • [2] Mixture models and frequent sets:: combining global and local methods for 0-1 data
    Hollmén, J
    Seppänen, JK
    Mannila, H
    PROCEEDINGS OF THE THIRD SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2003, : 289 - 293
  • [3] Finding trees from unordered 0-1 data
    Heikinheimo, Hannes
    Mannila, Heikki
    Seppanen, Jouni K.
    KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2006, PROCEEDINGS, 2006, 4213 : 175 - 186
  • [4] Permutation Structure in 0-1 Data
    Mannila, Heikki
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT I, 2011, 6911 : 7 - 7
  • [5] Geometric and combinatorial tiles in 0-1 data
    Gionis, A
    Mannila, H
    Seppänen, JK
    KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2004, PROCEEDINGS, 2004, 3202 : 173 - 184
  • [6] The 0-1 knapsack problem with fuzzy data
    Adam Kasperski
    Michał Kulej
    Fuzzy Optimization and Decision Making, 2007, 6 : 163 - 172
  • [7] The 0-1 knapsack problem with fuzzy data
    Kasperski, Adam
    Kulej, Michal
    FUZZY OPTIMIZATION AND DECISION MAKING, 2007, 6 (02) : 163 - 172
  • [8] How effective is aggregation for solving 0-1 models?
    Khurana, Archana
    Murty, Katta
    OPSEARCH, 2012, 49 (01) : 78 - 85
  • [9] On the 0-1 matrices whose squares are 0-1 matrices
    Wu, Honglin
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 432 (11) : 2909 - 2924
  • [10] Factorisation and denoising of 0-1 data:: A variational approach
    Kaban, Ata
    Bingham, Ella
    NEUROCOMPUTING, 2008, 71 (10-12) : 2291 - 2308