Tatsuya Koyakumaru

Orcid: 0000-0002-3175-2614

According to our database1, Tatsuya Koyakumaru authored at least 3 papers between 2021 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023

2022
Efficient Robust Graph Learning Based on Minimax Concave Penalty and $\gamma$-Cross Entropy.
Proceedings of the 30th European Signal Processing Conference, 2022

2021
A Graph Learning Algorithm Based On Gaussian Markov Random Fields And Minimax Concave Penalty.
Proceedings of the IEEE International Conference on Acoustics, 2021


  Loading...