A weighted knowledge super network model for collaborative product innovation based on adjacency matrix

Q4 Economics, Econometrics and Finance

International Journal of Product Development Pub Date : 2021-06-30 DOI:10.1504/ijpd.2021.116155

Yanhua Wang, Fang Zhang

{"title":"A weighted knowledge super network model for collaborative product innovation based on adjacency matrix","authors":"Yanhua Wang, Fang Zhang","doi":"10.1504/ijpd.2021.116155","DOIUrl":null,"url":null,"abstract":"Aiming at the problems existing in traditional methods such as poor destructibility, low knowledge processing capacity and easy loss of product innovation weighted knowledge, a collaborative product innovation weighted knowledge hypernetwork model based on adjacency matrix was designed. A knowledge sharing network model is established, which is used to transform product design tasks and form multiple sub-tasks. Acquire knowledge points and carry out network modelling, acquire the membership relationship between knowledge points, design individual knowledge subgraphs, and represent different knowledge subgraphs through adjacency matrix. The hypernetwork model is constructed, and the model is used to calculate knowledge points and relevant weights of knowledge, and the knowledge fusion is realised based on the calculation results, so as to realise the construction of knowledge hypernetwork model. The results show the maximum destruction resistance coefficient of the model is about 0.8, and the maximum product innovation weighted knowledge loss rate is only 15.2%.","PeriodicalId":14273,"journal":{"name":"International Journal of Product Development","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Product Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijpd.2021.116155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Economics, Econometrics and Finance","Score":null,"Total":0}

引用次数: 0

Abstract

Aiming at the problems existing in traditional methods such as poor destructibility, low knowledge processing capacity and easy loss of product innovation weighted knowledge, a collaborative product innovation weighted knowledge hypernetwork model based on adjacency matrix was designed. A knowledge sharing network model is established, which is used to transform product design tasks and form multiple sub-tasks. Acquire knowledge points and carry out network modelling, acquire the membership relationship between knowledge points, design individual knowledge subgraphs, and represent different knowledge subgraphs through adjacency matrix. The hypernetwork model is constructed, and the model is used to calculate knowledge points and relevant weights of knowledge, and the knowledge fusion is realised based on the calculation results, so as to realise the construction of knowledge hypernetwork model. The results show the maximum destruction resistance coefficient of the model is about 0.8, and the maximum product innovation weighted knowledge loss rate is only 15.2%.

查看原文本刊更多论文

基于邻接矩阵的协同产品创新加权知识超网络模型

针对传统方法存在的破坏性差、知识处理能力低、产品创新加权知识容易丢失等问题，设计了一种基于邻接矩阵的协同产品创新加权的知识超网络模型。建立了知识共享网络模型，用于转换产品设计任务，形成多个子任务。获取知识点并进行网络建模，获取知识点之间的隶属关系，设计个体知识子图，并通过邻接矩阵表示不同的知识子图。构建了超网络模型，利用该模型计算知识点和知识的相关权重，并根据计算结果实现知识融合，从而实现知识超网络模型的构建。结果表明，该模型的最大抗破坏系数约为0.8，产品创新加权知识损失率最大仅为15.2%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Product Development Economics, Econometrics and Finance-Economics and Econometrics

CiteScore

0.50

自引率

0.00%

发文量

期刊介绍： IJPD is a refereed international journal providing an authoritative source of information in the field of product development and innovation. It is devoted to the development, promotion and coordination of the science and practice of this field.