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

Tomohiro Yamasaki

dblp:45/1251 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
1since 2021 · last 2022
—ORCID · none

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

Theory of computation · 4 · 4 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1

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 › search engines
query-free search
0.112008
One-button search extracts wider interests: an empirical study with video bookmarking search · SIGIR 2008
Information retrieval
search interfaces
0.112008
One-button search extracts wider interests: an empirical study with video bookmarking search · SIGIR 2008
Information retrieval › multimedia analysis and retrieval
video search
0.012008
One-button search extracts wider interests: an empirical study with video bookmarking search · SIGIR 2008

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

sentence labeling · 0.1named entity recognition · 0.1
YearPublicationVenuePosition
2022 Grapheme-to-Phoneme Conversion for Thai using Neural Regression Models
abstract
We propose a novel Thai grapheme-tophoneme conversion method based on a neural regression model that is trained using neural networks to predict the similarity between a candidate and the correct pronunciation.After generating a set of candidates for an input word or phrase using the orthography rules, this model selects the best-similarity pronunciation from the candidates.This method can be applied to languages other than Thai simply by preparing enough orthography rules, and can reduce the mistakes that neural network models often make.We show that the accuracy of the proposed method is .931,which is comparable to that of encoder-decoder sequence models.We also demonstrate that the proposed method is superior in terms of the difference between correct and predicted pronunciations because incorrect, strange output sometimes occurs when using encoder-decoder sequence models but the error is within the expected range when using the proposed method.
Tomohiro Yamasaki
NAACL-HLT1
2010 First query term extraction from current webpage for mobile applications
abstract
Inputting query terms on a mobile terminal is frustrating because of device limitations though mobile web search is becoming popular. Query prediction is a promising approach for mobile search. In the literature, however, little attention has been paid to the first query term, though there are many reports on query expansion or second query recommendation. In this paper, we propose a first query prediction method that enables users to search related information for the current browsed webpage with an easier interface such as touch operation without any background search processes. The proposed method consists of body-text extraction, candidate query term extraction, and a scoring process. We also implemented a one-touch search application that works for Japanese webpages at a practical speed on a smartphone. According to our closed evaluation with 299 webpages and open evaluation with 14 users, our method achieved practical quality.
Masayuki Okamoto, Nayuko Watanabe, Masaaki Kikuchi, Takayuki Iida, Kenta Sasaki, Kensuke Horiuchi, Tomohiro Yamasaki, Sumi Omura, Masanori Hattori
MUM7
2008 One-button search extracts wider interests: an empirical study with video bookmarking search
abstract
This poster presents an overview of the characteristics of a one-button information retrieval interface with closed captions from TV watching activities, which is intended to lighten the burden of remembering and entering query terms while watching TV. We investigated this interface with an experimental system named Video Bookmarking Search, which estimates query terms from closed captions with named-entity recognition and sentence labeling techniques. According to an empirical evaluation for 1,138 search queries from 206 bookmarks using seven actual TV shows on city life, travel, health, and cuisine, we found wider queries and search results are acceptable through the query-input-free interface, despite the fact that the number of queries and search results that are directly relevant to the users' original intentions is not high. The main reason is a watching user's interest is wider than what is expressed with query terms.
Masayuki Okamoto, Masaaki Kikuchi, Tomohiro Yamasaki
SIGIR3
2005 Quantum versus deterministic counter automata
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
Theor. Comput. Sci.1
2002 Quantum versus Deterministic Counter Automata
Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
COCOON1
2002 One-way probabilistic reversible and quantum one-counter automata
Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
Theor. Comput. Sci.1
2000 One-Way Probabilistic Reversible and Quantum One-Counter Automata
Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
COCOON1