Research of Semantic Considered Tree Mining Method for an Intelligent Knowledge-Services Platform (지능형 지식서비스 플랫폼을 위한 의미 기반 트리 마이닝 연구)

Juryon Paik (백주련)

doi:10.9708/jksci.2020.25.05.027

Research of Semantic Considered Tree Mining Method for an Intelligent Knowledge-Services Platform

Journal of The Korea Society of Computer and Information
Abbr : JKSCI
2020, 25(5), pp.27-36
DOI : 10.9708/jksci.2020.25.05.027
Publisher : The Korean Society Of Computer And Information
Research Area : Engineering > Computer Science
Received : April 22, 2020
Accepted : May 20, 2020
Published : May 29, 2020

Juryon Paik ¹

¹평택대학교

Accredited

ABSTRACT

In this paper, we propose a method to derive valuable but hidden infromation from the data which is the core foundation in the 4th Industrial Revolution to pursue knowledge-based service fusion. The hyper-connected societies characterized by IoT inevitably produce big data, and with the data in order to derive optimal services for trouble situations it is first processed by discovering valuable information. A data-centric IoT platform is a platform to collect, store, manage, and integrate the data from variable devices, which is actually a type of middleware platforms. Its purpose is to provide suitable solutions for challenged problems after processing and analyzing the data, that depends on efficient and accurate algorithms performing the work of data analysis. To this end, we propose specially designed structures to store IoT data without losing the semantics and provide algorithms to discover the useful information with several definitions and proofs to show the soundness.

KEYWORDS

Knowledge-based platform, Unstructured data, Tree data, Bits representation, Binary code, Pairsets

Citation status

* References for papers published after 2023 are currently being built.

[journal] Jae-Ho Kim / 2013 / IoT Platform Technology Trends and Developments / Information and Communications Magazine 30(8) : 29~35

[confproc] Teik-Boon Tan / 2018 / Software Testing Levels in Internet of Things (IoT) Architecture / 23rd International Computer Symposium, ICS 2018, Communications in Computer and Information Science 1013 : 385~390

[thesis] Yu Liu / 2019 / A Data-centric Internet of Things Framework Based on Public Cloud / Linköping University

[journal] Juryon Paik / 2019 / Weighted or Non-Weighted Negative Tree Pattern Discovery from Sensor-Rich Environments / Intelligent Automation and Soft Computing / Computers, Materials and Continua (Tech Science Press) 26(1) : 193~204

[journal] Y. Chi / 2004 / Frequent Subtree Mining – an Overview / Fundamental Informaticae 66(1-2) : 161~198

[journal] M.J. Zaki / 2005 / Efficiently mining frequent trees in a forest: algorithms and applications / IEEE Transactions on Knowledge and Data Engineering / Institute of Electrical and Electronics Engineers (IEEE) 17(8) : 1021~1035

[journal] J. Paik / 2014 / Method for Extracting Valuable Common Structures from Heterogeneous Rooted and Labeled Tree Data / J. of Information Science and Engineering 30(3) : 787~817

[confproc] A. Inokuchi / 2000 / An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data / Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, LNCS 1920 : 13~23

[confproc] M. Kuramochi / 2001 / Frequent Subgraph Discovery / Proceedings of IEEE International Conference on Data Mining : 313~320

[journal] Harmanjit Singh / 2012 / Role of Adjacency Matrix & Adjacency List in Graph Theory / INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY / CIRWOLRD 3(1) : 179~183

[journal] Fengying Li / 2020 / Optimal Representation of Large-Scale Graph Data Based on Grid Clustering and K2-Tree / Mathematical Problems in Engineering 2020

[confproc] T. Miyahara / 2002 / Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents / Proceedings of the 6th Pacific-Asia Conference of Advances in Knowledge Discovery and Data Mining, LNCS 2336 : 341~355

[confproc] Kunihiko Sadakane / 2010 / Fully-Functional Succinct Trees / Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 : 134~149

[confproc] Reuven Cohen / 2005 / Labeling Schemes for Tree Representation / 7th International Workshop on Distributed Computing IWDC 2005, LNCS 3741 : 13~24

[journal] J. Paik / 2009 / Fast Extraction of Maximal Frequent Subtrees Using Bits Representation / J. of Information Science and Engineering 25(2) : 435~464

This paper was written with support from the National Research Foundation of Korea.

KJCKorea
Journal Central

Journal of The Korea Society of Computer and Information 2023 KCI Impact Factor : 0.65

Research of Semantic Considered Tree Mining Method for an Intelligent Knowledge-Services Platform

ABSTRACT

KEYWORDS

Citation status

* References for papers published after 2023 are currently being built.

Journal of The Korea Society of Computer and Information 2023 KCI Impact Factor : 0.65

Research of Semantic Considered Tree Mining Method for an Intelligent Knowledge-Services Platform

ABSTRACT

KEYWORDS

Statistics

Tools

Issue List

Citation status

KCI Citation Counts (0)

REFERENCES (15) * References for papers published after 2023 are currently being built.

Search PDF

Citation

* References for papers published after 2023 are currently being built.