| 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 # | |
| IN, IA (Joint) |
2022-12-13 09:50 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
A Study on Obfuscation of Node Centrality in Large-Scale Networks Hiroki Kawamura, Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.)  IA2022-55 |
Node centrality (e.g., degree centrality, eigenvector centrality, betweenness centrality), which is determined by the ne... [more] | IA2022-55 pp.40-46 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2020-03-06 14:20 |
Fukuoka | Kyushu Institute of Technology (Cancelled but technical report was issued) |
Analysis of the Time Evolution of Influence and Spreading Power of Twitter Users Minami Uehara, Sho Tsugawa (Univ. of Tsukuba) CQ2019-154 |
For a successful viral marketing campaign on social media, it is important to spread information to many users. The siz... [more] | CQ2019-154 pp.101-106 |
| CQ | 2018-07-20 15:45 |
Miyagi | Tohoku Univ. | An Analysis of the Evolution of Influence of Central Users on Social Media Minami Uehara, Sho Tsugawa (Tsukuba univ.) CQ2018-44 |
Finding influencers who can spread information to many other users on social media is important for several application ... [more] | CQ2018-44 pp.75-80 |
| CQ (2nd) |
2018-01-20 12:50 |
Tokyo | Nishiwaseda Campus, Waseda Univ. | [Poster Presentation]
An Analysis on the Relation between Degree Centrality of Nodes and their Future Influence in Social Networks Minami Uehara, Sho Tsugawa (Tsukuba Univ.) |
Identifying influential nodes in a social network is a fundamental research task in the network science research field. ... [more] | |
| CQ | 2018-01-18 10:45 |
Tokyo | NII | On the Effectiveness of Influence Measures for Identifying Influencers and their Correlations in Social Networks Shumpei Takemura, Sho Tsugawa (UoT) CQ2017-88 |
Identifying influential nodes in social networks is one of the important research topics in the field of network science... [more] | CQ2017-88 pp.17-22 |
| MSS, CAS, SIP, VLD | 2015-06-17 13:45 |
Hokkaido | Otaru University of Commerce | The characteristic of routes selected by degree centrality-aware distance vector routing Yoshihiro Kaneko (Gifu Univ.) CAS2015-8 VLD2015-15 SIP2015-39 MSS2015-8 |
In the research area of ad-hoc network, distance vector-type routing is fundamental. This network requires no fixed infr... [more] | CAS2015-8 VLD2015-15 SIP2015-39 MSS2015-8 pp.43-48 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 14:20 |
Hokkaido | Hokkaido University | The rank difference of subgraph centrality among local graphs Kesisuke Watanabe, Ishii Yuuhei, Yoshihiro Kaneko (Gifu Univ.) CAS2014-12 VLD2014-21 SIP2014-33 MSS2014-12 SIS2014-12 |
For centrality measure of nodes in a network system, we consider how correctly it is that each node guesses how central ... [more] | CAS2014-12 VLD2014-21 SIP2014-33 MSS2014-12 SIS2014-12 pp.55-58 |
| CQ, MVE, IE, IMQ, CEA (Joint) [detail] |
2014-03-07 14:15 |
Oita | Beppu International Convention Center | Graph Entropy as a Measure for Estimating Robustness of Centrality Measures against Imperfections of Graphs Masanori Ishino (Osaka Univ.), Sho Tsugawa (Univ. of Tsukuba), Hiroyuki Ohsaki (Kwansei Gakuin Univ.), Toru Hasegawa (Osaka Univ.) CQ2013-101 |
Complex network analysis has been actively pursued to investigate the characteristics of large-scale complex networks. G... [more] | CQ2013-101 pp.71-76 |
| IN | 2012-01-26 14:55 |
Hokkaido | Asahikawa-Terminal-Hotel | On the Robustness of Centrality Measures against Link Weight Quantization in Social Network Analysis Yukihiro Matsumoto, Sho Tsugawa, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ) IN2011-124 |
Researches on social network analyses have been actively performed. In social network analysis, individuals are repres... [more] |
IN2011-124 pp.23-28 |
| COMP | 2011-10-21 10:35 |
Miyagi | Tohoku Univ. | Fast Algorithm for Finding a Graph Node with High Closeness Centrality Koji Tabata, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2011-29 |
The Closeness Centrality is one of centrality measures of a node in a graph. It is calculated as the reciprocal of the ... [more] |
COMP2011-29 pp.7-14 |
[Return to Top Page]