Presentation 2018-03-08
Efficient orthogonalization method for eigenvectors of the Laplacian matrix for estimation of social network structure
Naoki Hirakura, Chisa Takano, Masaki Aida,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The network resonance method enable us to observe partial information of eigenvalues and eigenvectors that describe the structure of social networks.Also, it is possible to determine the original Laplacian matrix from a portion of eigenvalues and eigenvectors by using compressed sensing.However, the network resonance method gives only the information of absolute values of the eigenvector elements.In this paper, we propose an efficient method to determine signs of eigenvector elements and show its computational complexity is polynomial time.We also show that we can further reduce the computational complexity by using compressed sensing.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) social network / compressed sensing / parallel processing / branch and bound
Paper # CQ2017-111
Date of Issue 2018-03-01 (CQ)

Conference Information
Committee CQ / MVE / IE / IMQ
Conference Date 2018/3/8(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Okinawa Industry Support Center
Topics (in Japanese) (See Japanese page)
Topics (in English) Five Senses Media, Cooking and Eating Activities Media, Multimedia, Media Experience, Video Encoding, Image Media Quality, Network Quality and Reliability, etc. (Co-sponsor: Technical Committee on Multimedia on Cooking and Eating Activities (CEA))
Chair Takanori Hayashi(Hiroshima Inst. of Tech.) / Yoshinari Kameda(Univ. of Tsukuba) / Takayuki Hamamoto(Tokyo Univ. of Science) / Kenji Sugiyama(Seikei Univ.)
Vice Chair Hideyuki Shimonishi(NEC) / Jun Okamoto(NTT) / Kenji Mase(Nagoya Univ.) / Kazuya Kodama(NII) / Hideaki Kimata(NTT) / Toshiya Nakaguchi(Chiba Univ.) / Mitsuru Maeda(Canon)
Secretary Hideyuki Shimonishi(NTT) / Jun Okamoto(Keio Univ.) / Kenji Mase(Kyoto Univ.) / Kazuya Kodama(NTT) / Hideaki Kimata(Kyushu Univ.) / Toshiya Nakaguchi(Nagoya Univ.) / Mitsuru Maeda(KDDI Research)
Assistant Kenko Ota(Nippon Inst. of Tech.) / Norihiro Fukumoto(KDDI Research Inc.) / Ryo Yamamoto(UEC) / Takatsugu Hirayama(Nagoya Univ.) / Ryosuke Aoki(NTT) / Yasutaka Matsuo(NHK) / Kazuya Hayase(NTT) / Masaru Tsuchida(NTT) / Gosuke Ohashi(Shizuoka Univ.)

Paper Information
Registration To Technical Committee on Communication Quality / Technical Committee on Media Experience and Virtual Environment / Technical Committee on Image Engineering / Technical Committee on Image Media Quality
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient orthogonalization method for eigenvectors of the Laplacian matrix for estimation of social network structure
Sub Title (in English)
Keyword(1) social network
Keyword(2) compressed sensing
Keyword(3) parallel processing
Keyword(4) branch and bound
1st Author's Name Naoki Hirakura
1st Author's Affiliation Tokyo Metropolitan University(Tokyo Metropolitan Univ.)
2nd Author's Name Chisa Takano
2nd Author's Affiliation Hiroshima City University(Hiroshima City Univ.)
3rd Author's Name Masaki Aida
3rd Author's Affiliation Tokyo Metropolitan University(Tokyo Metropolitan Univ.)
Date 2018-03-08
Paper # CQ2017-111
Volume (vol) vol.117
Number (no) CQ-486
Page pp.pp.45-50(CQ),
#Pages 6
Date of Issue 2018-03-01 (CQ)