Research of Semantic Considered Tree Mining Method for an Intelligent Knowledge-Services Platform
2020, 25(5), pp.27-36
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
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.
-
[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 / 10.31209/2019.100000140.
[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 / 10.1109/TKDE.2005.125
[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 / 10.24297/ijct.v3i1c.2775
[journal] Fengying Li / 2020 / Optimal Representation of Large-Scale Graph Data Based on Grid Clustering and K2-Tree / Mathematical Problems in Engineering 2020 / 10.1155/2020/2354875.
[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
-
KCI Citation (0)
89 Viewed
Print this page
Download PDF