![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
4th PatentSemTech@SIGIR 2023: Taipeh, Taiwan
- Hidir Aras, Ralf Krestel, Linda Andersson, Florina Piroi, Allan Hanbury, Dean Alderucci:
Proceedings of the 4th Workshop on Patent Text Mining and Semantic Technologies (PatentSemTech) 2023 co-located with the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2023), Taipeh, Taiwan, July 27th, 2023. CEUR Workshop Proceedings 3604, CEUR-WS.org 2023
Regular Papers
- Silvia Casola, Alberto Lavelli:
Benchmarking Natural Language Processing Algorithms for Patent Summarization. 1-11 - Renukswamy Chikkamath, Rana Fassahat Ali, Christoph Hewel, Markus Endres:
Explainable Artificial Intelligence for Highlighting and Searching in Patent Text 12-21. 12-21
Short Papers
- Hidetsugu Nanba, Shohei Kubo, Satoshi Fukuda:
Automatic Generation of Explanatory Text from Flowchart Images in Patents. 22-26 - Eleni Kamateri, Michail Salampasis:
Ensemble Method for Classification in Imbalanced Patent Data. 27-32 - Jarkko Lagus, Ekaterina Kotliarova, Sebastian Björkqvist:
Patent Classification on Search-Optimized Graph-Based Representations. 33-38 - Rima Dessi, Hidir Aras, Mehwish Alam:
Exploring the Impact of Negative Sampling on Patent Citation Recommendation. 39-43 - Shuxuan Xiang, Jin Mao, Gang Li:
A Patent Semantic Representation Using Technical Compound Sentences. 44-49
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.