{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:07:12Z","timestamp":1787011632831,"version":"build-2736575974"},"reference-count":21,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWIS"],"published-print":{"date-parts":[[2020,8,13]]},"abstract":"<jats:sec>\n                    <jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n                    <jats:p>The purpose of constructing the technology\/function matrix is to analyze the patents in the target domain. The extraction of technology words is an important part of the construction of technology\/function matrix. This algorithm is used to solve the problem of low efficiency of traditional Chinese process patents technology words extraction.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n                    <jats:p>The authors propose a Chinese process patents technology words extraction method based on the improved term frequency\u2013inverse document frequency (TF-IDF) algorithm to help technicians obtain the technology words in the target domain. According to the characteristics of Chinese process patents technology words, the TF value of candidate technology words is divided into four parts, and the corpus of IDF value calculation of candidate technology words is selected.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n                    <jats:p>Through the test of Chinese process patents in the domain of path planning, this study shows that the method is feasible and practical. It can help users quickly and accurately obtain the technology words of Chinese process patents in the target domain.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n                    <jats:p>With the increasing number of patents on the network-based patent information platform, patent analysis of massive Chinese process patents has become a research focus. The method proposed in this paper can facilitate users to extract technology words from massive Chinese process patents for patent analysis.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n                    <jats:p>This paper aims to improve the efficiency of Chinese process patents technology words extraction. The authors hope that the proposed method can reduce the labor and time cost of Chinese process patents technology words extraction.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1108\/ijwis-06-2020-0033","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T04:03:45Z","timestamp":1597118625000},"page":"315-329","source":"Crossref","is-referenced-by-count":2,"title":["Web-based methodology for extracting technology words in Chinese process patents"],"prefix":"10.1108","volume":"16","author":[{"given":"Yuexin","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gongchang","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","reference":[{"key":"key2020100707571032100_ref001","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/3368567.3368572","article-title":"Authorship clustering using TF-IDF weighted Word-Embeddings","volume-title":"Proceedings of the 11th Forum for Information Retrieval Evaluation","year":"2019"},{"key":"key2020100707571032100_ref002","article-title":"Pre-training tasks for embedding-based large-scale retrieval","year":"2020"},{"issue":"2","key":"key2020100707571032100_ref003","first-page":"251","article-title":"TF-IDF based loop closure detection algorithm for slam","volume":"49","year":"2019","journal-title":"Dongnan Daxue Xuebao"},{"issue":"3","key":"key2020100707571032100_ref004","first-page":"378","article-title":"Chinese fasttext short text classification method integrating TF-IDF and LDA","volume":"37","year":"2019","journal-title":"Journal of Applied Sciences"},{"issue":"12","key":"key2020100707571032100_ref005","first-page":"36","article-title":"Keyword extraction of patent document: an improved approach","volume":"33","year":"2014","journal-title":"Journal of Intelligence"},{"key":"key2020100707571032100_ref006","first-page":"263","article-title":"BNS feature scaling: an improved representation over tf-idf for svm text classification","year":"2008"},{"key":"key2020100707571032100_ref007","unstructured":"Gebre, B.G. Zampieri, M. Wittenburg, P. and Heskes, T. (2013), \u201cImproving native language identification with tf-idf weighting\u201d, The 8th NAACL Workshop on Innovative Use of NLP for Building Educational Applications (BEA8), pp. 216-223, available at: http:\/\/hdl.handle.net\/11858\/00-001M-0000-000E-FB4D-B"},{"issue":"5","key":"key2020100707571032100_ref008","doi-asserted-by":"crossref","first-page":"856","DOI":"10.3724\/SP.J.1016.2011.00856","article-title":"A text similarity measurement combining word semantic information with TF-IDF method","volume":"34","year":"2011","journal-title":"Chinese Journal of Computers)"},{"key":"key2020100707571032100_ref009","first-page":"1","article-title":"A TfidfVectorizer and SVM based sentiment analysis framework for text data corpus","volume-title":"National Conference on Communications (NCC)","year":"2020"},{"issue":"1","key":"key2020100707571032100_ref010","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S0218213004001466","article-title":"Keyword extraction from a single document using word co-occurrence statistical information","volume":"13","year":"2004","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"key2020100707571032100_ref011","first-page":"1","article-title":"An improved TextRank keywords extraction algorithm","year":"2019"},{"issue":"5","key":"key2020100707571032100_ref012","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1080\/08839514.2020.1723868","article-title":"A methodology combining cosine similarity with classifier for text classification","volume":"34","year":"2020","journal-title":"Applied Artificial Intelligence"},{"key":"key2020100707571032100_ref013","article-title":"Application research of English scoring based on TF-IDF clustering algorithm","volume-title":"IOP Conference Series Materials ence and Engineering","year":"2020"},{"key":"key2020100707571032100_ref014","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.proeng.2014.03.129","article-title":"KNN with TF-IDF based framework for text categorization","volume":"69","year":"2014","journal-title":"Procedia Engineering"},{"key":"key2020100707571032100_ref015","first-page":"80","article-title":"Keywords extraction based on Sentence-Ranking from Chinese patents","volume-title":"SEKE","year":"2018"},{"issue":"3","key":"key2020100707571032100_ref016","first-page":"437","article-title":"Comments mining with TF-IDF: the inherent bias and its removal","volume":"31","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"12","key":"key2020100707571032100_ref017","first-page":"24","article-title":"Study on the differentiating method of technical and effect words in patent","volume":"27","year":"2012","journal-title":"Data Analysis and Knowledge Discovery"},{"issue":"8","key":"key2020100707571032100_ref018","first-page":"1740","article-title":"Mining patent knowledge for automatic keyword extraction","volume":"53","year":"2016","journal-title":"Journal of Computer Research and Development"},{"key":"key2020100707571032100_ref019","first-page":"42","article-title":"Research on recommendation algorithm based on tf-idf and mutual-information","volume":"12","year":"2019","journal-title":"Computer Era"},{"issue":"1","key":"key2020100707571032100_ref020","first-page":"49","article-title":"An improved TF-IDF approach for text classification","volume":"653","year":"2005","journal-title":"Journal of Zhejiang University-Science A"},{"key":"key2020100707571032100_ref021","first-page":"29","article-title":"Progress of keyword extraction of Chinese patent documents","volume":"1","year":"2015","journal-title":"Modernization of Traditional Chinese Medicine and Materia Medica-World Science and Technology"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-06-2020-0033\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-06-2020-0033\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:09Z","timestamp":1753395849000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/16\/3\/315-329\/165652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,13]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,8,13]]}},"alternative-id":["10.1108\/IJWIS-06-2020-0033"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-06-2020-0033","relation":{},"ISSN":["1744-0084","1744-0084"],"issn-type":[{"value":"1744-0084","type":"print"},{"value":"1744-0084","type":"print"}],"subject":[],"published":{"date-parts":[[2020,8,13]]}}}