A Kernel Function for Redundant Features from RDF Graphs and Its Fast Calculation-Reference-Cited by-同舟云学术

A Kernel Function for Redundant Features from RDF Graphs and Its Fast Calculation

Published:2017-01-06 Issue:1 Volume:32 Page:B-G34_1-12
ISSN:1346-0714
Container-title:Transactions of the Japanese Society for Artificial Intelligence
language:en
Short-container-title:Transactions of the Japanese Society for Artificial Intelligence

Author:

Arai Daichi¹,Kaneiwa Ken¹

Affiliation:

1. Department of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications

Publisher

Japanese Society for Artificial Intelligence

Subject

Artificial Intelligence,Software

Link

https://www.jstage.jst.go.jp/article/tjsai/32/1/32_B-G34/_pdf

Reference12 articles.

1. [Bicer 11] Bicer, V., Tran, T., and Gossen, A.: Relational Kernel Machines for Learning from Graph-Structured RDF Data, in The Semantic Web: Research and Applications, pp. 47–62, Springer (2011)

2. [Collins 01] Collins, M. and Duffy, N.: Convolution Kernels for Natural Language, in Advances in Neural Information Processing Systems, pp. 625–632 (2001)

3. [Exner 12] Exner, P. and Nugues, P.: Entity Extraction: From Unstructured Text to DBpedia RDF Triples, in The Web of Linked Entities Workshop (WoLE 2012) (2012)

4. [Fanizzi 12] Fanizzi, N., d’Amato, C., and Esposito, F.: Induction of Robust Classifiers for Web Ontologies through Kernel Machines, Web Semantics: Science, Services and Agents on the World Wide Web, Vol. 11, pp. 1–13 (2012)

5. [Girolami 02] Girolami, M.: Mercer Kernel Based Clustering in Feature Space, Neural Networks, Vol. 13, No. 3, pp. 780–784 (2002)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feature selection based on the complexity of structural patterns in RDF graphs;International Journal of Data Science and Analytics;2023-11-10