| 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 # | |
| NLP, CAS | 2023-10-07 13:00 |
Gifu | Work plaza Gifu | An algorithm for finding regular graphs that maximize algebraic connectivity under a specified number of vertices and degree Masashi Kurahashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  CAS2023-54 NLP2023-53 |
Algebraic connectivity is a measure of network robustness, and defined by the second smallest eigenvalue of the Laplacia... [more] | CAS2023-54 NLP2023-53 pp.106-110 |
| CQ | 2023-07-12 14:00 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Study on the Effectiveness of Matrix Approximation without Rank Constraint Eriko Segawa, Yusuke Sakumto (Kwansei Gakuin Univ.) CQ2023-10 |
The proper selection of graph spectrum is crucial for constructing efficient graph algorithms. We have discussed a matri... [more] | CQ2023-10 pp.12-17 |
| CQ | 2023-07-12 14:25 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Statistical Evaluation of WSD-based Network Metrics for Brain Connectome Analysis Mikihiro Yasuda, Taiki Sasagawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2023-11 |
We have proposed network metrics based on the weighted spectral distribution (WSD) to analyze the connectome observed at... [more] | CQ2023-11 pp.18-23 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 11:00 |
Okinawa | Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
Evaluating the Efficiency of Anomaly Detection Methods for Temporal Networks Using the Graph Spectrum Masataka Nagao, Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-83 |
LAD (Laplacian Anomaly Detection) is a method for detecting anomalies in dynamic networks using the eigenvalues (the gra... [more] | CQ2022-83 pp.19-24 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 11:25 |
Okinawa | Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
Study on the Importance of Each Eigenvalue and Eigenvector for Laplacian Matrix Using Matrix Approximation Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-84 |
It is important for developing sophisticated graph algorithms to understand deeply the characteristics of the typical ma... [more] | CQ2022-84 pp.25-30 |
| IN, IA (Joint) |
2022-12-13 10:15 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Investigation of a Matrix Approximation Method for Analyzing the Information Amount Contained in the Specified Eigenvalues and Eigenvectors Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ) IA2022-56 |
In general, the large eigenvalues and their eigenvectors of a matrix representing the network structure are important to... [more] | IA2022-56 pp.47-49 |
| CQ | 2022-07-22 11:20 |
Osaka | Ritsumeikan Ibaraki Future Plaza Conference Hall (Primary: On-site, Secondary: Online) |
[Invited Talk]
Spectral Graph Theory and Its Application Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-25 |
The spectral graph theory provides an algebraical approach to investigating the characteristics of networks using the ei... [more] | CQ2022-25 p.43 |
| CQ, CS (Joint) |
2022-05-12 16:10 |
Fukui | Fukui (Fuku Pref.) (Primary: On-site, Secondary: Online) |
Why Do Small Eigenvalues of Laplacian Matrix Improve Anomaly Detection of Temporal Networks? Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-9 |
Many real networks are temporal networks in which the nodes and their relationships change over time, and technology to ... [more] | CQ2022-9 pp.44-49 |
| CQ, CBE (Joint) |
2022-01-28 12:10 |
Ishikawa | Kanazawa（Ishikawa Pref.） (Primary: On-site, Secondary: Online) |
A Study on Detection of Subjects with Unique Brain Structures Using Eigenvalues of Laplacian Matrices Ohisi Yuki, Taniguchi Toyoaki, Segawa Eriko, Sakumoto Yusuke (Kwansei Gakuin Univ) CQ2021-93 |
In order to understand the complex behavior of brains, many works have analyzed macroscale connectomes between the aggre... [more] | CQ2021-93 pp.94-99 |
| CQ, MIKA (Joint) |
2021-09-09 10:55 |
Online | Online | Proposal of an Improving Method for the Laplacian Anomaly Detection of Temporal Networks Eriko Segawa, Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2021-40 |
Many networks in the real world are dynamic and temporal wherein relationships among nodes change with time. Technologie... [more] | CQ2021-40 pp.17-22 |
| CQ, CBE (Joint) |
2021-01-20 13:05 |
Online | Online | A Study of a Method to Analyze Brain Network Using WSD(Weighted Spectral Distribution) Yuki Oishi, Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ) CQ2020-66 |
In order to understand the complex behavior of brains, many works have analyzed connectomes, which are the connection in... [more] | CQ2020-66 pp.32-37 |
| CQ, CBE (Joint) |
2021-01-21 16:00 |
Online | Online | [Poster Presentation]
Study on Universality of Eigenvalue Distribution for Normalized Laplacian Matrix of Weighted Network with Triads Toyoaki Taniguchi, Sakumoto Yusuke (Kwansei Gakuin Univ) CQ2020-90 |
In order to realize social network analysis using spectral graph theory, we aim to clarify the universality of random ma... [more] | CQ2020-90 pp.102-103 |
| SC | 2020-05-29 13:55 |
Online | Online | An Efficient Recommendation System Based on Spectral Analysis of Review Data Koki Tozuka, Goutam Chakraborty, Masafumi Matsuhara, Hiroshi Mabuchi (Iwate Prefectural Univ) SC2020-2 |
The purpose of this research is to improve the accuracy of recommendation systems for real-world review data. With incre... [more] | SC2020-2 pp.7-11 |
| NS, IN (Joint) |
2020-03-06 13:20 |
Okinawa | Royal Hotel Okinawa Zanpa-Misaki (Cancelled but technical report was issued) |
A New Model of Flaming Phenomena Caused by Resonance to External Stimuli in Online Social Networks Tomoya Kinoshita, Masaki Aida (Tokyo Metropolitan Univ.) IN2019-129 |
The explosive user dynamics represented by flaming phenomena in online social networks sometimes can be a bad influence ... [more] | IN2019-129 pp.303-308 |
| CQ, CBE (Joint) |
2020-01-16 10:50 |
Tokyo | NHK Science & Technology Research Laboratories | A Study on the Effect of Triads on the Wigner's Semicircle Law of Weighted Random Networks Toyoaki Taniguchi, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2019-112 |
Spectral graph theory is widely used to analyze network characteristics. In spectral graph theory, the network structur... [more] | CQ2019-112 pp.29-34 |
| IA | 2019-11-14 15:30 |
Tokyo | Kwansei Gakuin University, Tokyo Marunouchi Campus (Sapia Tower) | [Poster Presentation]
Investigation on the First Meeting Time of Random Walk Agents with Heterogeneous Transition Probability for Optimal Rendezvous Search Fumiya Toyoda, Yusuke Sakumoto (Kwansei Gakuin Univ.) IA2019-31 |
In an unstructured network~(e.g., unstructured P2P network, social network, and MANET), there is a restriction that eac... [more] |
IA2019-31 pp.43-46 |
| CQ | 2019-07-19 10:45 |
Niigata | Niigata Univ. | Deriving the Condition of Weighted Random Networks for Wigner Semicircle Law Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2019-55 |
Spectral graph theory gives an algebraical approach to analyze and design weighted networks with the eigenvalues and eig... [more] | CQ2019-55 pp.95-100 |
| IN, NS (Joint) |
2019-03-04 09:40 |
Okinawa | Okinawa Convention Center | Structural Change Models of Online Social Networks Caused by External Factors Including Mass Media Yuya Kakizawa, Masaki Aida (Tokyo Metropolitan Univ.) IN2018-86 |
In the conventional analysis of the user dynamics of online social networks, we assume a fixed structure to the given on... [more] | IN2018-86 pp.13-18 |
| CQ, CBE (Joint) |
2019-01-18 13:10 |
Tokyo | Tokyo Metropolitan Univ. | [Invited Talk]
Social Network Analysis Based on Random Matrix Theory Yusuke Sakumoto, Masaki Aida (Tokyo Metropolitan Univ.) CQ2018-87 |
Spectral graph theory gives an algebraical approach to analyze the characteristics of a network by using the matrix that... [more] | CQ2018-87 pp.65-70 |
| CAS, NLP | 2018-10-19 14:45 |
Miyagi | Tohoku Univ. | Convergence of a Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity
-- Analysis of the Case Where Algebraic Connectivity is Repeated -- Tomohisa Urakami, Norikazu Takahashi (Okayama Univ.) CAS2018-58 NLP2018-93 |
The algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, is ... [more] | CAS2018-58 NLP2018-93 pp.115-120 |
[Return to Top Page]