Concept learning algorithm for semantic web based on the automatically searched refinement condition

Dongkyu Jeon, Wooju Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Today, the web is the huge data repository which contains excessively growing with uncountable size of data. From the view point of data, Semantic Web is the advanced version of World Wide Web, which aims machine understandable web based on the structured data. For the advent of Semantic Web, its data has been rapidly increased with various areas. In this paper, we proposed novel decision tree algorithm, which called Semantic Decision Tree, to learning the covered knowledge beyond the Semantic Web based ontology. For this purpose, we newly defined six different refinements based on the description logic constructors. Refinements are replaced the features of traditional decision tree algorithms, and these refinements are automatically searched by our proposed decision tree algorithm based on the structure information of ontology. Additional information from the ontology is also used to enhance the quality of decision tree results. Finally, we test our algorithm by solving the famous rule induction problems, and we can get perfect answers with useful decision tree results. In addition, we expect that our proposed algorithm has strong advantage to learn decision tree algorithm on complex and huge size of ontology.

Original languageEnglish
Title of host publicationSemantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers
PublisherSpringer Verlag
Pages414-428
Number of pages15
ISBN (Print)9783319068251
DOIs
Publication statusPublished - 2014 Jan 1
Event3rd Joint International Semantic Technology Conference, JIST 2013 - Seoul, Korea, Republic of
Duration: 2013 Nov 282013 Nov 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8388 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Joint International Semantic Technology Conference, JIST 2013
CountryKorea, Republic of
CitySeoul
Period13/11/2813/11/30

Fingerprint

Concept Learning
Semantic Web
Decision trees
Decision tree
Web-based
Learning algorithms
Learning Algorithm
Refinement
Tree Algorithms
Ontology
World Wide Web
Rule Induction
Information Structure
Description Logics
Uncountable
Repository
Semantics

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jeon, D., & Kim, W. (2014). Concept learning algorithm for semantic web based on the automatically searched refinement condition. In Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers (pp. 414-428). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8388 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-06826-8_30
Jeon, Dongkyu ; Kim, Wooju. / Concept learning algorithm for semantic web based on the automatically searched refinement condition. Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers. Springer Verlag, 2014. pp. 414-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{056cb1ee3cea457b9975e7b5321aa28e,
title = "Concept learning algorithm for semantic web based on the automatically searched refinement condition",
abstract = "Today, the web is the huge data repository which contains excessively growing with uncountable size of data. From the view point of data, Semantic Web is the advanced version of World Wide Web, which aims machine understandable web based on the structured data. For the advent of Semantic Web, its data has been rapidly increased with various areas. In this paper, we proposed novel decision tree algorithm, which called Semantic Decision Tree, to learning the covered knowledge beyond the Semantic Web based ontology. For this purpose, we newly defined six different refinements based on the description logic constructors. Refinements are replaced the features of traditional decision tree algorithms, and these refinements are automatically searched by our proposed decision tree algorithm based on the structure information of ontology. Additional information from the ontology is also used to enhance the quality of decision tree results. Finally, we test our algorithm by solving the famous rule induction problems, and we can get perfect answers with useful decision tree results. In addition, we expect that our proposed algorithm has strong advantage to learn decision tree algorithm on complex and huge size of ontology.",
author = "Dongkyu Jeon and Wooju Kim",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-06826-8_30",
language = "English",
isbn = "9783319068251",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "414--428",
booktitle = "Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers",
address = "Germany",

}

Jeon, D & Kim, W 2014, Concept learning algorithm for semantic web based on the automatically searched refinement condition. in Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8388 LNCS, Springer Verlag, pp. 414-428, 3rd Joint International Semantic Technology Conference, JIST 2013, Seoul, Korea, Republic of, 13/11/28. https://doi.org/10.1007/978-3-319-06826-8_30

Concept learning algorithm for semantic web based on the automatically searched refinement condition. / Jeon, Dongkyu; Kim, Wooju.

Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers. Springer Verlag, 2014. p. 414-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8388 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Concept learning algorithm for semantic web based on the automatically searched refinement condition

AU - Jeon, Dongkyu

AU - Kim, Wooju

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Today, the web is the huge data repository which contains excessively growing with uncountable size of data. From the view point of data, Semantic Web is the advanced version of World Wide Web, which aims machine understandable web based on the structured data. For the advent of Semantic Web, its data has been rapidly increased with various areas. In this paper, we proposed novel decision tree algorithm, which called Semantic Decision Tree, to learning the covered knowledge beyond the Semantic Web based ontology. For this purpose, we newly defined six different refinements based on the description logic constructors. Refinements are replaced the features of traditional decision tree algorithms, and these refinements are automatically searched by our proposed decision tree algorithm based on the structure information of ontology. Additional information from the ontology is also used to enhance the quality of decision tree results. Finally, we test our algorithm by solving the famous rule induction problems, and we can get perfect answers with useful decision tree results. In addition, we expect that our proposed algorithm has strong advantage to learn decision tree algorithm on complex and huge size of ontology.

AB - Today, the web is the huge data repository which contains excessively growing with uncountable size of data. From the view point of data, Semantic Web is the advanced version of World Wide Web, which aims machine understandable web based on the structured data. For the advent of Semantic Web, its data has been rapidly increased with various areas. In this paper, we proposed novel decision tree algorithm, which called Semantic Decision Tree, to learning the covered knowledge beyond the Semantic Web based ontology. For this purpose, we newly defined six different refinements based on the description logic constructors. Refinements are replaced the features of traditional decision tree algorithms, and these refinements are automatically searched by our proposed decision tree algorithm based on the structure information of ontology. Additional information from the ontology is also used to enhance the quality of decision tree results. Finally, we test our algorithm by solving the famous rule induction problems, and we can get perfect answers with useful decision tree results. In addition, we expect that our proposed algorithm has strong advantage to learn decision tree algorithm on complex and huge size of ontology.

UR - http://www.scopus.com/inward/record.url?scp=84902601874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902601874&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-06826-8_30

DO - 10.1007/978-3-319-06826-8_30

M3 - Conference contribution

AN - SCOPUS:84902601874

SN - 9783319068251

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 414

EP - 428

BT - Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers

PB - Springer Verlag

ER -

Jeon D, Kim W. Concept learning algorithm for semantic web based on the automatically searched refinement condition. In Semantic Technology - Third Joint International Conference, JIST 2013, Revised Selected Papers. Springer Verlag. 2014. p. 414-428. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-06826-8_30