IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 38  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IN, IA
(Joint)
2023-12-21
12:30
Hiroshima Satellite Campus Hiroshima [Short Paper] A Study on the Importance of Spectral Representation of Subgraphs with Different Sampling Strategies
Koki Kato, Ryo Nakamura (Fukuoka Univ.) IA2023-43
Spectral graph theory has been actively studied to analyze topological property of networks using eigenvalues and eigenv... [more] IA2023-43
pp.1-4
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
NS, NWS
(Joint)
2023-01-26
10:55
Yamaguchi Hybrid Meeting (Yamaguchi Prefecture)
(Primary: On-site, Secondary: Online)
Autonomous Decentralized Spectral Clustering for Hierarchical Routing in Dynamic Multi-hop Wireless Networks
Naoki Matsuhashi (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2022-151
Multi-hop wireless networks are decentralized in that they do not depend on the existing communication infrastructure an... [more] NS2022-151
pp.7-12
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
IN, IA
(Joint)
2022-12-13
11:30
Hiroshima Higashi-Senda campus, Hiroshima Univ.
(Primary: On-site, Secondary: Online)
[Short Paper] For Understanding the First Meeting Time of Multiple Random Walks with Different Transition Probabilities
Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Osaki (Kwansei Gakuin Univ.) IA2022-59
Random walks on graphs have been used in various graph algorithms, and its understanding is important to design an effic... [more] IA2022-59
pp.60-63
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-27
16:55
Ishikawa Kanazawa(Ishikawa Pref.)
(Primary: On-site, Secondary: Online)
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities
Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] CQ2021-85
pp.50-55
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
MIKA
(3rd)
2021-10-28
10:30
Okinawa
(Primary: On-site, Secondary: Online)
[Poster Presentation] Adjusting Method for the Size of Clusters Generated by Autonomous Distributed Spectral Clustering in Hierarchical Routing for MANET
Naoki Matsuhashi (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.)
Hierarchical routing is necessary for scalable routing in MANETs, and autonomous distributed clustering of terminals has... [more]
NS 2021-10-07
15:10
Online Online Stability Conditions for Cluster Structures Generated by Autonomous Distributed Spectral Clustering in Hierarchical Routing for MANET
Naoki Matsuhashi (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2021-72
Scalable routing in MANETs requires hierarchical routing, and autonomous distributed clustering of terminals has been st... [more] NS2021-72
pp.22-27
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
IA 2021-09-08
10:55
Online Online Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory
Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-17
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] IA2021-17
pp.14-21
IN, CCS
(Joint)
2021-08-05
14:00
Online Online A Spectral-based Model of Polarization in Online Social Networks
Tomoya Kinoshita, Masaki Aida (Tokyo Metropolitan Univ.) CCS2021-15
The phenomenon known as ``polarization,'' in which a social group splits into two or more groups, can hurt social activi... [more] CCS2021-15
pp.1-6
PN, NS, OCS
(Joint)
2021-06-25
11:10
Online Online Spectral clustering with an autonomous distributed manner for hierarchical routing of MANET
Naoki Matsuhashi (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2021-30
MANET is a communication system that does not depend on the communication infrastructure and is expected to be a means o... [more] NS2021-30
pp.27-32
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
 Results 1 - 20 of 38  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan