Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Youichi Kobuchi

dblp:36/6086 · DBLP profile ↗
← Back
22ranked-venue papers
12as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 7 first-authorArtificial intelligence and machine learning · 8 · 4 first-authorDatabases, data management, data science and information retrieval · 5 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 61% Computational complexity · 39%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal grammars
grammar systems
0.021981
On the Complete Simulation of DOL Schemes and Locally Catenative Schemes · Inf. Control. 1981
Decision Problems of Locally Catenative Property for DIL Systems · Inf. Control. 1979
Automata and formal languages
l systems
0.011981
On the Complete Simulation of DOL Schemes and Locally Catenative Schemes · Inf. Control. 1981
Computational complexity
decision problems
0.011979
Decision Problems of Locally Catenative Property for DIL Systems · Inf. Control. 1979
YearPublicationVenuePosition
2004 SOM algorithms and their stability consideration
Youichi Kobuchi, Masataka Tanoue
ESANN1
2004 Learning and forgetting - how they should be balanced in SOM algorithm
abstract
A two layered neural network is considered as Kohonen's dot-product type SOM model. It defines pattern classifiers through step by step self-organization. This note examines the role of learning rate /spl alpha/ and forgetting rate /spl delta/ in such SOM algorithms. The properties we consider are the relation between stability of winner functions and topographic mapping formation. We propose three classes of networks defining corresponding winner functions. They depend on the two parameters or their ratio K, and the former class includes the latter and the most restrictive class is here called K-topographic. The main result is 1) we can define such topographic networks depending on the ratio K and 2) once a network belongs to this K-topographic class we can maintain the property in the evolution process if we choose /spl alpha/ and /spl delta/ appropriately. Thus the stability and topographic property are related in this generalized SOM algorithm.
Youichi Kobuchi, Masataka Tanoue
IJCNN1
2004 Stability of generalized topographic mappings between cell layers through correlational learning
Shouji Sakamoto, Shigeko Seki, Youichi Kobuchi
Neural Networks3
2003 Cellular topographic self-organization under correlational learning
Shouji Sakamoto, Shigeko Seki, Youichi Kobuchi
ESANN3
2000 Semantics analysis through elementary meanings
Youichi Kobuchi, Takashi Saito, Hidenobu Nunome
Acta Informatica1
2000 Convergence property of topographic mapping formation from cell layer to cell layer through correlation learning rule
Shouji Sakamoto, Youichi Kobuchi
Neural Networks2
1998 Self-Organization of Topographic Mappings from Cell Layer to Cell Layer through Generalized Hebb Rules
Shouji Sakamoto, Youichi Kobuchi
ICONIP2
1997 Order between logic networks and stable neural networks
Youichi Kobuchi
ESANN1
1994 Invariant Sets for Substitution
Taishin Y. Nishida, Youichi Kobuchi
J. Comput. Syst. Sci.2
1992 Order of State Functions and Logic Functions
Youichi Kobuchi
Inf. Process. Lett.1
1991 State evaluation functions and Lyapunov functions for neural networks
Youichi Kobuchi
Neural Networks1
1991 On Standard Locally Catenative L Schemes
Shigeko Seki, Youichi Kobuchi
Theor. Comput. Sci.2
1987 A Note on Symmetrical Cellular Spaces
Youichi Kobuchi
Inf. Process. Lett.1
1987 Repeatable Words for Substitution
Taishin Y. Nishida, Youichi Kobuchi
Theor. Comput. Sci.2
1984 Recurrent Words for Substitution
Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi
Math. Syst. Theory3
1983 Stability of Desynchronized 0L Systems
Youichi Kobuchi
Inf. Process. Lett.1
1981 On the Complete Simulation of DOL Schemes and Locally Catenative Schemes
Youichi Kobuchi, Derick Wood
Inf. Control.1
1980 On DIL Schemes Simulated by D0L Schemes
Shigeko Seki, Youichi Kobuchi
J. Comput. Syst. Sci.2
1979 Decision Problems of Locally Catenative Property for DIL Systems
Youichi Kobuchi, Shigeko Seki
Inf. Control.1
1977 Two Characterization Theorems of Locally Catenative Developmental Systems
Youichi Kobuchi
Inf. Process. Lett.1
1975 Fault Tolerant Cellular Spaces
Hidenosuke Nishio, Youichi Kobuchi
J. Comput. Syst. Sci.2
1973 Some regular state sets in the system of one-dimensional iterative automata
Youichi Kobuchi, Hidenosuke Nishio
Inf. Sci.1