Tetsuo IKEDA

Accelerating a Lloyd-Type k-Means Clustering Algorithm with Summable Lower Bounds in a Lower-Dimensional Space
Kazuo AOYAMA Kazumi SAITO Tetsuo IKEDA 
Publication:   
Publication Date: 2018/11/01
Vol. E101-D  No. 11  pp. 2773-2783
Type of Manuscript:  PAPER
Category: Artificial Intelligence, Data Mining
Keyword: 
algorithm, clustering, k-means, lower bound, singular value decomposition, principal component analysis, dimensionality reduction, performance, 
 Summary | Full Text:PDF
Pivot Generation Algorithm with a Complete Binary Tree for Efficient Exact Similarity Search
Yuki YAMAGISHI Kazuo AOYAMA Kazumi SAITO Tetsuo IKEDA 
Publication:   
Publication Date: 2018/01/01
Vol. E101-D  No. 1  pp. 142-151
Type of Manuscript:  PAPER
Category: Data Engineering, Web Information Systems
Keyword: 
similarity search, pivot generation, complete binary tree, 
 Summary | Full Text:PDF
Efficient Similarity Search with a Pivot-Based Complete Binary Tree
Yuki YAMAGISHI Kazuo AOYAMA Kazumi SAITO Tetsuo IKEDA 
Publication:   
Publication Date: 2017/10/01
Vol. E100-D  No. 10  pp. 2526-2536
Type of Manuscript:  PAPER
Category: Data Engineering, Web Information Systems
Keyword: 
algorithm, similarity search, index, tree, pivot, 
 Summary | Full Text:PDF
A Design Method of PLL FM Demodulators Using a Quasi-Linear Model and Digital Simulation Techniques
Yasunori IWANAMI Tetsuo IKEDA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1986/12/25
Vol. E69-E  No. 12  pp. 1318-1329
Type of Manuscript:  PAPER
Category: Communication Systems and Communication Protocols
Keyword: 
 Summary | Full Text:PDF