期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Data-driven Product Functional Confguration:Patent Data and Hypergraph 被引量:3
1
作者 Wenguang Lin Xiaodong Liu Renbin Xiao 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2022年第4期108-124,共17页
The product functional confguration(PFC)is typically used by frms to satisfy the individual requirements of customers and is realized based on market analysis.This study aims to help frms analyze functions and realize... The product functional confguration(PFC)is typically used by frms to satisfy the individual requirements of customers and is realized based on market analysis.This study aims to help frms analyze functions and realize functional confgurations using patent data.This study frst proposes a patent-data-driven PFC method based on a hypergraph network.It then constructs a weighted network model to optimize the combination of product function quantity and object from the perspective of big data,as follows:(1)The functional knowledge contained in the patent is extracted.(2)The functional hypergraph is constructed based on the co-occurrence relationship between patents and applicants.(3)The function and patent weight are calculated from the patent applicant’s perspective and patent value.(4)A weight calculation model of the PFC is developed.(5)The weighted frequent subgraph algorithm is used to obtain the optimal function combination list.This method is applied to an innovative design process of a bathroom shower.The results indicate that this method can help frms detach optimal function candidates and develop a multifunctional product. 展开更多
关键词 HYPERGRAPH Functional confguration Patent analysis Weighted frequent subgraph algorithm
在线阅读 下载PDF
A method for improving graph queries processing using positional inverted index (P.I.I) idea in search engines and parallelization techniques 被引量:2
2
作者 Hamed Dinari Hassan Naderi 《Journal of Central South University》 SCIE EI CAS CSCD 2016年第1期150-159,共10页
The idea of positional inverted index is exploited for indexing of graph database. The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer s... The idea of positional inverted index is exploited for indexing of graph database. The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer set. These tables are implemented using column-based techniques and are used to store graphs of database, frequent sub-graphs and the neighborhood of nodes. In order to exact checking of remaining graphs, the vertex invariant is used for isomorphism test which can be parallel implemented. The results of evaluation indicate that proposed method outperforms existing methods. 展开更多
关键词 graph query processing frequent subgraph graph mining data mining positional inverted index
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部