Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP, MSS |
2023-03-17 14:30 |
Nagasaki |
(Primary: On-site, Secondary: Online) |
Global Convergence Analysis of Distributed HALS Algorithm for Nonnegative Matrix Factorization Keiju Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2022-104 NLP2022-149 |
As a fast computational method for Nonnegative Matrix Factorization (NMF),
the Hierarchical Alternating Least Squares ... [more] |
MSS2022-104 NLP2022-149 pp.198-203 |
NLP, MSS |
2023-03-17 14:50 |
Nagasaki |
(Primary: On-site, Secondary: Online) |
Reformulation of Optimization Problem in Randomized NMF and Proposal of A Novel Iterative Update Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2022-105 NLP2022-150 |
As an approach to efficiently perform large-scale Nonnegative Matrix Factorization (NMF), a randomized NMF was recently ... [more] |
MSS2022-105 NLP2022-150 pp.204-209 |
NLP |
2022-08-02 10:15 |
Online |
Online |
A new method for the system of nonlinear equations
-- Newton-Raphson method and W4 method -- Hirotada Okawa (WIAS) NLP2022-29 |
There is no successful single method that can solve any system of nonlinear equations so far. Although the Newton-Raphs... [more] |
NLP2022-29 pp.15-19 |
NS, SR, RCS, SeMI, RCC (Joint) |
2022-07-15 13:40 |
Ishikawa |
The Kanazawa Theatre + Online (Primary: On-site, Secondary: Online) |
Performance Analysis of a Link Symmetry Confirmation Method in Backoff-based Opportunistic Routing Takuma Yamazaki (SIT), Eri Hosonuma (UT), Taku Yamazaki, Takumi Miyoshi, Thomas Silverston (SIT) NS2022-57 |
Backoff-based opportunistic routing autonomously selects a forwarder based on a random backoff time using hop counts. Ho... [more] |
NS2022-57 pp.147-150 |
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] |
2021-06-28 14:15 |
Online |
Online |
Modification of Optimization Problem in Randomized NMF and Design of Optimization Method based on HALS Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-4 IBISML2021-4 |
Nonnegative matrix factorization (NMF) is the process of decomposing a given nonnegative matrix into two nonnegative fac... [more] |
NC2021-4 IBISML2021-4 pp.23-30 |
CAS, NLP |
2018-10-19 14:45 |
Miyagi |
Tohoku Univ. |
Convergence of a Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity
-- Analysis of the Case Where Algebraic Connectivity is Repeated -- Tomohisa Urakami, Norikazu Takahashi (Okayama Univ.) CAS2018-58 NLP2018-93 |
The algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, is ... [more] |
CAS2018-58 NLP2018-93 pp.115-120 |
NLP |
2018-08-09 09:55 |
Kagawa |
Saiwai-cho Campus, Kagawa Univ. |
A Convergence Condition for the Projected Consensus Algorithm on a Network with a Fixed Topology Kosuke Kawashima, Norikazu Takahashi (Okayama Univ.) NLP2018-65 |
This report studies the problem of making the states of all agents in a network converge to the same point in the inters... [more] |
NLP2018-65 pp.63-68 |
NLP |
2017-07-13 13:00 |
Okinawa |
Miyako Island Marine Terminal |
A Newton-Type Algorithm for Nonnegative Matrix Factorization with Alpha-Divergence Satoshi Nakatsu, Norikazu Takahashi (Okayama Univ.) NLP2017-31 |
Nonnegative Matrix Factorization (NMF) is an operation that decomposes a given nonnegative matrix into two nonnegative f... [more] |
NLP2017-31 pp.17-22 |
IT, SIP, RCS |
2017-01-20 10:50 |
Osaka |
Osaka City Univ. |
A New Iterative Method for Nonnegative Matrix Factorization with Sparsity and Smoothness and Its Global Convergence Takumi Kimura, Norikazu Takahashi (Okayama Univ.) IT2016-93 SIP2016-131 RCS2016-283 |
Nonnegative Matrix Factorization (NMF) is an operation that decomposes a given nonnegative matrix into two nonnegative f... [more] |
IT2016-93 SIP2016-131 RCS2016-283 pp.273-278 |
RCS, IT, SIP |
2016-01-18 10:35 |
Osaka |
Kwansei Gakuin Univ. Osaka Umeda Campus |
Multiplicative Update for Nonnegative Matrix Factorization based on Generalized Error Function and Its Global Convergence Masato Seki, Norikazu Takahashi (Okayama Univ.) IT2015-59 SIP2015-73 RCS2015-291 |
Nonnegative Matrix Factorization (NMF) is an operation that decomposes a given nonnegative matrix into two nonnegative f... [more] |
IT2015-59 SIP2015-73 RCS2015-291 pp.67-72 |
NLP, CAS |
2015-10-05 11:35 |
Hiroshima |
Aster Plaza |
Derivation of Multiplicative Update for Constrained Optimization Problems Related to NMF and Its Global Convergence Analysis Masato Seki, Norikazu Takahashi (Okayama Univ.) CAS2015-24 NLP2015-85 |
Nonnegative matrix factorization (NMF) is an operation that decomposes a given nonnegative matrix into two nonnegative f... [more] |
CAS2015-24 NLP2015-85 pp.21-26 |
IN, NV (Joint) |
2014-07-17 11:10 |
Hokkaido |
Hokkaido Univ. |
Potential-based Routing with Optimal Feedback using Reduced Order Model for Controlled Self-organizing Networks Naomi Kuze, Daichi Kominami (Osaka Univ.), Kenji Kashima (Kyoto Univ.), Tomoaki Hashimoto, Masayuki Murata (Osaka Univ.) IN2014-32 |
Self-organizing systems have high scalability, adaptability and robustness. However, they suffer from the possibility of... [more] |
IN2014-32 pp.13-18 |
CAS, SIP, MSS, VLD, SIS [detail] |
2014-07-11 16:40 |
Hokkaido |
Hokkaido University |
Derivation of New Update Rules based on KL, Gamma, Renyi Divergences for Nonnegative Matrix Factorization Masato Seki, Norikazu Takahashi (Okayama Univ) CAS2014-47 VLD2014-56 SIP2014-68 MSS2014-47 SIS2014-47 |
Three new update rules based on Kullback-Leibler divergence, gamma-divergence and Renyi divergence for nonnegative matr... [more] |
CAS2014-47 VLD2014-56 SIP2014-68 MSS2014-47 SIS2014-47 pp.253-258 |
NLP |
2012-07-06 10:45 |
Kagoshima |
Kagoshima Sangyou Hall |
Global Convergence of a Modified Multiplicative Update Algorithm for Convex Quadratic Programming Problems with Nonnegativity Constraints Jiro Katayama, Norikazu Takahashi (Kyushu Univ.) NLP2012-50 |
We consider problems of minimizing a convex quadratic function under
nonnegativity constraints. Sha {\it et al.} propos... [more] |
NLP2012-50 pp.69-73 |
NS, IN (Joint) |
2012-03-09 15:00 |
Miyazaki |
Miyazaki Seagia |
Proposal and Evaluation of AntNet Routing Mechanism with Autonomous Zoning Naomi Kuze, Naoki Wakamiya, Masayuki Murata (Osaka Univ.) IN2011-196 |
To tackle problems emerging with rapid growth of information networks in scale and complexity, bio-inspired self-organiz... [more] |
IN2011-196 pp.353-358 |
NLP |
2011-06-30 16:05 |
Hokkaido |
Shari-cho Kohminkan: Yme-hall Shiretoko |
A Modified Multiplicative Update Algorithm for Nonnegative Matrix Factorization and its Global Convergence
-- The Case of Euclidean Distance Minimization -- Ryota Hibi, Norikazu Takahashi (Kyushu Univ.) NLP2011-32 |
Nonnegative matrix factorization (NMF) is to approximate a given large
nonnegative matrix by the product of two small n... [more] |
NLP2011-32 pp.41-46 |
CAS, NLP |
2009-01-23 13:00 |
Miyazaki |
|
On the Global Convergence of a Decomposition Method for General Convex Quadratic Programming Problems Yuta Kobayashi, Norikazu Takahashi (Kyushu Univ.) CAS2008-92 NLP2008-122 |
A convex quadratic programming (QP) problem, which plays important roles in many fields, is an optimization problem to m... [more] |
CAS2008-92 NLP2008-122 pp.159-163 |
NC |
2008-05-23 15:20 |
Ishikawa |
Kanazawa Univ |
Proposal of a nonlinear echo canceller that uses Gaussian process Jyunichiro Tomita, Yuzo Hirai (Tsukuba Univ.) NC2008-7 |
Gaussian process (GP) is a process where the joint distribution over variables is specified completely by the second-ord... [more] |
NC2008-7 pp.35-40 |
NC |
2008-01-15 13:30 |
Hokkaido |
Centennial Hall, Hokkaido Univ. |
Analytical and Numerical Solutions of Bethe Approximation in Normal Distributions Yu Nishiyama, Sumio Watanabe (Tokyo Inst. Tech.) NC2007-87 |
For the calculation of marginal distributions, which require the huge computational cost, the algorithm called belief pr... [more] |
NC2007-87 pp.1-6 |
NLP |
2007-11-22 11:55 |
Fukuoka |
|
On Global Convergence of Decomposition Methods for Support Vector Regression Jun Guo (Kyushu Univ./JSPS), Norikazu Takahashi (Kyushu Univ.) NLP2007-96 |
To solve the large size quadratic programming (QP) problems arising in support vector regression (SVR) efficiently, deco... [more] |
NLP2007-96 pp.7-12 |