Kaneko, Kunitake

写真a

Affiliation

Faculty of Science and Technology, Department of Information and Computer Science (Yagami)

Position

Associate Professor

Related Websites

External Links
Page Top ▲

Profile Summary 【 Display / hide 】

  • We aim to realize information services that utilize content and data that are endlessly increasing in both quantity and volume. In particular, we are researching the design of information networks that will enable users to search for information resources across platforms based on their interests by interconnecting information platforms that are becoming increasingly fragmented over a wide area.

Page Top ▲

Career 【 Display / hide 】

  • 2006.04
    -
    2006.08

    The University of Tokyo, Frontier Informatics, Graduate School of Frontier Sciences, Research Associate

  • 2006.09
    -
    2007.03

    Keio University, Research Institute for Digital Media and Content, Research Assistant

  • 2007.04
    -
    2010.03

    Keio University, Research Institute for Digital Media and Content, Assistant Professor

  • 2010.04
    -
    2011.03

    Keio University, Research Institute for Digital Media and Content, Assistant Professor

  • 2011.04
    -
    2012.03

    Keio University, Research Institute for Digital Media and Content, Assistant Professor

display all >>

Page Top ▲

Academic Background 【 Display / hide 】

  • 1997.04
    -
    2001.03

    The University of Tokyo, School of Engineering, Department of Electrical Engineering

    University, Graduated

  • 2001.04
    -
    2003.03

    The University of Tokyo, Graduate School of Engineering, Department of Electrical Engineering

    Graduate School, Completed, Master's course

  • 2003.04
    -
    2006.03

    The University of Tokyo, Graduate School of Information Science and Technology, Department of Information and Communication Engineering

    Graduate School, Completed, Doctoral course

Page Top ▲

Academic Degrees 【 Display / hide 】

  • Ph. D, The University of Tokyo, Coursework, 2006.03

    ユーザ主導型通信制御のためのセッション層構成に関する研究

Page Top ▲
 

Research Areas 【 Display / hide 】

  • Informatics / Information network

  • Informatics / Web informatics and service informatics

  • Informatics / Entertainment and game informatics (Digital CInema)

Page Top ▲

Research Keywords 【 Display / hide 】

  • Application Oriented Networking

  • Network Architecture

  • Digital Cinema

Page Top ▲

Research Themes 【 Display / hide 】

  • Autonomous Distributed Global Information Network, 

    2020.04
    -
    Present

  • Digital Museum/Archives, 

    2014.01
    -
    Present

  • Autonomous Distributed Graph Database, 

    2012.04
    -
    Present

  • Distributed Dispersed Streaming, 

    2010.04
    -
    2019

  • Microscopic Communication Quality Observation, 

    2009.04
    -
    2019

display all >>

Page Top ▲
 

Books 【 Display / hide 】

  • JIS Z 6019 Long-term preservation for digital information by magnetic tape

    Kunitake Kaneko, Fumihiko Hasegawa, Kimio Ogawa, Michihiro Kimura, Nobuyuki Iriki, Minoru Yamaga, Akira Yoshino, Hiroshi Itagaki, Nobuaki Honda, Naoyuki Fujita, Hideki Yoshioka, Akihiro Seino, 一般財団法人 日本規格協会, 2018.01

    　View Summary

    長期間にわたる記録保存及び大容量のデータ記録に適した特性をもつ磁気テープを用い，媒体移行，台帳移行及びアーカイブプラットフォーム移行を繰り返しながら，デジタル情報を長期保存するための方法について規定。

  • 情報学基礎第2版

    慶應義塾大学理工学部編, 共立出版, 2013.11

    Scope: 6章

    　View Summary

    ネットワークを使ったサービスに関する基礎的な内容を記述している。

  • 情報学基礎

    慶應義塾大学理工学部編, 共立出版, 2013.03

    Scope: 6章

    　View Summary

    ネットワークを使ったサービスに関する基礎的な内容を記述している。

  • 映像情報メディア工学大事典

    社団法人 映像情報メディア学会編, オーム社, 2010.06

    Scope: 第10部門, 第3章, 第5節, pp.708-710

    　View Summary

    デジタルシネマ技術におけるネットワークの利用について記述している。

  • The Digital Dilemma

    T. Aoyama, S. Ono, N. Ohta, K. Kaneko, 慶應義塾大学デジタルメディア・コンテンツ統合研究機構, 2008.11

    　View Summary

    The Science and Technology Council of the Academy of Motion Picture Arts and Sciencesが出版した”The Digital Dilemma”の邦訳である。

Page Top ▲

Papers 【 Display / hide 】

  • Local community detection by random walk on hypergraphs

    Oka R., Matsumoto N., Takai Y., Ikeda M., Kaneko K.

    Communications in Statistics - Theory and Methods (Taylor & Francis)     1 - 20 2025.07

    Research paper (scientific journal), Joint Work, Last author, Accepted,  ISSN  03610926

    　View Summary

    Hypergraphs have been attracting more attention because they are suitable for representing real-world networks with complex relations of three or more terms. Clustering hypergraphs is a fundamental task in network analysis. Although several algorithms for finding a community with a theoretical guarantee are already known, almost all require information on the entire hypergraph for calculation. In this study, we propose a personalized PageRank random walk on a hypergraph and an algorithm for hypergraphs to extract a local community, which can be calculated purely locally. We experimentally show that the algorithm outperforms a benchmark method for real-world hypergraphs. We also evaluate the matching rates with the local community and weak ties using F<inf>1</inf>-scores while varying several parameters for a synthetic hypergraph generated by a stochastic block model.

  • Weighted APPR with restart for community extraction from multilayer networks

    Nakano S., Yamashita T., Shin A., Matsumoto N., Kaneko K.

    Knowledge and Information Systems (Springer)     1 - 21 2025.06

    Research paper (scientific journal), Joint Work, Last author, Accepted,  ISSN  02191377

    　View Summary

    Community extraction is widely used for various applications concerning network analysis, but its scope has mostly been confined to single-layer network. However, the real-world data are frequently represented as multilayer network, and furthermore, each layer frequently exhibits different properties. It is thus critical to be able to control to what degree each layer should be reflected in the overall network, in order to perform a reliable community extraction. In this paper, we propose a superimposition method called WAPPRS (weighted APPR with restart) that can monotonically increase the degree of reflection and handle a wide range of values for reflection. Our experiments demonstrate that our proposed model outperforms previous models when dealing with the properties desirable for reliable community extraction from multilayer networks.

  • Balancing Global Importance and Source Proximity for Personalized Recommendations Using Random Walk Length

    Yamashita T., Kaneko K.

    Lecture Notes in Computer Science (Springer)  15669   141 - 153 2025.05

    Research paper (international conference proceedings), Last author, Accepted,  ISSN  03029743

    　View Summary

    For personalized recommendation in graphs, random walks starting from the user’s interest node are known as a general-purpose and fast analysis method. Specifically, Personalized PageRank (PPR), which quantifies the importance of each node by the distribution of visited nodes in random walks, determines nodes with high global importance and source proximity. However, it is difficult to balance both influences monotonically. This paper clarifies that the random walks length is effective to monotonically control the balance of both influences on PPR vectors. In particular, we exploit the fact that correlation between PPR and PageRank values monotonically changes depending on PPR parameter that controls the average random walk length. Here, PageRank is a metric that quantifies the global importance by the probability of random walks from all nodes visiting each node. A case study using the movie rating dataset showed that nodes that are considered to be directly related to the source node get high PPR value by shortening the average random walk length. Moreover, statistical evaluation on nine real-world datasets revealed that changing the average random walk length from 1.01 to 100 resulted in a monotonic increase of the cosine similarity between PPR and PageRank vectors from 0.002 to 0.76 at the maximum.

  • Reducing Re-Indexing for Top-k Personalized PageRank Computation on Dynamic Graphs

    Yamashita T., Matsumoto N., Kaneko K.

    IEEE Transactions on Big Data (IEEE)  11 ( 4 ) 1707 - 1719 2025.01

    Research paper (scientific journal), Joint Work, Last author, Accepted

    　View Summary

    Top-k Personalized PageRank (PPR) is a graph analysis method used to determine the k most important nodes with respect to a source node. To realize fast Top-k PPR computation, indexing for each node is effective. When we apply the index-based Top-k PPR methods to dynamic graphs, the index becomes stale with edge updates, and index correction is required. Although the existing methods perform index correction for every update to guarantee Top-k PPR accuracy, they involve heavy re-indexing computation or significant memory overhead. This paper proposes a method that achieves comparable accuracy to guaranteed methods while significantly reducing re-indexing by focusing on the fact that index references are concentrated on the nodes whose index is unlikely to change due to edge updates. In particular, our method omits re-indexing as long as we achieve comparable accuracy. Furthermore, our method involves the minimum memory overhead among the existing index-based methods. The space complexity of the index is Θ (n + m), where n and m are the number of nodes and edges of the graph, respectively. The evaluation results using real-world datasets show that our method achieves more than 0.999 Normalized Discounted Cumulative Gain until 20% of edges are updated from index generation.

  • A Flexible Weighting Framework For Converting Relational Database To Hypergraphs

    Fujii K., Yamashita T., Shin A., Kaneko K.

    International Conference on Information Networking (IEEE Computer Society)     607 - 612 2025

    Research paper (international conference proceedings), Joint Work, Last author, Accepted,  ISSN  19767684

    　View Summary

    We propose a framework for converting relational databases (RDB) into hypergraphs to adjust and output various PageRank (PR) correlations by weighting hyperedges and nodes. While analyzing PR of converted graphs can reveal multifaceted information about relationships in the data, conventional methods struggled to balance the correlations between node PR and degree (NPR correlation) and edge PR and shared field records (EPR correlation). Our approach introduces two exponential weighting parameters: α for edge size, influencing EPR correlation, and β for node degree, influencing NPR correlation. By adjusting these parameters, various PR correlations can be obtained. Evaluation using real-world data demonstrate that our model can convert RDBs into hypergraphs with flexibility.

display all >>

Page Top ▲

Papers, etc., Registered in KOARA 【 Display / hide 】

display all >>

Page Top ▲

Presentations 【 Display / hide 】

  • User Controlled Media Operations on Networks Using Content Espresso & Catalogue System

    Soichiro Iwai, Daisuke Ando, Kunitake Kaneko

    CineGrid International Workshop 2015 (San Diego, CA) , 

    2015.12
    , 

    Oral presentation (general), CineGrid

  • CineGrid Exchange 2.0 Testbed Architecture Proposal

    K. Kaneko

    The 14th Annual ON*VECTOR International Photonics Workshop, 

    2015.02
    , 

    Oral presentation (general)

  • Live Rendering with Content Expresso and Catalogue

    T. Sano, T. Yamagishi, Y. Miyashita, D. Ando, F. Teraoka, K. Kaneko

    CineGrid International Workshop 2014, 

    2014.12
    , 

    Oral presentation (general)

  • Design and Prototype of Museum of Shared and Interactive Cataloguing

    K. Kaneko, Y. Miyashita, H. Ishikawa

    NODEM 2014 Conference, 

    2014.12
    , 

    Oral presentation (general)

  • Next Generation Media Platform with Order Insensitive Flow Routers

    R. Shimizu, K. Kaneko, F. Teraoka

    The 13th Annual ON*VECTOR International Photonics Workshop, 

    2014.03
    , 

    Oral presentation (general)

display all >>

Page Top ▲

Research Projects of Competitive Funds, etc. 【 Display / hide 】

  • 文化財コンテンツのデジタル表象環境に関する統合的研究

    2013
    -
    2017

    文部科学省, 私立大学戦略的研究基盤形成支援事業, Research grant, Coinvestigator(s)

  • 動的複製再配置を必要としない大容量コンテンツ配信基盤の開発

    2013
    -
    2014.03

    総務省, 先進的通信アプリケーション開発推進事業, Commissioned ｒesearch, Principal investigator

  • 新世代ネットワークを支えるネットワーク仮想化基盤技術の研究開発

    2011
    -
    2015.03

    独立行政法人情報通信研究機構, 高度通信・放送研究開発委託開発, Commissioned ｒesearch, Coinvestigator(s)

  • ドームシアターのための70mmフィルムのデジタルリマスターシステムの研究開発

    2011
    -
    2012

    独立行政法人科学技術振興機構, 研究成果展開事業（研究成果最適展開支援プログラム（A-STEP））, Principal investigator

  • 新世代ネットワークサービス基盤構築技術に関する研究開発

    2008
    -
    2011.03

    独立行政法人情報通信研究機構, 平成２０年度高度通信・放送研究開発委託研究, Commissioned ｒesearch, Principal investigator

Page Top ▲

Intellectual Property Rights, etc. 【 Display / hide 】

  • 通信装置、システム及び方法

    Date applied： 2015-148962  2015.07 

    Date announced： 2017-034305  2017.02 

    Patent, Joint

  • 動画用フィルムのスキャナ装置

    Date applied： 2012-263770  2012.11 

    Date announced： 2014-110522  2014.06 

    Date issued： 6110646  2017.03

    Patent, Joint

  • ネットワーク状態変化検出システム及びトラフィック情報保存装置及びネットワーク状態変化検出装置及び方法及びプログラム

    Date applied： 2012-085941  2012.04 

    Date announced： 2013-219435  2013.10 

    Date issued： 5801241  2015.09

    Patent, Joint

  • 同一キャプチャ情報探索方法及びシステム及びプログラム

    Date applied： 2010-238868  2010.10 

    Date announced： 2012-094998  2012.05 

    Patent, Joint

  • トラフィック計測システムおよびトラフィック計測方法

    Date applied： 2009-234366  2009.10 

    Date announced： 2011-082860  2011.04 

    Patent, Joint

display all >>

Page Top ▲

Awards 【 Display / hide 】

  • 電子情報通信学会情報ネットワーク研究会優秀発表賞

    川端由布子, 山下剛志, 金子晋丈, 2025.07, 電子情報通信学会情報ネットワーク研究会, IN2025-17 モチーフの個数に基づくエッジ再配線に対して堅牢なグラフの電子透かし

    Type of Award： Award from Japanese society, conference, symposium, etc.

  • 電子情報通信学会情報ネットワーク研究会優秀発表賞

    名取和玖, 岡松紀伸, 山下剛志, 金子晋丈, 2025.07, 電子情報通信学会情報ネットワーク研究会, IN2025-14 ランダムウォーク制御による高速なパーソナライズグラフ要約

    Type of Award： Award from Japanese society, conference, symposium, etc.

  • 電子情報通信学会情報ネットワーク研究会優秀発表賞

    山下剛志, 金子晋丈, 2025.03, 電子情報通信学会情報ネットワーク研究会, IN2024-132 特徴量ベクトル間の相関を任意かつ高速に制御可能なパーソナライズ推薦

    Type of Award： Award from Japanese society, conference, symposium, etc.

  • 電子情報通信学会情報ネットワーク研究会優秀発表賞

    山内隆史, 山下剛志, 松本直己, 金子晋丈, 2024.12, 電子情報通信学会情報ネットワーク研究会, IN2024-68 ランダムウォークのエッジ還流度に基づく小規模コミュニティ抽出手法

    Type of Award： Award from Japanese society, conference, symposium, etc.

  • 電子情報通信学会情報ネットワーク研究会優秀発表賞

    山下剛志, 松本直己, 金子晋丈, 2023.03, 電子情報通信学会情報ネットワーク研究会, IN2022-117 グラフ更新時のインデックス再生成を排したTop-k Personalized PageRank演算

    Type of Award： Award from Japanese society, conference, symposium, etc.

display all >>

Page Top ▲
 

Courses Taught 【 Display / hide 】

  • RECITATION IN INFORMATION AND COMPUTER SCIENCE

    2025

  • NETWORK ENGINEERING 1 B

    2025

  • NETWORK ENGINEERING 1 A

    2025

  • LABORATORIES IN INFORMATION AND COMPUTER SCIENCE 1B

    2025

  • LABORATORIES IN INFORMATION AND COMPUTER SCIENCE 1A

    2025

display all >>

Page Top ▲

Courses Previously Taught 【 Display / hide 】

  • 情報工学実験第一

    Keio University

    2014.04
    -
    2015.03
    , 

    Spring Semester, Laboratory work/practical work/exercise, Lecturer outside of Keio, 3h

  • ネットワークサービス特論

    Keio University

    2014.04
    -
    2015.03
    , 

    Autumn Semester, Lecture, Within own ｆaculty, 1h

  • 理工学基礎実験

    Keio University

    2014.04
    -
    2015.03
    , 

    Spring Semester, Laboratory work/practical work/exercise, Lecturer outside of Keio, 2h

  • 情報工学実験第一

    Keio University

    2013.04
    -
    2014.03
    , 

    Spring Semester, Laboratory work/practical work/exercise, Lecturer outside of Keio, 3h

  • 高品質映像基礎

    Keio University

    2013.04
    -
    2014.03
    , 

    Full academic year, Laboratory work/practical work/exercise, Lecturer outside of Keio

display all >>

Page Top ▲
 

Social Activities 【 Display / hide 】

  • JIS標準化原案作成委員会委員長（磁気テープによるデジタルデータの長期保存方法）

    2016.04
    -
    2017.03

  • Japan Digital Cinema Forum

    2013.07
    -
    2017.09

    　View Summary

    デジタルシネマに関する技術的課題を議論する異業種連携フォーラムを主宰

  • Digital Cinema Initiative Compliance Test Officer

    2008.10
    -
    Present
Page Top ▲

Memberships in Academic Societies 【 Display / hide 】

  • Society of Motion Picture and Television Engineers, 

    2009.06
    -
    Present

  • 情報処理学会, 

    2003.12
    -
    Present

  • 電子情報通信学会, 

    2001.07
    -
    Present

  • The Institute of Electrical and Electronics Engineers, Inc., 

    2001.03
    -
    Present
Page Top ▲

Committee Experiences 【 Display / hide 】

  • 2015.06
    -
    2021.06

    ネットワークシステム研究専門委員会専門委員, 電子情報通信学会

  • 2015.06
    -
    2017.05

    情報ネットワーク研究専門委員会幹事補佐, 電子情報通信学会

  • 2014.06
    -
    2019.03

    モバイルネットワークとアプリケーション研究専門委員会専門委員, 電子情報通信学会

  • 2013.05
    -
    2014.06

    モバイルマルチメディア通信研究専門委員会幹事, 電子情報通信学会

  • 2012.05
    -
    2013.05

    モバイルマルチメディア通信研究専門委員会専門委員, 電子情報通信学会

display all >>

Page Top ▲