Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Juho Kallio

dblp:351/9912 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0000-1052-4666ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval › domain-specific retrieval › legal information retrieval
patent retrieval
0.712023
Building a Graph-Based Patent Search Engine · SIGIR 2023
Information retrieval › document retrieval › bibliographic retrieval
citation-based retrieval
0.212023
Building a Graph-Based Patent Search Engine · SIGIR 2023
Information retrieval › document retrieval › domain-specific retrieval › legal information retrieval › patent retrieval
prior art search
0.212023
Building a Graph-Based Patent Search Engine · SIGIR 2023

Methods — techniques the papers use, named apart from their topics

graph neural network · 0.7
YearPublicationVenuePosition
2023 Building a Graph-Based Patent Search Engine
abstract
Performing prior art searches is an essential step in both patent drafting and invalidation. The task is challenging due to the large number of existing patent documents and the domain knowledge required to analyze the documents. We present a graph-based patent search engine that tries to mimic the work done by a professional patent examiner. Each patent document is converted to a graph that describes the parts of the invention and the relations between the parts. The search engine is powered by a graph neural network that learns to find prior art by using novelty citation data from patent office search reports where citations are compiled by human patent examiners. We show that a graph-based approach is an efficient way to perform searches on technical documents and demonstrate it in the context of patent searching.
Sebastian Björkqvist, Juho Kallio
SIGIR2