Jieh Hsiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jieh Hsiang has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Maria Paola Bonacina
Università degli Studi di Verona
10 shared publications Hsieh-Chang Tu
National Taiwan University, Taiwan
7 shared publications- Chun-Chieh Cho
JCIPRNET, Irvine, USA
3 shared publications - Hao-Cheng Lo
JCIPRNET, Irvine, USA
3 shared publications Jen-Shin Hong
National ChiNan University
3 shared publications- Jung-Mei Chu
JCIPRNET, Irvine, USA
3 shared publications
Latest Publications
- 12 July 2024
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 33 (4) , 955-981
From PARIS to LE-PARIS: toward patent response automation with recommender systems and collaborative large language models
- 12 July 2024
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 33 (4) , 955-981
From PARIS to LE-PARIS: toward patent response automation with recommender systems and collaborative large language models
- Open Access
Large Language Model Informed Patent Image Retrieval
In patent prosecution, image-based retrieval systems for identifying similarities between current patent images and prior art are pivotal to ensure the novelty and non-obviousness of patent applications. Despite their growing popularity in recent years, existing attempts, while effective at recognizing images within the same patent, fail to deliver practical value due to their limited generalizability in retrieving relevant prior art. Moreover, this task inherently involves the challenges posed by the abstract visual features of patent images, the skewed distribution of image classifications, and the semantic information of image descriptions. Therefore, we propose a language-informed, distribution-aware multimodal approach to patent image feature learning, which enriches the semantic understanding of patent image by integrating Large Language Models and improves the performance of underrepresented classes with our proposed distribution-aware contrastive losses. Extensive experiments on DeepPatent2 dataset show that our proposed method achieves state-of-the-art or comparable performance in image-based patent retrieval with mAP +53.3%, Recall@10 +41.8%, and MRR@10 +51.9%. Furthermore, through an in-depth user analysis, we explore our model in aiding patent professionals in their image retrieval efforts, highlighting the model's real-world applicability and effectiveness.
Open AccessLarge Language Model Informed Patent Image Retrieval
In patent prosecution, image-based retrieval systems for identifying similarities between current patent images and prior art are pivotal to ensure the novelty and non-obviousness of patent applications. Despite their growing popularity in recent years, existing attempts, while effective at recognizing images within the same patent, fail to deliver practical value due to their limited generalizability in retrieving relevant prior art. Moreover, this task inherently involves the challenges posed by the abstract visual features of patent images, the skewed distribution of image classifications, and the semantic information of image descriptions. Therefore, we propose a language-informed, distribution-aware multimodal approach to patent image feature learning, which enriches the semantic understanding of patent image by integrating Large Language Models and improves the performance of underrepresented classes with our proposed distribution-aware contrastive losses. Extensive experiments on DeepPatent2 dataset show that our proposed method achieves state-of-the-art or comparable performance in image-based patent retrieval with mAP +53.3%, Recall@10 +41.8%, and MRR@10 +51.9%. Furthermore, through an in-depth user analysis, we explore our model in aiding patent professionals in their image retrieval efforts, highlighting the model's real-world applicability and effectiveness.
- Open Access
From PARIS to LE-PARIS: Toward Patent Response Automation with Recommender Systems and Collaborative Large Language Models
In patent prosecution, timely and effective responses to Office Actions (OAs) are crucial for securing patents. However, past automation and artificial intelligence research have largely overlooked this aspect. To bridge this gap, our study introduces the Patent Office Action Response Intelligence System (PARIS) and its advanced version, the Large Language Model (LLM) Enhanced PARIS (LE-PARIS). These systems are designed to enhance the efficiency of patent attorneys in handling OA responses through collaboration with AI. The systems' key features include the construction of an OA Topics Database, development of Response Templates, and implementation of Recommender Systems and LLM-based Response Generation. To validate the effectiveness of the systems, we have employed a multi-paradigm analysis using the USPTO Office Action database and longitudinal data based on attorney interactions with our systems over six years. Through five studies, we have examined the constructiveness of OA topics (studies 1 and 2) using topic modeling and our proposed Delphi process, the efficacy of our proposed hybrid LLM-based recommender system tailored for OA responses (study 3), the quality of generated responses (study 4), and the systems' practical value in real-world scenarios through user studies (study 5). The results indicate that both PARIS and LE-PARIS significantly achieve key metrics and have a positive impact on attorney performance.
Open AccessFrom PARIS to LE-PARIS: Toward Patent Response Automation with Recommender Systems and Collaborative Large Language Models
In patent prosecution, timely and effective responses to Office Actions (OAs) are crucial for securing patents. However, past automation and artificial intelligence research have largely overlooked this aspect. To bridge this gap, our study introduces the Patent Office Action Response Intelligence System (PARIS) and its advanced version, the Large Language Model (LLM) Enhanced PARIS (LE-PARIS). These systems are designed to enhance the efficiency of patent attorneys in handling OA responses through collaboration with AI. The systems' key features include the construction of an OA Topics Database, development of Response Templates, and implementation of Recommender Systems and LLM-based Response Generation. To validate the effectiveness of the systems, we have employed a multi-paradigm analysis using the USPTO Office Action database and longitudinal data based on attorney interactions with our systems over six years. Through five studies, we have examined the constructiveness of OA topics (studies 1 and 2) using topic modeling and our proposed Delphi process, the efficacy of our proposed hybrid LLM-based recommender system tailored for OA responses (study 3), the quality of generated responses (study 4), and the systems' practical value in real-world scenarios through user studies (study 5). The results indicate that both PARIS and LE-PARIS significantly achieve key metrics and have a positive impact on attorney performance.
- Open Access
Prior Art Search and Reranking for Generated Patent Text
Generative models, such as GPT-2, have demonstrated impressive results recently. A fundamental question we'd like to address is: where did the generated text come from? This work is our initial effort toward answering the question by using prior art search. The purpose of the prior art search is to find the most similar prior text in the training data of GPT-2. We take a reranking approach and apply it to the patent domain. Specifically, we pre-train GPT-2 models from scratch by using the patent data from the USPTO. The input for the prior art search is the patent text generated by the GPT-2 model. We also pre-trained BERT models from scratch for converting patent text to embeddings. The steps of reranking are: (1) search the most similar text in the training data of GPT-2 by taking a bag-of-word ranking approach (BM25), (2) convert the search results in text format to BERT embeddings, and (3) provide the final result by ranking the BERT embeddings based on their similarities with the patent text generated by GPT-2. The experiments in this work show that such reranking is better than ranking with embeddings alone. However, our mixed results also indicate that calculating the semantic similarities among long text spans is still challenging. To our knowledge, this work is the first to implement a reranking system to identify retrospectively the most similar inputs to a GPT model based on its output.
Open AccessPrior Art Search and Reranking for Generated Patent Text
Generative models, such as GPT-2, have demonstrated impressive results recently. A fundamental question we'd like to address is: where did the generated text come from? This work is our initial effort toward answering the question by using prior art search. The purpose of the prior art search is to find the most similar prior text in the training data of GPT-2. We take a reranking approach and apply it to the patent domain. Specifically, we pre-train GPT-2 models from scratch by using the patent data from the USPTO. The input for the prior art search is the patent text generated by the GPT-2 model. We also pre-trained BERT models from scratch for converting patent text to embeddings. The steps of reranking are: (1) search the most similar text in the training data of GPT-2 by taking a bag-of-word ranking approach (BM25), (2) convert the search results in text format to BERT embeddings, and (3) provide the final result by ranking the BERT embeddings based on their similarities with the patent text generated by GPT-2. The experiments in this work show that such reranking is better than ranking with embeddings alone. However, our mixed results also indicate that calculating the semantic similarities among long text spans is still challenging. To our knowledge, this work is the first to implement a reranking system to identify retrospectively the most similar inputs to a GPT model based on its output.
- 30 August 2019
- Published by Springer Nature
- p. 280-287
Finding Documents Related to Taiwan in the Veritable Records of Qing Using Relevance Feedback
- 30 August 2019
- Published by Springer Nature
- p. 280-287
Finding Documents Related to Taiwan in the Veritable Records of Qing Using Relevance Feedback
- 25 September 2014
- Published by Springer Nature in Scientometrics
- Vol. 102 (1) , 97-112
Exploring alternative metrics of scholarly performance in the social sciences and humanities in Taiwan
- 25 September 2014
- Published by Springer Nature in Scientometrics
- Vol. 102 (1) , 97-112
Exploring alternative metrics of scholarly performance in the social sciences and humanities in Taiwan
- 29 October 2013
- Published by Springer Nature in New Generation Computing
- Vol. 31 (4) , 265-283
Transliteration Pair Extraction from Classical Chinese Buddhist Literature Using Phonetic Similarity Measurement
- 29 October 2013
- Published by Springer Nature in New Generation Computing
- Vol. 31 (4) , 265-283
Transliteration Pair Extraction from Classical Chinese Buddhist Literature Using Phonetic Similarity Measurement
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 198-199
On Mapping the Ontologies of Leishu - A Preliminary Investigation
Leishu is a unique form of ancient Chinese reference books that seem to have no counterpart in the western civilization. The original purpose of leishu was to provide quick reference to ancient texts. Therefore a leishu usually contains two parts, a knowledge structure and a large number of quoted texts from older books. In this paper we outline a preliminary investigation on two important leishu, yiwenleiju and taipingyulan, written around 624AD and 977AD, respectively. We processed the texts of both books by identifying the entries (quoted texts) with their sources, and built a system for full-text search and analysis. Two additional purposes of the system are to provide a way to compare the texts and explore such questions as text inherence and the change of the knowledge structures. We use "fish" as an example to illustrate our point.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 198-199
On Mapping the Ontologies of Leishu - A Preliminary Investigation
Leishu is a unique form of ancient Chinese reference books that seem to have no counterpart in the western civilization. The original purpose of leishu was to provide quick reference to ancient texts. Therefore a leishu usually contains two parts, a knowledge structure and a large number of quoted texts from older books. In this paper we outline a preliminary investigation on two important leishu, yiwenleiju and taipingyulan, written around 624AD and 977AD, respectively. We processed the texts of both books by identifying the entries (quoted texts) with their sources, and built a system for full-text search and analysis. Two additional purposes of the system are to provide a way to compare the texts and explore such questions as text inherence and the change of the knowledge structures. We use "fish" as an example to illustrate our point.
- 21 December 2012
- Published by Oxford University Press (OUP) in Literary and Linguistic Computing
- Vol. 28 (2) , 257-270
Discovering land transaction relations from land deeds of Taiwan
Land deeds were the only proof of ownership in pre-1900 Taiwan. They are indispensable for the studies of Taiwan’s social, anthropological, and economic evolution. We have built a full-text digital library that contains almost 40,000 land deeds. The deeds in our collection range over 250 years and are collected from over 100 sources. The unprecedented volume and diversity of the sources provide an exciting source of primary documents for historians. But they also pose an interesting challenge: how to tell if two land deeds are related. In this article, we describe an approach to discover two important relations: successive transactions and allotment agreements involving the same property. Our method enabled us to construct 6,035 such transaction pairs. We also introduce a notion of ‘land transitivity graph’ to capture the transitivity embedded in these transactions. We discovered 2,436 such graphs, the largest of which includes 104 deeds. Some of these graphs involve land behavior that had never been studied before.
- 21 December 2012
- Published by Oxford University Press (OUP) in Literary and Linguistic Computing
- Vol. 28 (2) , 257-270
Discovering land transaction relations from land deeds of Taiwan
Land deeds were the only proof of ownership in pre-1900 Taiwan. They are indispensable for the studies of Taiwan’s social, anthropological, and economic evolution. We have built a full-text digital library that contains almost 40,000 land deeds. The deeds in our collection range over 250 years and are collected from over 100 sources. The unprecedented volume and diversity of the sources provide an exciting source of primary documents for historians. But they also pose an interesting challenge: how to tell if two land deeds are related. In this article, we describe an approach to discover two important relations: successive transactions and allotment agreements involving the same property. Our method enabled us to construct 6,035 such transaction pairs. We also introduce a notion of ‘land transitivity graph’ to capture the transitivity embedded in these transactions. We discovered 2,436 such graphs, the largest of which includes 104 deeds. Some of these graphs involve land behavior that had never been studied before.
- Open Access
- 29 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 2487-2490
Information preservation in static index pruning
- 29 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 2487-2490
Open AccessInformation preservation in static index pruning