首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:RDFグラフの冗長な特徴表現に対するカーネル関数とその高速計算
  • 本地全文:下载
  • 作者:荒井 大地 ; 兼岩 憲
  • 期刊名称:人工知能学会論文誌
  • 印刷版ISSN:1346-0714
  • 电子版ISSN:1346-8030
  • 出版年度:2017
  • 卷号:32
  • 期号:1
  • 页码:B-G34_1-12
  • DOI:10.1527/tjsai.B-G34
  • 出版社:The Japanese Society for Artificial Intelligence
  • 摘要:

    Machine learning on RDF data has become important in the field of the Semantic Web. However, RDF graph structures are redundantly represented by noisy and incomplete data on theWeb. In order to apply SVMs to such RDF data, we propose a kernel function to compute the similarity between resources on RDF graphs. This kernel function is defined by selected features on RDF paths that eliminate the redundancy on RDF graphs with information gain ratio filtering. Kernel functions are a very flexible framework and cannot be applied to only SVMs but also principal component analysis, canonical correlation analysis, clustering and so on. However, the calculation of the proposed kernel function requires high costs for time and memory due to the exponential increase of features in RDF graphs. Therefore, we propose an efficient algorithm that calculates the kernel for redundant features from RDF graphs. Our experiments show the performance of the proposed kernel with SVMs on classification tasks for RDF resources and the advantages over existing kernels.

  • 关键词:machine learning;RDF;kernel;information gain ratio;SVM
国家哲学社会科学文献中心版权所有