Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:30 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Method for Generating Paths with Arbitrary Termination Probabilities Based on Pre-Executed Random Walk Paths Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) AI2023-48 |
In graph analysis, random walks can be sped up by using indices. A random walk is a sequence of transitions from a sourc... [more] |
AI2023-48 pp.24-29 |
NS, IN (Joint) |
2024-03-01 09:20 |
Okinawa |
Okinawa Convention Center |
Asynchronous UDP Random Walk method with path reuse for geo-distributed graph analysis Shun Takizawa, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-88 |
Random Walk (RW) is widely used in graph analysis. Graph data for analysis has been getting larger and larger in recent ... [more] |
IN2023-88 pp.136-141 |
NS, IN (Joint) |
2024-03-01 09:45 |
Okinawa |
Okinawa Convention Center |
Graph reduction method focusing on random walk transition probability for discovering latent important vertices using graph connections Kaito Miyakoshi, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-89 |
[more] |
IN2023-89 pp.142-147 |
IN |
2024-01-19 10:00 |
Aichi |
|
A Weighting Framework for Graph Utilization of Relational Databases Kotaro Fujii, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-57 |
In recent years, there has been increasing interest in analyzing data by converting relational databases (RDB) into grap... [more] |
IN2023-57 pp.46-51 |
IN, NS (Joint) |
2023-03-03 14:30 |
Okinawa |
Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Top-k Personalized PageRank Computation without Re-indexing for Graph Updates Tsuyoshi Yamashita, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2022-117 |
Top-k Personalized PageRank (PPR) is graph analysis method to determine k important nodes with respect to a source node.... [more] |
IN2022-117 pp.305-310 |
IN |
2023-01-20 09:50 |
Aichi |
Aichi Industry & Labor Center (Primary: On-site, Secondary: Online) |
Community Detection in Multi-Layer Networks with Controlled Reflection of Layers Shuhei Nakano, Tsuyoshi Yamashita, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2022-62 |
Community detection in multi-layer networks has put an emphasis on identifying the idel reflection of layers. However, t... [more] |
IN2022-62 pp.64-71 |
NS, IN (Joint) |
2022-03-11 14:20 |
Online |
Online |
A Method for Generating Random Walk Paths Focusing Only on Updates Near A Source Node in Dynamic Distributed Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-48 |
In graph calculations with a lot of random walks (RWs), some long RWs become bottlenecks, and thus pre-execution of RWs ... [more] |
IN2021-48 pp.103-108 |
RCS, IN, NV (Joint) |
2021-05-28 11:45 |
Online |
Online |
An Evaluation of Tracking Performance of Personalized PageRank Using Random Walk in Dynamic Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-5 |
By combining graphs managed by multiple services, we can create an autonomous distributed graph that enables multiple se... [more] |
IN2021-5 pp.25-30 |
IN, CCS (Joint) |
2020-08-04 14:55 |
Online |
Online |
Landmark Decision Method Combining Random Walk and Betweenness Centrality Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2020-19 |
Abstract Highly reproducible presentations of important nodes near the node of interest are useful in determin- ing land... [more] |
IN2020-19 pp.59-64 |
IE, ITE-AIT, ITE-ME [detail] |
2014-11-07 10:00 |
Kagoshima |
|
A study on improvement of microcalcification attenuation in medical image denoising using NL-means Tsuyoshi Yamashita (Kanazawa Univ.), Mamoru Ogaki (EIZO Co.), Marina Katou, Kousuke Imamura, Yoshio Matsuda, Shigeru Sanada (Kanazawa Univ.) IE2014-57 |
Image processing technology in medical field is attracting attention as a solution to realize improvement of diagnosis a... [more] |
IE2014-57 pp.45-50 |