{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:39:05Z","timestamp":1770489545227,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872166"],"award-info":[{"award-number":["61872166"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010014","name":"Six Talent Peaks Project in Jiangsu Province","doi-asserted-by":"publisher","award":["2019 XYDXX-161"],"award-info":[{"award-number":["2019 XYDXX-161"]}],"id":[{"id":"10.13039\/501100010014","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For large amount of patent texts, how to extract their keywords in an unsupervised way is a very important problem. In existing methods, only the own information of patent texts is analyzed. In this study, an improved TextRank model is proposed, in which prior public knowledge is effectively utilized. Specifically, two following points are first considered: (1) a TextRank network is constructed for each patent text, (2) a prior knowledge network is constructed based on public dictionary data, in which network edges represent the prior interpretation relationship among all dictionary words in dictionary entries. Then, an improved node rank value evaluation formula is designed for TextRank networks of patent texts, in which prior interpretation information in prior knowledge network are introduced. Finally, patent keywords can be extracted by finding top-k node words with higher node rank values. In our experiments, patent text clustering task is used to examine the performance of proposed method, wherein several comparison experiments are executed. Corresponding results demonstrate that, new method can markedly obtain better performance than existing methods for patent keywords extraction task in an unsupervised way.<\/jats:p>","DOI":"10.1007\/s40747-021-00343-8","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T18:02:50Z","timestamp":1617040970000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["A patent keywords extraction method using TextRank model with prior public knowledge"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3789-0890","authenticated-orcid":false,"given":"Zhaoxin","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9481-9599","authenticated-orcid":false,"given":"Zhenping","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"key":"343_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.techfore.2016.08.020","volume":"114","author":"J Joung","year":"2017","unstructured":"Joung J, Kim K (2017) Monitoring emerging technologies for technology planning using technical keyword based analysis from patent data. Technol Forecast Soc Chang 114:281\u2013292. https:\/\/doi.org\/10.1016\/j.techfore.2016.08.020","journal-title":"Technol Forecast Soc Chang"},{"key":"343_CR2","doi-asserted-by":"publisher","first-page":"5200","DOI":"10.1016\/j.eswa.2008.06.131","volume":"36","author":"Y-R Li","year":"2009","unstructured":"Li Y-R, Wang L-H, Hong C-F (2009) Extracting the significant-rare keywords for patent analysis. Expert Syst Appl 36:5200\u20135204. https:\/\/doi.org\/10.1016\/j.eswa.2008.06.131","journal-title":"Expert Syst Appl"},{"key":"343_CR3","doi-asserted-by":"publisher","first-page":"49896","DOI":"10.1109\/ACCESS.2020.2980226","volume":"8","author":"\u00c1 Hern\u00e1ndez-Casta\u00f1eda","year":"2020","unstructured":"Hern\u00e1ndez-Casta\u00f1eda \u00c1, Garc\u00eda Hern\u00e1ndez RA, Ledeneva Y, Mill\u00e1n-Hern\u00e1ndez CE (2020) Extractive automatic text summarization based on lexical-semantic keywords. IEEE Access 8:49896\u201349907. https:\/\/doi.org\/10.1109\/ACCESS.2020.2980226","journal-title":"IEEE Access"},{"key":"343_CR4","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s11192-012-0635-7","volume":"91","author":"JM Gerken","year":"2012","unstructured":"Gerken JM, Moehrle MG (2012) A new instrument for technology monitoring: novelty in patents measured by semantic patent analysis. Scientometrics 91:645\u2013670. https:\/\/doi.org\/10.1007\/s11192-012-0635-7","journal-title":"Scientometrics"},{"key":"343_CR5","doi-asserted-by":"crossref","unstructured":"Jin CX, Zhou HY, Bai QC (2012) Short text clustering algorithm with feature keyword expansion. In: Materials science and information technology II. Trans Tech Publications Ltd, pp 1716\u20131720","DOI":"10.4028\/www.scientific.net\/AMR.532-533.1716"},{"key":"343_CR6","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.eswa.2016.03.045","volume":"57","author":"A Onan","year":"2016","unstructured":"Onan A, Koruko\u011flu S, Bulut H (2016) Ensemble of keyword extraction methods and classifiers in text classification. Expert Syst Appl 57:232\u2013247. https:\/\/doi.org\/10.1016\/j.eswa.2016.03.045","journal-title":"Expert Syst Appl"},{"key":"343_CR7","unstructured":"Mihalcea R, Tarau P (2004) TextRank: bringing order into texts. In: Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing (EMNLP).ACL, Stroudsburg, Pennsylvania, pp. 404\u2013411."},{"key":"343_CR8","doi-asserted-by":"crossref","unstructured":"Ding W, Wang J, Zhu H (2019) Using graph representations for semantic information extraction from chinese patents. In: Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control. ACM, New York, NY, USA, pp. 1\u20135.","DOI":"10.1145\/3386164.3389093"},{"key":"343_CR9","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical Report, Stanford InfoLab"},{"key":"343_CR10","doi-asserted-by":"crossref","unstructured":"Ardiansyah S, Majid M, Mohamad Zain J (2016) Knowledge of extraction from trained neural network by using decision tree. In: Proceedings of the International Conference on Science in Information Technology (ICSITech). IEEE, Balikpapan, Indonesia, pp 220\u2013225.","DOI":"10.1109\/ICSITech.2016.7852637"},{"key":"343_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.engappai.2014.07.014","volume":"36","author":"J Sangeetha","year":"2014","unstructured":"Sangeetha J, Jothilakshmi S (2014) A novel spoken keyword spotting system using support vector machine. Eng Appl Artif Intell 36:287\u2013293. https:\/\/doi.org\/10.1016\/j.engappai.2014.07.014","journal-title":"Eng Appl Artif Intell"},{"key":"343_CR12","doi-asserted-by":"crossref","unstructured":"Wang J, Song F, Walia K, et al (2019) Using convolutional neural networks to extract keywords and keyphrases: a case study for foodborne illnesses. In: Proceedings of the 2019 18th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, Florida, , pp 1398\u20131403.","DOI":"10.1109\/ICMLA.2019.00228"},{"key":"343_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.neucom.2019.11.083","volume":"383","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Tuo M, Yin Q et al (2020) Keywords extraction with deep neural network model. Neurocomputing 383:113\u2013121. https:\/\/doi.org\/10.1016\/j.neucom.2019.11.083","journal-title":"Neurocomputing"},{"key":"343_CR14","doi-asserted-by":"crossref","unstructured":"She C, You H, Lin C, et al (2020) Deep neural semantic network for keywords extraction on short text. In: Qin P, Wang H, Sun G, Lu Z (eds) Data Science. ICPCSEE 2020. Springer, Singapore, pp 101\u2013112.","DOI":"10.1007\/978-981-15-7984-4_8"},{"key":"343_CR15","doi-asserted-by":"crossref","unstructured":"Feng Y, Zhang H, Hao W, Chen G (2017) Joint extraction of entities and relations using reinforcement learning and deep learning. In: Computational Intelligence and Neuroscience. https:\/\/www.hindawi.com\/journals\/cin\/2017\/7643065\/. Accessed 23 Nov 2020.","DOI":"10.1155\/2017\/7643065"},{"key":"343_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/0306-4573(88)90021-0","volume":"24","author":"G Salton","year":"1988","unstructured":"Salton G, Buckley C (1988) Term-weighting approaches in automatic text retrieval. Inf Process Manage 24:513\u2013523. https:\/\/doi.org\/10.1016\/0306-4573(88)90021-0","journal-title":"Inf Process Manage"},{"key":"343_CR17","unstructured":"Gollapalli SD, Caragea C (2014) Extracting keyphrases from research papers using citation networks. In: Proceedings of the Twenty-eighth AAAI Conference on Artificial Intelligence (AAAI-14). AAAI Press, Qu\u00e9bec, Canada, pp 1629\u20131635."},{"key":"343_CR18","doi-asserted-by":"crossref","unstructured":"Florescu C, Caragea C (2017) PositionRank: an unsupervised approach to keyphrase extraction from scholarly documents. In: Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL 2017).ACL, Vancouver, Canada, pp 1105\u20131115.","DOI":"10.18653\/v1\/P17-1102"},{"key":"343_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-019-02128-x","author":"R Devika","year":"2019","unstructured":"Devika R, Subramaniyaswamy V (2019) A semantic graph-based keyword extraction model using ranking method on big social data. Wireless Netw. https:\/\/doi.org\/10.1007\/s11276-019-02128-x","journal-title":"Wireless Netw"},{"key":"343_CR20","unstructured":"Liu Z, Huang W, Zheng Y, Sun M (2010) Automatic keyphrase extraction via topic decomposition. In: Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, Cambridge, Massachusetts, pp 366\u2013376."},{"key":"343_CR21","unstructured":"Yang SY, Lin SY, Lin SN, et al (2008) Automatic extraction of semantic relations from patent claims. Int J Electron Bus Manag."},{"key":"343_CR22","doi-asserted-by":"publisher","first-page":"4348","DOI":"10.1016\/j.eswa.2015.01.050","volume":"42","author":"H Noh","year":"2015","unstructured":"Noh H, Jo Y, Lee S (2015) Keyword selection and processing strategy for applying text mining to patent analysis. Expert Syst Appl 42:4348\u20134360. https:\/\/doi.org\/10.1016\/j.eswa.2015.01.050","journal-title":"Expert Syst Appl"},{"key":"343_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.wpi.2016.05.008","volume":"46","author":"F Madani","year":"2016","unstructured":"Madani F, Weber C (2016) The evolution of patent mining: applying bibliometrics analysis and keyword network analysis. World Patent Inf 46:32\u201348. https:\/\/doi.org\/10.1016\/j.wpi.2016.05.008","journal-title":"World Patent Inf"},{"key":"343_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.techfore.2017.02.018","volume":"118","author":"Y Park","year":"2017","unstructured":"Park Y, Yoon J (2017) Application technology opportunity discovery from technology portfolios: Use of patent classification and collaborative filtering. Technol Forecast Soc Chang 118:170\u2013183. https:\/\/doi.org\/10.1016\/j.techfore.2017.02.018","journal-title":"Technol Forecast Soc Chang"},{"key":"343_CR25","unstructured":"Yanagihori K, Tsuda K (2013) Issues of the morphological analysis in comparison with the compound noun extraction analysis for a patent document. Inform Syst Int Conf 2013."},{"key":"343_CR26","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang M (2020) Unsupervised K-means clustering algorithm. IEEE Access 8:80716\u201380727. https:\/\/doi.org\/10.1109\/ACCESS.2020.2988796","journal-title":"IEEE Access"},{"key":"343_CR27","doi-asserted-by":"crossref","unstructured":"Bide P, Shedge R (2015) Improved document clustering using k-means algorithm. In: Proceedings of the 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). IEEE, Coimbatore, India, pp 1\u20135.","DOI":"10.1109\/ICECCT.2015.7226065"},{"key":"343_CR28","doi-asserted-by":"publisher","first-page":"8676","DOI":"10.1049\/joe.2018.9082","volume":"2019","author":"S Chen","year":"2019","unstructured":"Chen S, Liu X, Ma J et al (2019) Parameter selection algorithm of DBSCAN based on K-means two classification algorithm. J Eng 2019:8676\u20138679. https:\/\/doi.org\/10.1049\/joe.2018.9082","journal-title":"J Eng"},{"key":"343_CR29","doi-asserted-by":"publisher","unstructured":"Nataliani Y, Yang M-S (2107) Powered gaussian kernel spectral clustering. Neural Comput Appl 31:1\u201316. https:\/\/doi.org\/10.1007\/s00521-017-3036-2","DOI":"10.1007\/s00521-017-3036-2"},{"key":"343_CR30","unstructured":"Boudin F, Mougard H, Cram D (2016) How document pre-processing affects keyphrase extraction performance. In: Proceedings of the 2nd Workshop on Noisy User-generated Text (WNUT), Osaka, Japan, pp 121\u2013128."},{"key":"343_CR31","doi-asserted-by":"crossref","unstructured":"Witten I, Paynter G, Frank E, et al (1999) KEA: practical automatic keyphrase extraction. In: Proceedings of the Fourth ACM Conference on Digital Libraries (JCDL). ACM, New York, pp. 254\u2013255.","DOI":"10.1145\/313238.313437"},{"key":"343_CR32","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/37.55118","volume":"10","author":"AN Michel","year":"1990","unstructured":"Michel AN, Farrell J (1990) Associative memories via artifical neural networks. Control Syst Mag IEEE 10:6\u201317. https:\/\/doi.org\/10.1109\/37.55118","journal-title":"Control Syst Mag IEEE"},{"key":"343_CR33","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.tics.2017.01.010","volume":"21","author":"DS Bassett","year":"2017","unstructured":"Bassett DS, Mattar MG (2017) A network neuroscience of human learning: potential to inform quantitative theories of brain and behavior. Trends Cogn Sci 21:250\u2013264. https:\/\/doi.org\/10.1016\/j.tics.2017.01.010","journal-title":"Trends Cogn Sci"},{"key":"343_CR34","doi-asserted-by":"publisher","first-page":"124","DOI":"10.2991\/ijndc.k.200515.005","volume":"8","author":"Z Xie","year":"2020","unstructured":"Xie Z, Wang K, Liu Y (2020) On learning associative relationship memory among knowledge concepts. Int J Netw Distrib Comput 8:124. https:\/\/doi.org\/10.2991\/ijndc.k.200515.005","journal-title":"Int J Netw Distrib Comput"},{"key":"343_CR35","doi-asserted-by":"crossref","unstructured":"Wang C, Zhang M, Ma S, Ru L (2008) Automatic online news issue construction in web environment. In: Proceedings of the 17th International Conference on World Wide Web. ACM, New York, NY, USA, pp 457\u2013466.","DOI":"10.1145\/1367497.1367560"},{"key":"343_CR36","unstructured":"Foodbk. [EB\/OL]. [Online]. Available via DIALOG. http:\/\/www.foodbk.com\/ of subordinate document."},{"key":"343_CR37","unstructured":"The Chinese Dictionary. [EB\/OL]. [Online]. Available via DIALOG. http:\/\/www.hydcd.com\/."},{"key":"343_CR38","doi-asserted-by":"publisher","first-page":"8858717","DOI":"10.1155\/2020\/8858717","volume":"2020","author":"Y Zhu","year":"2020","unstructured":"Zhu Y, Zheng W, Tang H (2020) Interactive dual attention network for text sentiment classification. Comput Intell Neurosci 2020:8858717. https:\/\/doi.org\/10.1155\/2020\/8858717","journal-title":"Comput Intell Neurosci"},{"key":"343_CR39","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.neucom.2020.07.049","volume":"414","author":"Q Li","year":"2020","unstructured":"Li Q, Li P, Mao K, Lo EY-M (2020) Improving convolutional neural network for text classification by recursive data pruning. Neurocomputing 414:143\u2013152. https:\/\/doi.org\/10.1016\/j.neucom.2020.07.049","journal-title":"Neurocomputing"},{"key":"343_CR40","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S Deerwester","year":"1990","unstructured":"Deerwester S, Dumais ST, Furnas GW et al (1990) Indexing by latent semantic analysis. J Am Soc Inform Sci 41:391\u2013407","journal-title":"J Am Soc Inform Sci"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00343-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00343-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00343-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T12:28:06Z","timestamp":1646310486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00343-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["343"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00343-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"30 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}