Economic Granularity Interval in Decision Tree Algorithm Standardization from an Open Innovation Perspective: Towards a Platform for Sustainable Matching
MetadataDangos cofnod eitem llawn
In the context of the application of artificial intelligence in an intellectual property trading platform, the number of demanders and suppliers that exchange scarce resources is growing continuously. Improvement of computational power promotes matching efficiency significantly. It is necessary to greatly reduce energy consumption in order to realize the machine learning process in terminals and microprocessors in edge computing (smart phones, wearable devices, automobiles, IoT devices, etc.) and reduce the resource burden of data centers. Machine learning algorithms generated in an open community lack standardization in practice, and hence require open innovation participation to reduce computing cost, shorten algorithm running time, and improve human-machine collaborative competitiveness. The purpose of this study was to find an economic range of the granularity in a decision tree, a popular machine learning algorithm. This work addresses the research questions of what the economic tree depth interval is and what the corresponding time cost is with increasing granularity given the number of matches. This study also aimed to balance the efficiency and cost via simulation. Results show that the benefit of decreasing the tree search depth brought by the increased evaluation granularity is not linear, which means that, in a given number of candidate matches, the granularity has a definite and relatively economical range. The selection of specific evaluation granularity in this range can obtain a smaller tree depth and avoid the occurrence of low efficiency, which is the excessive increase in the time cost. Hence, the standardization of an AI algorithm is applicable to edge computing scenarios, such as an intellectual property trading platform. The economic granularity interval can not only save computing resource costs but also save AI decision-making time and avoid human decision-maker time cost.
Journal of Open Innovation: Technology, Market, and Complexity;
Li, T.; Ma, L.; Liu, Z.; Liang, K. (2020) 'Economic Granularity Interval in Decision Tree Algorithm Standardization from an Open Innovation Perspective: Towards a Platform for Sustainable Matching', Journal of Open Innovation: Technology, Market, and Complexity 6, 149. https://doi.org/10.3390/joitmc6040149
Dynodwr Gwrthrych Digidol (DOI)https://doi.org/10.3390/joitmc6040149
Article published in Journal of Open Innovation: Technology, Market, and Complexity
Cardiff Metropolitan University (Grant ID: Cardiff Metropolian (Internal))
Yn dangos eitemau sy’n perthyn drwy deitl, awdur, pwnc a chrynodeb.
Laksari, Hafsa (Cardiff Metropolitan University, 2018-07)This research has been conducted to gain an insight into the world of computational tools that map genomes. Mapping genomes to the correct reference genomes, allows professionals to give an accurate diagnostic of any ...
Erabadda, Buddhiprabha; Mallikarachchi, Thanuja; Kulupana, Gosala; Fernando, Anil (IEEE, 2020-08-03)The hierarchical quadtree partitioning of Coding Tree Units (CTU) is one of the striking features in HEVC that contributes towards its superior coding performance over its predecessors. However, the brute force evaluation ...
Hassan, Mohammed (Cardiff Metropolitan University, 2017-04)The of topic this dissertation explores different areas of research in the fields of software engineering, computer science, biology and bio-chemistry. The purpose of this research will contribute to creating the design ...