Takeaki Uno

Takeaki Uno

Auto-generated profile, based on publicly available information

Takeaki Uno

Principles of Informatics Research Division National Institute of Informatics Tokyo Japan

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 December 2022 in Journal of Medical Internet Research
Verified
Journal Article
Open access
RKRyota Kobayashi
Ryota Kobayashi
YTYuka Takedomi
Yuka Takedomi
YNYuri Nakayama
Yuri Nakayama
TSTowa Suda
Towa Suda
TUTakeaki Uno
Takeaki Uno
LRLuis Enrique Correa Rocha
Luis Enrique Correa Rocha
Background: Vaccines are promising tools to control the spread of COVID-19. An effective vaccination campaign requires government policies and community engagement, sharing experiences for social support, and voicing concerns about vaccine safety and efficiency. The increasing use of online social platforms allows us to trace large-scale communication and infer public opinion in real time. Objective: This study aimed to identify the main themes in COVID-19 vaccine-related discussions on Twitter in Japan and track how the popularity of the tweeted themes evolved during the vaccination campaign. Furthermore, we aimed to understand the impact of critical social events on the popularity of the themes. Methods: We collected more than 100 million vaccine-related tweets written in Japanese and posted by 8 million users (approximately 6.4% of the Japanese population) from January 1 to October 31, 2021. We used Latent Dirichlet Allocation to perform automated topic modeling of tweet text during the vaccination campaign. In addition, we performed an interrupted time series regression analysis to evaluate the impact of 4 critical social events on public opinion. Results: We identified 15 topics grouped into the following 4 themes: (1) personal issue, (2) breaking news, (3) politics, and (4) conspiracy and humor. The evolution of the popularity of themes revealed a shift in public opinion, with initial sharing of attention over personal issues (individual aspect), collecting information from news (knowledge acquisition), and government criticism to focusing on personal issues. Our analysis showed that the Tokyo Olympic Games affected public opinion more than other critical events but not the course of vaccination. Public opinion about politics was significantly affected by various social events, positively shifting attention in the early stages of the vaccination campaign and negatively shifting attention later. Conclusions: This study showed a striking shift in public interest in Japan, with users splitting their attention over various themes early in the vaccination campaign and then focusing only on personal issues, as trust in vaccines and policies increased. An interrupted time series regression analysis showed that the vaccination rollout to the general population (under 65 years) increased the popularity of tweets about practical advice and personal vaccination experience, and the Tokyo Olympic Games disrupted public opinion but not the course of the vaccination campaign. The methodology developed here allowed us to monitor the evolution of public opinion and evaluate the impact of social events on public opinion, using large-scale Twitter data.

1 January 2007
Verified
Book Chapter
Open access
PDF file
MBMarc Benkert
Marc Benkert
MNMartin Nöllenburg
Martin Nöllenburg
TUTakeaki Uno
Takeaki Uno
AWAlexander Wolff
Alexander Wolff
In this paper we consider a new problem that occurs when drawing wiring diagrams or public transportation networks. Given an embedded graph G = (V,E) (e.g., the streets served by a bus network) and a set L of paths in G (e.g., the bus lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For esthetic reasons we insist that the relative order of the paths that traverse a node does not change within the area occupied by that node. Our main contribution is an algorithm that minimizes the number of crossings on a single edge {u,v} ∈ E if we are given the order of the incoming and outgoing paths. The difficulty is deciding the order of the paths that terminate in u or v with respect to the fixed order of the paths that do not end there. Our algorithm uses dynamic programming and takes O(n 2) time, where n is the number of terminating paths.

1 September 2021 in Discrete Applied Mathematics
Verified
Journal Article
Open access
ODOscar Defrain
Oscar Defrain
LNLhouari Nourine
Lhouari Nourine
TUTakeaki Uno
Takeaki Uno

3 October 2019
Verified
Book Chapter
Open access
PDF file
ACAlessio Conte
Alessio Conte
RGRoberto Grossi
Roberto Grossi
GPGiulia Punzi
Giulia Punzi
TUTakeaki Uno
Takeaki Uno
A Maximal Common Subsequence (MCS) between two strings X and Y is an inclusion-maximal subsequence of both X and Y. MCSs are a natural generalization of the classical concept of Longest Common Subsequence (LCS), which can be seen as a longest MCS. We study the problem of efficiently listing all the distinct MCSs between two strings. As discussed in the paper, this problem is algorithmically challenging as the same MCS cannot be listed multiple times: for example, dynamic programming [Fraser et al., CPM 1998] incurs in an exponential waste of time, and a recent algorithm for finding an MCS [Sakai, CPM 2018] does not seem to immediately extend to listing. We follow an alternative and novel graph-based approach, proposing the first output-sensitive algorithm for this problem: it takes polynomial time in n per MCS found, where \(n = \max \{ |X|, |Y|\}\), with polynomial preprocessing time and space.


1 November 2021 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
TUTakeaki Uno
Takeaki Uno
Andrea MarinoAndrea Marino
Andrea Marino