| 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 # | |
| CQ | 2019-05-31 10:55 |
Hiroshima | Hiroshima City University | Analysis of the Benefit of Predicting Attack Strategies for Improving the Robustness of Networks via Link Addition Yoichi Onoue, Sho Tsugawa (Univ. of Tsukuba)  CQ2019-25 |
Link addition is a promising approach for improving the robustness of networks against intentional attacks. Existing li... [more] | CQ2019-25 pp.67-72 |
| 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 |
| ICSS, IA | 2018-06-26 09:50 |
Ehime | Ehime University | Proposal of Sparse-Modeling based Approach for Betweenness Centrality Estimation Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2018-10 ICSS2018-10 |
In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations u... [more] | IA2018-10 ICSS2018-10 pp.61-66 |
| COMP | 2018-03-05 15:30 |
Osaka | Osaka Prefecture Univ. | Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) COMP2017-51 |
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] | COMP2017-51 pp.35-42 |
| 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] | |
| LOIS, ICM | 2018-01-18 15:40 |
Kumamoto | Sojo University | [Invited Talk]
Extension of node centralities based on the oscillation model on networks
-- Pursuit understanding underlying mechanism of node centrality -- Chisa Takano (Hiroshima City Univ.) ICM2017-41 LOIS2017-57 |
Recently, on the Internet, bidirectional communication which promotes the connection between people is actively performe... [more] | ICM2017-41 LOIS2017-57 pp.49-50 |
| 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 |
| HCGSYMPO (2nd) |
2017-12-13 - 2017-12-15 |
Ishikawa | THE KANAZAWA THEATRE | Analysis of social networks considering connective property to social actors within two degrees of separation Shun-ichi Amano, Ken-ichiro Ogawa, Yosihiro Miyake (Tokyo Tech) |
In order to analyze the structure of connection between social actors in a social group, social network analysis has bee... [more] | |
| NS | 2017-10-27 10:45 |
Osaka | I-site nanba | Betweenness Computation using Graph Compression Kazuharu Aramaki, Nattapong Kitsuwan (UEC), Eiji Oki (Kyoto-u) NS2017-108 |
Computation method for the betweenness centrality of every vertex in a graph is proposed in this paper. The proposed met... [more] | NS2017-108 pp.83-87 |
| CCS | 2017-08-10 16:30 |
Hokkaido | Bibai Onsen Yu-rinkan | Rethinking the Meaning of Eigenvector Centrality Based on the Scaled Laplacian Matrix Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) CCS2017-12 |
When we analyze the dynamics on the social media network, it is important to evaluate the strength of the activity of ea... [more] | CCS2017-12 pp.13-18 |
| MSS | 2017-03-16 16:30 |
Shimane | Shimane Univ. | A derivational criterion for measuring edge importance by means of leveling variables on nodes Kento Hamada, Eiichi takazawa, Norihiko Shinomiya (Soka Univ.) MSS2016-88 |
This paper proposes a new measure of edge importance with taking the propagation behavior of information on a network in... [more] | MSS2016-88 pp.39-41 |
| CAS, NLP | 2016-10-28 09:55 |
Tokyo | Characteristics Analysis for Significance of Edges in a Graph by means of Leveling Variables on Nodes Eiichi Takazawa, Kento Hamada, Norihiko Shinomiya (Soka Univ.) CAS2016-52 NLP2016-78 |
This paper proposes a measure for significance of an edge with considering propagation of information quantity. This mea... [more] | CAS2016-52 NLP2016-78 pp.75-78 |
|
| NLP | 2016-09-15 11:05 |
Hyogo | Konan Univ. | A Fast Method for Finding the Edge to be Inserted to Minimize Betweenness Centrality of a Specified Vertex Toshiyuki Namba, Tatsuki Kohno, Norikazu Takahashi (Okayama Univ.) NLP2016-56 |
Betweenness centrality is a measure that represents the importance of each vertex of a graph. From the viewpoint of the ... [more] | NLP2016-56 pp.63-68 |
| VLD, CAS, MSS, SIP | 2016-06-16 12:00 |
Aomori | Hirosaki Shiritsu Kanko-kan | Significance Analysis for Edges in a Graph by means of Leveling Variables on Nodes Kento Hamada, Norihiko Shinomiya (Soka Univ.) CAS2016-8 VLD2016-14 SIP2016-42 MSS2016-8 |
This paper proposes a novel edge significance considering a propagation property. The significance is quantified with a ... [more] | CAS2016-8 VLD2016-14 SIP2016-42 MSS2016-8 pp.41-45 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2016-03-07 14:10 |
Okinawa | Proposal of New Index for Describing Node Centralities Based on Oscillation Dynamics on Networks Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) CQ2015-123 |
Since recent rapid development of information network technology activates the information exchange on the social networ... [more] | CQ2015-123 pp.89-94 |
|
| 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 | 2015-01-30 11:30 |
Tokyo | Tokyo Metropolitan University (Akihabara Satellite Campus) | On Selecting Multiple Leader Nodes for Distributed Network Control Hideki Shindo, Genya Ishigaki, Norihiko Shinomiya (Soka Univ .) CAS2014-115 |
This paper formulates a minimization problem of distance between leader nodes of some adjacent tie-sets and solve the pr... [more] | CAS2014-115 pp.55-57 |
| IN | 2015-01-23 11:35 |
Aichi | Nagoya International Center | A closeness centrality-aware DSDV routing on ad-hoc network Kensuke Kusumoto, Yoshihiro Kaneko (Gifu Univ.) IN2014-110 |
Represented by smart phones of recent years, the progress of high-performance terminal continues in wireless network sys... [more] | IN2014-110 pp.71-75 |
| CQ | 2014-07-10 11:15 |
Osaka | Analysis of the Robustness of Degree Centrality against Random Errors in Graphs Sho Tsugawa (Univ. of Tsukuba), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2014-18 |
Network analyses, which analyze the topological structure of large-scale complex networks such as social networks, brain... [more] | CQ2014-18 pp.19-24 |
|
| 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 |
[Return to Top Page]