default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTohru Nitta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Yuto Okawa, Suguru Kanoga
, Takayuki Hoshino, Tohru Nitta:
Sequential Learning on sEMGs in Short- and Long-term Situations via Self-training Semi-supervised Support Vector Machine. EMBC 2022: 3183-3186- 2021
- [c14]Yuto Okawa, Tohru Nitta:
Learning Properties of Feedforward Neural Networks Using Dual Numbers. APSIPA ASC 2021: 187-192 - 2020
- [c13]Tohru Nitta, Hui Hu Gan:
Fundamental Structure of Orthogonal Variable Commutative Quaternion Neurons. SCIS/ISIS 2020: 1-3
2010 – 2019
- 2019
- [j16]Tohru Nitta, Masaki Kobayashi, Danilo P. Mandic:
Hypercomplex Widely Linear Estimation Through the Lens of Underpinning Geometry. IEEE Trans. Signal Process. 67(15): 3985-3994 (2019) - 2018
- [j15]Tohru Nitta, Yasuaki Kuroe:
Hyperbolic Gradient Operator and Hyperbolic Back-Propagation Learning Algorithms. IEEE Trans. Neural Networks Learn. Syst. 29(5): 1689-1702 (2018) - [i2]Tohru Nitta:
Weight Initialization without Local Minima in Deep Nonlinear Neural Networks. CoRR abs/1806.04884 (2018) - 2017
- [j14]Tohru Nitta:
Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks. IEEE Trans. Neural Networks Learn. Syst. 28(10): 2282-2293 (2017) - 2016
- [c12]Tohru Nitta:
On the Singularity in Deep Neural Networks. ICONIP (4) 2016: 389-396 - 2015
- [j13]Tohru Nitta:
Learning Dynamics of a Single Polar Variable Complex-Valued Neuron. Neural Comput. 27(5): 1120-1141 (2015) - [j12]Yili Xia, Cyrus Jahanchahi, Tohru Nitta, Danilo P. Mandic:
Performance Bounds of Quaternion Estimators. IEEE Trans. Neural Networks Learn. Syst. 26(12): 3287-3292 (2015) - 2014
- [c11]Tohru Nitta:
Plateau in a Polar Variable Complex-valued Neuron. ICAART (1) 2014: 526-531 - 2013
- [j11]Tohru Nitta:
Local minima in hierarchical structures of complex-valued neural networks. Neural Networks 43: 1-7 (2013) - [c10]Tohru Nitta:
Neural Networks with Comparatively Few Critical Points. KES 2013: 269-275 - [i1]Eckhard Hitzer, Tohru Nitta, Yasuaki Kuroe:
Applications of Clifford's Geometric Algebra. CoRR abs/1305.5663 (2013) - 2012
- [j10]Tohru Nitta:
Learning Transformations with Complex-Valued Neurocomputing. Int. J. Organ. Collect. Intell. 3(2): 81-116 (2012) - 2011
- [c9]Tohru Nitta:
Widely Linear Processing of Hypercomplex Signals. ICONIP (1) 2011: 519-525
2000 – 2009
- 2009
- [j9]Tohru Nitta:
Erratum: "the uniqueness Theorem for Complex-Valued Neural Networks with Threshold Parameters and the Redundancy of the Parameters". Int. J. Neural Syst. 19(2): 137 (2009) - [r1]Tohru Nitta:
Complex-Valued Neural Networks. Encyclopedia of Artificial Intelligence 2009: 361-366 - 2008
- [j8]Tohru Nitta:
The uniqueness Theorem for Complex-Valued Neural Networks with Threshold Parameters and the Redundancy of the Parameters. Int. J. Neural Syst. 18(2): 123-134 (2008) - [c8]Tohru Nitta, Sven Buchholz:
On the decision boundaries of hyperbolic neurons. IJCNN 2008: 2974-2980 - 2004
- [j7]Tohru Nitta:
Orthogonality of Decision Boundaries in Complex-Valued Neural Networks. Neural Comput. 16(1): 73-97 (2004) - 2003
- [j6]Tohru Nitta:
On the inherent property of the decision boundary in complex-valued neural networks. Neurocomputing 50: 291-303 (2003) - [j5]Tohru Nitta:
Solving the XOR problem and the detection of symmetry using a single complex-valued neuron. Neural Networks 16(8): 1101-1105 (2003) - [j4]Tohru Nitta:
The uniqueness theorem for complex-valued neural networks and the redundancy of the parameters. Syst. Comput. Jpn. 34(14): 54-62 (2003) - [c7]Tohru Nitta:
The Computational Power of Complex-Valued Neuron. ICANN 2003: 993-1002 - 2002
- [j3]Tohru Nitta:
Redundancy of the parameters of the complex-valued neural network. Neurocomputing 49(1-4): 423-428 (2002) - 2000
- [j2]Tohru Nitta:
An Analysis of the Fundamental Structure of Complex-Valued Neurons. Neural Process. Lett. 12(3): 239-246 (2000)
1990 – 1999
- 1999
- [c6]Kenji Nishida, Tohru Nitta, Toshio Tanaka:
Emotion Memory Model. Applied Informatics 1999: 222-225 - 1998
- [c5]Tohru Nitta:
The Stability of the Solution in Fully Connected Neural Networks with the Encouragement Factor. ICONIP 1998: 518-521 - 1997
- [j1]Tohru Nitta:
An Extension of the Back-Propagation Algorithm to Complex Numbers. Neural Networks 10(8): 1391-1415 (1997) - [c4]Tohru Nitta:
The Supremum and the Infimum of the Encouragement Factor in the Gaussian Machine. ICONIP (1) 1997: 482-485 - 1995
- [c3]Tohru Nitta:
Ability of the complex backpropagation algorithm to learn similar transformation. ICNN 1995: 1513-1516 - [c2]Tohru Nitta:
A quaternary version of the back-propagation algorithm. ICNN 1995: 2753-2756 - 1993
- [c1]Tohru Nitta:
An Extension of the Back-Propagation Algorithm to Three Dimensions by Vector Product. ICTAI 1993: 460-461
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
