| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NS, NWS (Joint) |
2025-01-23 11:10 |
Osaka | Higashi-Yodogawa Community Center + Online (Osaka, Online) (Primary: On-site, Secondary: Online) |
Graph Maintenance for Load Balancing of Random Walk Operations in Distributed Dynamic Graphs Taiga Akimoto, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) |
(To be available after the conference date) [more] | |
| IN, IA (Joint) |
2024-12-20 10:30 |
Hyogo | KIITO (Hyogo) | The Small-Scale Community Detection Method Based on Edge Recirculation of Random Walk Takashi Yamauchi, Tsuyoshi Yamashita (Keio Univ.), Naoki Matsumoto (Ryukyus Univ.), Kunitake Kaneko (Keio Univ.)  IN2024-68 |
Community detection has garnered attention in recommendation systems based on graph-based services such as social networ... [more] | IN2024-68 pp.73-80 |
| IN, IA (Joint) |
2024-12-20 13:30 |
Hyogo | KIITO (Hyogo) | Graph Reduction Method Combining Sampling and Crawling with High Connectivity Sora Satoh, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2024-72 |
In recent years, the use of entire graphs has become increasingly challenging due to security concerns, highlighting the... [more] | IN2024-72 pp.99-106 |
| IN, CCS (Joint) |
2024-07-30 10:15 |
Hokkaido | Moerenuma Park Glass Pyramid (Hokkaido) | Weighted Graph Summarization Based on Edge Transition Probabilities for Third-Party Graph Utilization Kishin Okamatsu, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2024-24 |
When providing graphs to third party graph users, graph summarization methods are useful for reducing the cost of analys... [more] | IN2024-24 pp.83-88 |
| AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:30 |
Hokkaido | (Hokkaido, Online) (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 (Okinawa) | 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 (Okinawa) | 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 | (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 (Okinawa, 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 (Aichi, Online) (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 |
| IN, CCS (Joint) |
2022-08-05 09:00 |
Hokkaido | Hokkaido University(Centennial Hall) (Hokkaido, Online) (Primary: On-site, Secondary: Online) |
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18 |
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] | IN2022-18 pp.15-20 |
| IN, RCS, NV (Joint) |
2022-05-27 16:00 |
Kanagawa | Keio University (Hiyoshi Campus) (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
Apporoximation Betweenness Centrality focusing on paths affected by the connection of two graph Kaito Miyakoshi, Kunitake Kaneko (Keio Univ.) IN2022-11 |
Betweenness Centrality(BC) is an importance measure that expresses the number of times a target vertex is included in th... [more] | IN2022-11 pp.50-55 |
| NS, IN (Joint) |
2022-03-11 14:20 |
Online | 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 |
| IN, NS, CS, NV (Joint) |
2021-09-09 13:05 |
Online | Online (Online) | Quantitative Evaluation of the Number of Servers Required to Obtain the Coverage of Community Formation Vertices in Autonomous Decentralized Management Graphs Satoshi Tanaka, Kunitake Kaneko (Keio Univ.) IN2021-13 |
An autonomous decentralized management graph is a graph in which each of the multiple managers autonomously decides whic... [more] | IN2021-13 pp.7-12 |
| RCS, IN, NV (Joint) |
2021-05-28 11:20 |
Online | Online (Online) | Orientation Estimation of Interests using Approximate Minimum Steiner Tree Urara Kobayashi, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2021-4 |
In recent years, there has been a tendency to represent information by graph according to services, and it attracts atte... [more] | IN2021-4 pp.19-24 |
| RCS, IN, NV (Joint) |
2021-05-28 11:45 |
Online | 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 |
| NS | 2021-05-13 14:50 |
Online | Online (Online) | Evaluation of the effect of vertex replication for random walk in autonomous distributed graphs Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) NS2021-19 |
It is important to obtain a subgraph from a distributed graph by Random Walk while maintaining the rough structure of th... [more] | NS2021-19 pp.26-31 |
| NS | 2021-05-13 15:15 |
Online | Online (Online) | Graph Reordering while Acquiring Graph Data Managed Distributedly by Random Walk Kohei Tsuchida, Kunitake Kaneko (Keio Univ.) NS2021-20 |
It is known that cache misses occur so many times, which leads to slow down the calculation speed while graph processing... [more] | NS2021-20 pp.32-37 |
| IN | 2021-01-18 10:30 |
Online | Online (Online) | Local community and weak ties detection using random walk on hypergraph. Ryo Oka (Keio Univ.), Yuuki Takai (RIKEN), Naoki Matsumoto (Keio Univ.), Masahiro Ikeda (RIKEN), Kunitake Kaneko (Keio Univ.) IN2020-41 |
There are many services that use a graph with a content as a vertex and their relationship as a edge. Community detectio... [more] | IN2020-41 pp.1-6 |
| IN, CCS (Joint) |
2020-08-04 14:55 |
Online | 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 |
[Return to Top Page]