Xiangli Qu, Xiwei Feng, Y. Zhang, Siyuan Wang, Lei Sun, Pengcheng Hua, Yujie Wang
{"title":"Research on Component Retrieval and Matching Methods","authors":"Xiangli Qu, Xiwei Feng, Y. Zhang, Siyuan Wang, Lei Sun, Pengcheng Hua, Yujie Wang","doi":"10.1109/scset55041.2022.00087","DOIUrl":null,"url":null,"abstract":"Aiming at how to quickly retrieve the target component from the huge component library, this paper proposes a component retrieval method based on facet classification, which uses component keyword set to facet description of the component and constructs the component vectorized model. The idea of layering is adopted to divide the components in detail. The K-means clustering algorithm based on the maximum and minimum distances is used to cluster the components, so that the problem of component matching is transformed into the calculation of the cosine similarity of component vectors. This method can narrow down the search scope and effectively improve the search efficiency.","PeriodicalId":446933,"journal":{"name":"2022 International Seminar on Computer Science and Engineering Technology (SCSET)","volume":"8 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Seminar on Computer Science and Engineering Technology (SCSET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/scset55041.2022.00087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Aiming at how to quickly retrieve the target component from the huge component library, this paper proposes a component retrieval method based on facet classification, which uses component keyword set to facet description of the component and constructs the component vectorized model. The idea of layering is adopted to divide the components in detail. The K-means clustering algorithm based on the maximum and minimum distances is used to cluster the components, so that the problem of component matching is transformed into the calculation of the cosine similarity of component vectors. This method can narrow down the search scope and effectively improve the search efficiency.