Toru Takaki

dblp:48/5018 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 87% Parallel and multicore computing · 13%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
resource management
0.011998
Efficient Search Server Assignment in a Disproportionate System Environment · SIGIR 1998
Cloud and datacenter computing › resource allocation
server allocation
0.011998
Efficient Search Server Assignment in a Disproportionate System Environment · SIGIR 1998
Parallel and multicore computing
load balancing
0.011998
Efficient Search Server Assignment in a Disproportionate System Environment · SIGIR 1998
YearPublicationVenuePosition
2004 Associative document retrieval by query subtopic analysis and its application to invalidity patent search
abstract
We propose an associative document retrieval method, in which a document is used as a query to search for other similar documents. Because a long document usually includes more than one topic, we first analyze a query document to extract multiple subtopics. For each subtopic element, a sub-query is produced and similar documents are retrieved with a relevance score. The relevance scores are weighted by the importance of each subtopic element and are integrated to determine the final relevant documents. In the calculation of the subtopic importance, the specificity of a query term is evaluated using entropy, which is the deviation degree of the appearances of the term in each subtopic element. We apply this method to an invalidity patent search. By exploiting certain unique features of Japanese patent claims, we use features distinguishing the preamble and the essential portion in a query patent claim. To demonstrate the effectiveness of our method, we experimentally evaluated our associative document retrieval method on five years of patent documents.
Toru Takaki, Atsushi Fujii, Tetsuya Ishikawa
CIKM1
1998 Efficient Search Server Assignment in a Disproportionate System Environment
Toru Takaki, Tsuyoshi Kitani
SIGIR1