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

Naoyuki Tokuda

dblp:06/4902 · DBLP profile ↗
← Back
14ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 7Databases, data management, data science and information retrieval · 4Human-computer interaction and ubiquitous computing · 3Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 1

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
3 papers
Algorithmic game theory and mechanism design · 47% Mathematical optimization · 27% Computational complexity · 20%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › dynamical systems
stability analysis
0.112005
A general stability analysis on regional and national voting schemes against noise - why is an electoral college more stable than a direct popular election? · Artif. Intell. 2005
Algorithmic game theory and mechanism design › social choice
voting
0.112005
A general stability analysis on regional and national voting schemes against noise - why is an electoral college more stable than a direct popular election? · Artif. Intell. 2005
Algorithmic game theory and mechanism design
matching
0.012003
Robustness of regional matching scheme over global matching scheme · Artif. Intell. 2003

Methods — techniques the papers use, named apart from their topics

continuous model analysis · 0.1noise analysis · 0.1regional matching · 0.0global matching · 0.0
YearPublicationVenuePosition
2010 Classification of 2-dimensional array patterns: Assembling many small neural networks is better than using a large one
Liang Chen 0012, Naoyuki Tokuda
Neural Networks3
2007 Capacity analysis for a two-level decoupled Hamming network for associative memory under a noisy environment
Liang Chen 0012, Naoyuki Tokuda, Akira Nagai
Neural Networks2
2006 Is High Resolution Representation More Effective for Content Based Image Classification?
abstract
This paper shows by a mathematical model that, for image classification/recognition purposes, high resolution pictures have lower recognition rate than relatively low resolution pictures. The analysis is based on the matching approach by a simple neural network, but we believe that the conclusion remains valid even when the classification process involves complicated matching schemes such as principal component analysis and Gabor transforms.
Liang Chen 0012, Naoyuki Tokuda, Akira Nagai
IJCNN2
2006 A "stereo" document representation for textual information retrieval
abstract
Abstract A new document representation model is presented in this paper. This model is based on the idea of representing a document by two or more pictures of the document taken from different perspectives. It is shown that by applying the stereo representation model, enhanced textual retrieval performance is achieved because the new model improves the capability of capturing individual features of the document. Experiments have been conducted on two standard corpora, TIME and ADI, using the standard term vector method and the latent semantic indexing (LSI) method based upon both the stereo representation model and the traditional representation model. Statistical t‐tests on the experimental results have convincingly illustrated that these methods achieve significant improvements in retrieval performances with the stereo representation model over those with the traditional representation model.
Liang Chen 0012, Naoyuki Tokuda
J. Assoc. Inf. Sci. Technol.3
2005 A general stability analysis on regional and national voting schemes against noise - why is an electoral college more stable than a direct popular election?
Liang Chen 0012, Naoyuki Tokuda
Artif. Intell.2
2003 Robustness of regional matching scheme over global matching scheme
Liang Chen 0012, Naoyuki Tokuda
Artif. Intell.2
2003 A new differential LSI space-based probabilistic document classifier
Liang Chen 0012, Naoyuki Tokuda, Akira Nagai
Inf. Process. Lett.2
2003 Stability Analysis of Regional and National Voting Schemes by a Continuous Model
abstract
The previous discrete-model-based stability analysis of regional and national voting has been extended to a continuous-model-based analysis in the simultaneous presence of white and concentrated components of noise, reconfirming the previous conclusion that regional voting with smaller sized regions always demonstrates an improved stability over those with larger sized regions, including the national voting in its limiting case in particular. The conclusion remains valid as long as the weak distribution assumption is valid.
Liang Chen 0012, Naoyuki Tokuda
IEEE Trans. Knowl. Data Eng.2
2002 An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
abstract
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set with the resulting multivariable function being constructed within any specified precision to the original sample set. The given sample sets are first decomposed into a cluster of simpler sample sets such that a single input fuzzy system is constructed readily for a sample set extracted directly from the cluster independent of the other variables. Once the relevant fuzzy rules and membership functions are constructed for each of the variables completely independent of the other variables, the resulting decomposed fuzzy rules and membership functions are integrated back into the fuzzy system appropriate for the original sample set requiring only a moderate cost of computation in the required decomposition and composition processes. After proving two basic theorems which we need to ensure the validity of the decomposition and composition processes of the system construction, we have demonstrated a constructive algorithm of a multivariable fuzzy system. Exploiting an implicit error bound analysis available at each of the construction steps, the present Fourier method is capable of implementing a more stable fuzzy system than the power series expansion method of ParNeuFuz and PolyNeuFuz, covering and implementing a wider range of more robust applications.
Liang Chen 0012, Naoyuki Tokuda
IEEE Trans. Syst. Man Cybern. Part B2
2001 A new scheme for an automatic generation of multi-variable fuzzy systems
Liang Chen 0012, Naoyuki Tokuda, Yongbao He
Fuzzy Sets Syst.2
2000 Stability analysis of voting schemes on a continuous model
abstract
We have extended and reinforced the previous discrete-model-based stability analysis of the national and regional voting by a continuous model where we have allowed the presence of the so-called white noise, and the concentrated noise. The result reconfirms the previous conclusion developed for image processing application that as long as the divided regions are not too small, the regional voting with smaller sized regions demonstrates always an improved robustness than those with larger sized regions.
Liang Chen 0012, Naoyuki Tokuda
SMC2
2000 A note on "Category and measure in complexity classes"
Liang Chen 0012, Naoyuki Tokuda
Inf. Process. Lett.2
1999 A new diagnostic system for J-E translation ILTS by global matching algorithm and POST parser
abstract
A new diagnostic system has been developed for an interactive template-structured intelligent language tutoring system (ILTS) for Japanese-English translation where an efficient heaviest common sequence (HCS) matching algorithm and a ‘part-of-speech tagged (POST) parser’ play a key role. This is implemented by exploiting the system template which consists of a complex transition networks comprising both model (correct) translations and many typical erroneous translations characteristic of nonnative beginners all collected and extracted from translations of about 200 monitors. By selecting, from among many candidates’ paths in the system template, a path having a HCS with the student’s input translation as a best matched sentence, the template structure of the diagnostic system allows the potentially complicated bug finding processes in natural language to be implemented by a much simpler and efficient HCS string matching algorithm [20]. To improve the precision of a parser, we have developed a ‘probabilistic POST parser’ where we have eliminated ambiguity in part-of-speeches by manually pre-assigning POS tags to all words in potentially correct paths of the template. Combining the templatebased diagnostic system and the parser, we found that the ILTS is capable of providing most adequate diagnostic messages and a tutoring strategy with appropriate comments after analyzing the keyed-in translated sentences from students.
Naoyuki Tokuda
MTSummit2
1996 A syntactical approach to diagnosing multiple bugs in an intelligent tutoring system
abstract
This paper develops a buggy model-based intelligent tutoring system (ITS) capable of diagnosing multiple bugs, pinpointing not only their types but also their exact locations involved. The procedural grammar of context free type is used not only to decompose a complicated procedure involving possible steps of both correct and incorrect arithmetic into simplest, 'primitive' procedures but also to express control knowledge essential to implementing an efficient parser. An efficient parser is implemented by narrowing down the search space, exploiting the control knowledge, the selection and consistency conditions in selecting rules in parsing. Parsing of superficial symptoms such as a student's errors in arithmetic essentially reveals the deep structure of the buggy knowledge of the student so that teachers may now devise and offer a more effective means of instructions for acquiring the correct skill of arithmetic.
Zhongping Huang, Naoyuki Tokuda
IEEE Trans. Syst. Man Cybern. Part A2