default search action
Hiroaki Shiokawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Keisuke Kawano, Satoshi Koide, Hiroaki Shiokawa, Toshiyuki Amagasa:
Multi-Dimensional Fused Gromov Wasserstein Discrepancy for Edge-Attributed Graphs. IEICE Trans. Inf. Syst. 107(5): 683-693 (2024) - [c41]Shohei Matsugu, Suomi Kobayashi, Hiroaki Shiokawa
:
An Efficient Indexing Method for Dynamic Graph kNN. DEXA (1) 2024: 81-89 - [c40]Hiroaki Shiokawa, Yuma Naoi, Shohei Matsugu:
Efficient Correlated Subgraph Searches for AI-powered Drug Discovery. IJCAI 2024: 2351-2361 - 2023
- [c39]Toshi-Hiro Ito
An Effective Graph-based Music Recommendation Algorithm for Automatic Playlist Continuation. ASONAM 2023: 459-463 - [c38]Ryuichi Yagi
Fast Correlated DNA Subsequence Search via Graph-Based Representation. iiWAS 2023: 339-347 - [c37]Shohei Matsugu, Hiroaki Shiokawa:
Efficient Maximum k-plex Search via Selective Branch-and-Bound. iiWAS 2023: 348-357 - [c36]Yuma Naoi
Boosting Similar Compounds Searches via Correlated Subgraph Analysis. iiWAS 2023: 464-477 - [c35]Yuma Yasuda, Hiroaki Shiokawa
Efficient Similarity Searches for Multivariate Time Series: A Hash-Based Approach. iiWAS 2023: 478-490 - [c34]Shohei Matsugu, Yasuhiro Fujiwara, Hiroaki Shiokawa:
Uncovering the Largest Community in Social Networks at Scale. IJCAI 2023: 2251-2260 - 2022
- [j9]Suomi Kobayashi, Shohei Matsugu, Hiroaki Shiokawa
Indexing complex networks for fast attributed kNN queries. Soc. Netw. Anal. Min. 12(1): 82 (2022) - [c33]Ryuichi Yagi
Fast Top-k Similar Sequence Search on DNA Databases. iiWAS 2022: 145-150 - [c32]Suomi Kobayashi, Shohei Matsugu, Hiroaki Shiokawa:
Tree-Based Graph Indexing for Fast kNN Queries. iiWAS 2022: 195-207 - 2021
- [j8]Shohei Matsugu, Hiroaki Shiokawa, Hiroyuki Kitagawa:
Fast Algorithm for Attributed Community Search. J. Inf. Process. 29: 188-196 (2021) - [c31]Hiroaki Shiokawa:
Scalable Affinity Propagation for Massive Datasets. AAAI 2021: 9639-9646 - [c30]Suomi Kobayashi, Shohei Matsugu, Hiroaki Shiokawa:
Fast indexing algorithm for efficient kNN queries on complex networks. ASONAM 2021: 343-347 - [c29]Hiroaki Shiokawa
Fast ObjectRank for Large Knowledge Databases. ISWC 2021: 217-234 - 2020
- [j7]Kotaro Yamazaki, Shohei Matsugu, Hiroaki Shiokawa, Hiroyuki Kitagawa:
Fast and Parallel RankClus Algorithm based on Dynamic Rank Score Tracking. J. Inf. Process. 28: 453-461 (2020) - [j6]Hiroaki Shiokawa, Tomohiro Matsushita, Hiroyuki Kitagawa:
Fast Affinity Propagation by Cell-based Indexing. J. Data Intell. 1(1): 55-74 (2020) - [j5]Hiroaki Shiokawa, Yasunori Futamura:
Efficient Vector Partitioning Algorithms for Graph Clustering. J. Data Intell. 1(2): 101-123 (2020) - [j4]Kotaro Yamazaki, Tomoki Sato, Hiroaki Shiokawa, Hiroyuki Kitagawa:
Fast and Parallel Ranking-based Clustering for Heterogeneous Graphs. J. Data Intell. 1(2): 137-158 (2020) - [c28]Hiroaki Shiokawa, Tomokatsu Takahashi:
DSCAN: Distributed Structural Graph Clustering for Billion-Edge Graphs. DEXA (1) 2020: 38-54 - [c27]Junya Yanagisawa, Hiroaki Shiokawa:
Fast One-to-Many Reliability Estimation for Uncertain Graphs. DEXA (1) 2020: 106-121 - [c26]Shohei Matsugu, Hiroaki Shiokawa, Hiroyuki Kitagawa:
Fast and Accurate Community Search Algorithm for Attributed Graphs. DEXA (1) 2020: 233-249 - [c25]Junhu Wang, Shikha Anirban
A Hybrid Index for Distance Queries. WISE (1) 2020: 227-241
2010 – 2019
- 2019
- [c24]Savong Bou, Hiroaki Shiokawa, Yasuhiro Hayase, Hiroyuki Kitagawa
StreamingCube-Based Analytical Framework for Environmental Data Analysis. BigComp 2019: 1-8 - [c23]Yuki Sumiya, Kazumasa Horie, Hiroaki Shiokawa, Hiroyuki Kitagawa
NR-GAN: Noise Reduction GAN for Mice Electroencephalogram Signals. ICBSP 2019: 94-101 - [c22]Shohei Matsugu, Hiroaki Shiokawa, Hiroyuki Kitagawa
Flexible Community Search Algorithm on Attributed Graphs. iiWAS 2019: 103-109 - [c21]Kotaro Yamazaki, Shohei Matsugu, Hiroaki Shiokawa, Hiroyuki Kitagawa
Fast RankCIus Algorithm via Dynamic Rank Score Tracking on Bi-type Information Networks. iiWAS 2019: 110-117 - [c20]Hiroaki Shiokawa, Toshiyuki Amagasa
Scaling Fine-grained Modularity Clustering for Massive Graphs. IJCAI 2019: 4597-4604 - [i1]Hiroaki Shiokawa, Toshiyuki Amagasa, Hiroyuki Kitagawa:
Scaling Fine-grained Modularity Clustering for Massive Graphs. CoRR abs/1905.11275 (2019) - 2018
- [c19]Hiroaki Shiokawa, Tomokatsu Takahashi, Hiroyuki Kitagawa
ScaleSCAN: Scalable Density-Based Graph Clustering. DEXA (1) 2018: 18-34 - [c18]Kotaro Yamazaki, Tomoki Sato, Hiroaki Shiokawa, Hiroyuki Kitagawa
Fast Algorithm for Integrating Clustering with Ranking on Heterogeneous Graphs. iiWAS 2018: 24-32 - [c17]Hiroaki Shiokawa, Yasunori Futamura:
Graph Clustering via Cohesiveness-aware Vector Partitioning. iiWAS 2018: 33-40 - [c16]Tomohiro Matsushita, Hiroaki Shiokawa, Hiroyuki Kitagawa
C-AP: Cell-based Algorithm for Efficient Affinity Propagation. iiWAS 2018: 156-163 - [c15]Tomoki Sato, Hiroaki Shiokawa, Yuto Yamaguchi, Hiroyuki Kitagawa
FORank: Fast ObjectRank for Large Heterogeneous Graphs. WWW (Companion Volume) 2018: 103-104 - [r1]Hiroaki Shiokawa, Makoto Onizuka:
Scalable Graph Clustering and Its Applications. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2017
- [j3]Makoto Onizuka
Graph Partitioning for Distributed Graph Processing. Data Sci. Eng. 2(1): 94-105 (2017) - [j2]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Takeshi Mishima, Makoto Onizuka
Fast Ad-Hoc Search Algorithm for Personalized PageRank. IEICE Trans. Inf. Syst. 100-D(4): 610-620 (2017) - [c14]Yuta Suzuki, Makito Sato, Hiroaki Shiokawa, Masashi Yanagisawa, Hiroyuki Kitagawa
MASC: Automatic Sleep Stage Classification Based on Brain and Myoelectric Signals. ICDE 2017: 1489-1496 - [c13]Takahiro Komamizu, Toshiyuki Amagasa
SOLA: Stream OLAP-based Analytical Framework for Roadway Maintenance. MEDES 2017: 35-41 - [c12]Tomokatsu Takahashi, Hiroaki Shiokawa, Hiroyuki Kitagawa
SCAN-XP: Parallel Structural Graph Clustering Algorithm on Intel Xeon Phi Coprocessors. NDA@SIGMOD 2017: 6:1-6:7 - 2016
- [c11]Yasuhiro Fujiwara, Yasutoshi Ida, Hiroaki Shiokawa, Sotetsu Iwamura:
Fast Lasso Algorithm via Selective Coordinate Descent. AAAI 2016: 1561-1567 - [c10]Takahiro Komamizu, Toshiyuki Amagasa
Towards Real-Time Analysis of Smart City Data: A Case Study on City Facility Utilizations. HPCC/SmartCity/DSS 2016: 1357-1364 - [c9]Junya Arai, Hiroaki Shiokawa, Takeshi Yamamuro, Makoto Onizuka
Rabbit Order: Just-in-Time Parallel Reordering for Fast Graph Analysis. IPDPS 2016: 22-31 - [c8]Hirotoshi Cho, Hiroaki Shiokawa, Hiroyuki Kitagawa
JsFlow: Integration of Massive Streams and Batches via JSON-based Dataflow Algebra. NBiS 2016: 188-195 - 2015
- [j1]Hiroaki Shiokawa, Yasuhiro Fujiwara, Makoto Onizuka
SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs. Proc. VLDB Endow. 8(11): 1178-1189 (2015) - [c7]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Yasutoshi Ida, Machiko Toyoda:
Adaptive Message Update for Fast Affinity Propagation. KDD 2015: 309-318 - 2013
- [c6]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Takeshi Mishima, Makoto Onizuka:
Fast and Exact Top-k Algorithm for PageRank. AAAI 2013: 1106-1112 - [c5]Hiroaki Shiokawa, Yasuhiro Fujiwara, Makoto Onizuka:
Fast Algorithm for Modularity-Based Graph Clustering. AAAI 2013: 1170-1176 - [c4]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Makoto Onizuka
Efficient search algorithm for SimRank. ICDE 2013: 589-600 - [c3]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Takeshi Mishima, Makoto Onizuka
Efficient ad-hoc search for personalized PageRank. SIGMOD Conference 2013: 445-456 - 2012
- [c2]Yasuhiro Fujiwara, Makoto Nakatsuji, Takeshi Yamamuro, Hiroaki Shiokawa, Makoto Onizuka
Efficient personalized pagerank with accuracy assurance. KDD 2012: 15-23 - 2010
- [c1]Hiroaki Shiokawa, Hiroyuki Kitagawa
A-SAS: An Adaptive High-Availability Scheme for Distributed Stream Processing Systems. Mobile Data Management 2010: 413-418
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: