Aoyama Kazuo 青山一生

… Alternative Names

青山一生アオヤマカズオ

AOYAMA Kazuo 青山一生

Less

Researcher Number	80447028
Affiliation (Current)	2025: 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, その他部局等, 主任研究員
Affiliation (based on the past Project Information) *help	2017 – 2019: 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, その他部局等, 主任研究員 2010: 日本電信電話株式会社 NTTコミュニケーション科学基礎研究所, 協創情報研究部, 主任研究員 2008 – 2010: 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, 協創情報研究部, 主任研究員
Review Section/Research Field	Except Principal Investigator Multimedia database / Media informatics/Database
Keywords	Except Principal Investigator 可視化 / クラスリング / 縮小写像 / クラスタリング / 情報検索 / 探索問題 / ディレクトリ / 機械学習 / ディレクトリ・情報検索 / 大規模データ … More / アルゴリズム / 索引構造 / 探索 / スモールワールド / 複雑ネットワーク Less

Speeding up the clustering methods with summable lower bounds in contractive mappings
- Principal Investigator
  
  IKEDA Tetsuo
- Project Period (FY)
  2017 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Multimedia database
- Research Institution
  University of Shizuoka
Fast similarity search methods for large-scale and high-dimensional data sets by using complex networks
- Principal Investigator
  
  UEDA Naonori
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Media informatics/Database
- Research Institution
  NTT Communication Science Laboratories

All 2020 2018 2017 2011 2010 2009 2008 Other

All Journal Article Presentation Book

[Book] Studies in Computational Intelligence, Springer2009
- Author(s)
  K.Aoyama, K.Saito, T.Yamada, N.Ueda
- Publisher
  Fast similarity search in small-world networks in Complex Networks
- Data Source
  KAKENHI-PROJECT-20500109
[Journal Article] Inverted-File k-Means Clustering: Performance Analysis2020
- Author(s)
  Kazuo Aoyama, Kazumi Saito, Tetsuo Ikeda
- Journal Title
  
  arXiv:2002.09094
  
  Volume: －
- Open Access
- Data Source
  KAKENHI-PROJECT-17K00159
[Journal Article] Pivot Generation Algorithm with a Complete Binary Tree for Efficient Exact Similarity Search2018
- Author(s)
  Yuki Yamagishi, Kazuo Aoyama, Kazumi Saito, and Tetsuo Ikeda
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E101.D Issue: 1 Pages: 142-151
- DOI
  10.1587/transinf.2017EDP7077
- NAID
  130006301174
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00159, KAKENHI-PROJECT-16J11909
[Journal Article] Accelerating a Lloyd-Type k-Means Clustering Algorithm with Summable Lower Bounds in a Lower-Dimensional Space2018
- Author(s)
  AOYAMA Kazuo、SAITO Kazumi、IKEDA Tetsuo
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E101.D Issue: 11 Pages: 2773-2783
- DOI
  10.1587/transinf.2017EDP7392
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2018-11-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00159
[Journal Article] Efficient Similarity Search with a Pivot-Based Complete Binary Tree2017
- Author(s)
  Yuki Yamagishi, Kazuo Aoyama, Kazumi Saito, and Tetsuo Ikeda
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E100.D Issue: 10 Pages: 2526-2536
- DOI
  10.1587/transinf.2017EDP7100
- NAID
  130006110304
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00159, KAKENHI-PROJECT-16J11909
[Journal Article]2009
- Author(s)
  K.Aoyama, K.Saito, T.Yamada, N.Ueda
- Journal Title
  
  Fast similarity search in small-world networks, Complex Networks, Studies in Computational Intelligence(Springer Berlin/Heidelberg)
  
  Pages: 185-196
- Data Source
  KAKENHI-PROJECT-20500109
[Journal Article] グラフ索引構造を用いた高速類似探索電子2009
- Author(s)
  青山一生、斉藤和巳、山田武士、上田修功
- Journal Title
  
  情報通信学会論文誌D J92-D
  
  Pages: 1543-1554
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500109
[Journal Article] グラフ索引構造を用いた高速類似探索2009
- Author(s)
  青山一生, 斉藤和巳, 山田武士, 上田修功
- Journal Title
  
  電子情報通信学会論文誌D:情報・システム J92-D
  
  Pages: 1543-1554
- NAID
  110007361121
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500109
[Journal Article] グラフ索引構造を用いた高速類似探索
- Author(s)
  青山一生、斉藤和巳、山田武士、上田修功
- Journal Title
  
  電子情報通信学会論文誌D:情報・システム
- NAID
  110007361121
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] 貪欲到達中心性によるネットワーク探索性能の特徴付け2017
- Author(s)
  宋鵬, 斉藤和巳, 池田哲夫, 青山一生
- Organizer
  第16回情報科学技術フォーラム（FIT2017）
- Data Source
  KAKENHI-PROJECT-17K00159
[Presentation] Fast Approximate Similarity Search Based on Degree-Reduced Neighborhood Graphs2011
- Author(s)
  K.Aoyama, K.Saito, H.Sawada, N.Ueda
- Organizer
  17^<th> ACM SIGKDD Conference on Knowledge Discovery and Data Mining(KDD-2011)
- Place of Presentation
  Manchester Grand Hyatt, San Diego, USA
- Year and Date
  2011-08-21
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] Fast similarity search on a large speech data set with neighborhood graph indexing2010
- Author(s)
  K.Aoyama, S.Watanabe, H.Sawada, Y.Minami, N.Ueda, K,Saito.
- Organizer
  IEEE Int.Conf.Acoustics, Speech and Signal Processing(ICASSP2010)
- Place of Presentation
  Dallas, Texas, USA
- Year and Date
  2010-03-19
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] ネットワーク構造による類似探索性能の分析法の提案2010
- Author(s)
  外岡達也, 小出明弘, 斉藤和巳, 青山一生, 澤田宏, 上田修功
- Organizer
  第9回情報科学技術フォーラム(FIT2010)
- Place of Presentation
  福岡県福岡市,九州大学
- Year and Date
  2010-09-08
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] オブジェクト集合に依存したRNGの特性分析2010
- Author(s)
  小出明弘、外岡達也、斉藤和巳、青山一生、澤田宏、上田修功
- Organizer
  第9回情報科学技術フォーラム(FIT2010)
- Place of Presentation
  九州大学福岡市
- Year and Date
  2010-09-08
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] オブジェクト集合に依存したRNGの特性分析2010
- Author(s)
  小出明弘, 外岡達也, 斉藤和巳, 青山一生, 澤田宏, 上田修功
- Organizer
  第9回情報科学技術フォーラム(FIT2010)
- Place of Presentation
  福岡県福岡市,九州大学
- Year and Date
  2010-09-08
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] ネットワーク構造による類似探索性能の分析法の提案2010
- Author(s)
  外岡達也、小出明弘、斉藤和巳、青山一生、澤田宏、上田修功
- Organizer
  第9回情報科学技術フォーラム(FIT2010)
- Place of Presentation
  九州大学福岡市
- Year and Date
  2010-09-08
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] Fast similarity search in small-world networks2009
- Author(s)
  K.Aoyama, K.Saito, T.Yamada, N.Ueda
- Organizer
  Int.Workshop on Complex Networks(CompleNet2009)
- Place of Presentation
  University of Catania, Catania, Italy
- Year and Date
  2009-05-26
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] Fast similarity search in small-world networks2009
- Author(s)
  K. Aoyama, K. Saito, T. Yamada, N. Ueda
- Organizer
  International Workshop on Complex Networks (CompleNet 2009)
- Place of Presentation
  University of Catania, Catania, Italy
- Year and Date
  2009-05-26
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] Fast similarity search in small-world networks2009
- Author(s)
  K.Aoyama, K.Saito, T.Yamada, N.Ueda
- Organizer
  Int.Workshop on Complex Networks(ComplNet2009)
- Place of Presentation
  Catania, Italy
- Year and Date
  2009-05-26
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] ネットワーク索引構造を用いた類似探索と可視化2008
- Author(s)
  青山一生, 斉藤和巳, 山田武士, 上田修功
- Organizer
  第7回情報科学技術フォーラム
- Place of Presentation
  慶應義塾大学湘南藤沢キャンパス
- Year and Date
  2008-09-04
- Data Source
  KAKENHI-PROJECT-20500109
[Presentation] ネットワーク索引構造を用いた類似探索と可視化2008
- Author(s)
  青山一生、斉藤和巳、山田武士、上田修功
- Organizer
  第7回情報科学技術フォーラム
- Place of Presentation
  慶應義塾大学、湘南藤沢
- Year and Date
  2008-09-04
- Data Source
  KAKENHI-PROJECT-20500109

1. SAITO Kazumi (80379544)

# of Collaborated Projects: 2 results

# of Collaborated Products: 18 results
2. UEDA Naonori (60379568)

# of Collaborated Projects: 1 results

# of Collaborated Products: 16 results
3. YAMADA Takeshi (50396115)

# of Collaborated Projects: 1 results

# of Collaborated Products: 10 results
4. SAWADA Hiroshi (10396210)

# of Collaborated Projects: 1 results

# of Collaborated Products: 6 results
5. IKEDA Tetsuo (60363727)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results

Aoyama Kazuo 青山 一生

青山 一生 アオヤマ カズオ

AOYAMA Kazuo 青山 一生

Research Projects

Research Products

Co-Researchers

Speeding up the clustering methods with summable lower bounds in contractive mappings

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Fast similarity search methods for large-scale and high-dimensional data sets by using complex networks

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Book] Studies in Computational Intelligence, Springer2009

Author(s)

Publisher

Data Source

[Journal Article] Inverted-File k-Means Clustering: Performance Analysis2020

Author(s)

Journal Title

Data Source

[Journal Article] Pivot Generation Algorithm with a Complete Binary Tree for Efficient Exact Similarity Search2018

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] Accelerating a Lloyd-Type k-Means Clustering Algorithm with Summable Lower Bounds in a Lower-Dimensional Space2018

Author(s)

Journal Title

DOI

ISSN

Year and Date

Language

Data Source

[Journal Article] Efficient Similarity Search with a Pivot-Based Complete Binary Tree2017

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article]2009

Author(s)

Journal Title

Data Source

[Journal Article] グラフ索引構造を用いた高速類似探索電子2009

Author(s)

Journal Title

Data Source

[Journal Article] グラフ索引構造を用いた高速類似探索2009

Author(s)

Journal Title

NAID

Data Source

[Journal Article] グラフ索引構造を用いた高速類似探索

Author(s)

Journal Title

NAID

Data Source

[Presentation] 貪欲到達中心性によるネットワーク探索性能の特徴付け2017

Author(s)

Organizer

Data Source

[Presentation] Fast Approximate Similarity Search Based on Degree-Reduced Neighborhood Graphs2011

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] Fast similarity search on a large speech data set with neighborhood graph indexing2010

Author(s)

Aoyama Kazuo 青山一生

青山一生アオヤマカズオ

AOYAMA Kazuo 青山一生