首页    期刊浏览 2024年09月18日 星期三
登录注册

文章基本信息

  • 标题:Discovering Relevance-Dependent Bicluster Structure from Relational Data: A Model and Algorithm
  • 作者:Iku Ohama ; Takuya Kida ; Hiroki Arimura
  • 期刊名称:人工知能学会論文誌
  • 印刷版ISSN:1346-0714
  • 电子版ISSN:1346-8030
  • 出版年度:2018
  • 卷号:33
  • 期号:6
  • 页码:B-I46_1-10
  • DOI:10.1527/tjsai.B-I46
  • 语种:English
  • 出版社:The Japanese Society for Artificial Intelligence
  • 摘要:

    We propose a statistical model for relevance-dependent biclustering to analyze relational data. The proposed model factorizes relational data into bicluster structure with two features: (1) each object in a cluster has a relevance value, which indicates how strongly the object relates to the cluster and (2) all clusters are related to at least one dense block. These features simplify the task of understanding the meaning of each cluster because only a few highly relevant objects need to be inspected. We introduced the Relevance-Dependent Bernoulli Distribution (R-BD) as a prior for relevance-dependent binary matrices and proposed the novel Relevance-Dependent Infinite Biclustering (R-IB) model, which automatically estimates the number of clusters. Posterior inference can be performed efficiently using a collapsed Gibbs sampler because the parameters of the R-IB model can be fully marginalized out. Experimental results show that the R-IB extracts more essential bicluster structure with better computational efficiency than conventional models. We further observed that the biclustering results obtained by R-IB facilitate interpretation of the meaning of each cluster.

  • 关键词:relational data;biclustering;relevance-dependency
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有