Hiroshi Motoda

Hiroshi Motoda

Osaka University

H-index: 48

Asia-Japan

About Hiroshi Motoda

Hiroshi Motoda, With an exceptional h-index of 48 and a recent h-index of 26 (since 2020), a distinguished researcher at Osaka University, specializes in the field of Artificial Intelligence, Machine Learning, Data Mining, Social Network Analysis.

His recent articles reflect a diverse array of research interests and contributions to the field:

Constructing outlier-free histograms with variable bin-width based on distance minimization

Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition

Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network

Efficient computation of target-oriented link criticalness centrality in uncertain graphs

General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment

Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links

Efficient computing of PageRank scores on exact expected transition matrix of large uncertain graph

Opening and closing dynamics of competing shop groups over spatial networks

Hiroshi Motoda Information

University

Position

___

Citations(all)

25004

Citations(since 2020)

7265

Cited By

21155

hIndex(all)

48

hIndex(since 2020)

26

i10Index(all)

137

i10Index(since 2020)

48

Email

University Profile Page

Osaka University

Google Scholar

View Google Scholar Profile

Hiroshi Motoda Skills & Research Interests

Artificial Intelligence

Machine Learning

Data Mining

Social Network Analysis

Top articles of Hiroshi Motoda

Title

Journal

Author(s)

Publication Date

Constructing outlier-free histograms with variable bin-width based on distance minimization

Intelligent Data Analysis

Takayasu Fushimi

Kazumi Saito

Hiroshi Motoda

2023/1/1

Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition

Social Network Analysis and Mining

Takayasu Fushimi

Kazumi Saito

Hiroshi Motoda

2022/12

Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network

Takayasu Fushimi

Kazumi Saito

Hiroshi Motoda

2021/11/8

Efficient computation of target-oriented link criticalness centrality in uncertain graphs

Intelligent Data Analysis

Kazumi Saito

Takayasu Fushimi

Kouzou Ohara

Masahiro Kimura

Hiroshi Motoda

2021/1/1

General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment

Social Network Analysis and Mining

Takayasu Fushimi

Kazumi Saito

Kouzou Ohara

Masahiro Kimura

Hiroshi Motoda

2021/12

Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links

Kouzou Ohara

Takayasu Fushimi

Kazumi Saito

Masahiro Kimura

Hiroshi Motoda

2020

Efficient computing of PageRank scores on exact expected transition matrix of large uncertain graph

Takayasu Fushimi

Kazumi Saito

Kouzou Ohara

Masahiro Kimura

Hiroshi Motoda

2020/12/10

Opening and closing dynamics of competing shop groups over spatial networks

Takayasu Fushimi

Kazumi Saito

Kouzou Ohara

Masahiro Kimura

Hiroshi Motoda

2020/12/7

Resampling-based predictive simulation framework of stochastic diffusion model for identifying top-K influential nodes

International Journal of Data Science and Analytics

Kouzou Ohara

Kazumi Saito

Masahiro Kimura

Hiroshi Motoda

2020/3

See List of Professors in Hiroshi Motoda University(Osaka University)