Li, Tao, Ma, Lei, Liu, Zheng ORCID: 0000-0001-7240-3501 and Liang, Kaitong (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 (4):149. pp. 1-13. ISSN 2199-8531 (Online) (doi:https://doi.org/10.3390/joitmc6040149)

Preview

PDF (VoR) 46121_LIU_ Economic_granularity_interval_in_decision_tree_algorithm_standardization_from_an_open_innovation.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	open innovation; AI standardization; edge computing; intellectual property platform
Subjects:	H Social Sciences > H Social Sciences (General) H Social Sciences > HD Industries. Land use. Labor T Technology > T Technology (General)
Faculty / School / Research Centre / Research Group:	Faculty of Business Greenwich Business School > Networks and Urban Systems Centre (NUSC) Greenwich Business School > School of Business, Operations and Strategy
Last Modified:	17 Oct 2024 16:21
URI:	http://gala.gre.ac.uk/id/eprint/46121

Actions (login required)

View Item

Downloads