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

Jun'ichi Toyoda

dblp:95/1658 · DBLP profile ↗
← Back
30ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 9Artificial intelligence and machine learning · 8Applied, interdisciplinary, general and emerging computing · 8 · 1 first-authorTheory of computation · 7Databases, data management, data science and information retrieval · 5Graphics, computer vision, multimedia, augmented reality and games · 3Software engineering, systems software and programming languages · 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
Distributed computing theory · 78% Algorithms and data structures · 21% Combinatorics and discrete mathematics · 0%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory › distributed algorithms › distributed coordination
distributed constraint satisfaction
0.011994
A Dynamic Organization in Distributed Constraint Satisfaction · AAAI 1994
Machine learning › Representation and self-supervised learning
similarity measure
0.011984
A Similarity Measure Between Patterns with Nonindependent Attributes · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Algorithms and data structures
similarity measures
0.011984
A Similarity Measure Between Patterns with Nonindependent Attributes · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Algorithms and data structures › data structure design › search structures
hashing
0.011966
Analysis of the Address Assignment Problem for Clustered Keys · J. ACM 1966
Combinatorics and discrete mathematics
generating functions
0.011966
Analysis of the Address Assignment Problem for Clustered Keys · J. ACM 1966

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

distributed constraint satisfaction · 0.0set-theoretical measure · 0.0pairwise correlation · 0.0generating functions · 0.0
YearPublicationVenuePosition
2003 Context-sensitive filtering for the web
Noriyuki Matsuda, Tsukasa Hirashima, Toyohiro Nomoto, Hirokazu Taki, Jun'ichi Toyoda
Web Intell. Agent Syst.5
2002 An e-Learning Library on the Web
abstract
The main topic addressed in this paper is how to help learners select some instructive hypermedia-based learning resources according to their learning contexts from the Web. Our approach is to provide a digital library for web-based learning called e-Learning Library, which includes learning resource repository, local indexing, and adaptive navigation support. This aims to promote their learning with diverse learning resources involving a certain topic.
Shinobu Hasegawa, Akihiro Kashihara, Jun'ichi Toyoda
ICCE3
2002 Supporting Interaction Analysis for Collaborative Learning
Akiko Inaba, Ryoji Ohkubo, Mitsuru Ikeda, Riichiro Mizoguchi, Jun'ichi Toyoda
Intelligent Tutoring Systems5
2002 Adaptive Postviewer for Constructive Learning in Hyperspace
Akihiro Kashihara, Kunitaka Kumei, Shinobu Hasegawa, Jun'ichi Toyoda
Intelligent Tutoring Systems4
2000 How Can We Form Effective Collaborative Learning Groups?
Akiko Inaba, Thepchai Supnithi, Mitsuru Ikeda, Riichiro Mizoguchi, Jun'ichi Toyoda
Intelligent Tutoring Systems5
2000 Annotating Exploration History and Knowledge Mapping for Learning with Web-Based Resources
Akihiro Kashihara, Shinobu Hasegawa, Jun'ichi Toyoda
Intelligent Tutoring Systems3
2000 A Step Towards Integration of Learning Theories to Form an Effective Collaborative Learning Group
Akiko Inaba, Thepchai Supnithi, Mitsuru Ikeda, Riichiro Mizoguchi, Jun'ichi Toyoda
PRICAI5
1998 Context-sensitive Filtering for Browsing in Hypertext
abstract
Modeling of the user’s interests is one of the most important issues to support a user to gather information. Although there are several promising methods to infer the interests from the user’s browsing behavior, they assume that the interests are consistent during the information gathering. However, in browsing which is one of the most popular ways to gather information, the user’s interests are often strongly dependent on the local context of the browsing. This paper describes a method to model the user’s shifting interests from the browsing history. An information filtering method using the model of the interests has been implemented. We call it “context-sensitive filtering.” The results of an experimental evaluation, by real users’ browsing for an encyclopedia in CDROM format, are also reported.
Tsukasa Hirashima, Noriyuki Matsuda, Toyohiro Nomoto, Jun'ichi Toyoda
IUI4
1997 Information Filtering Using User's Context on Browsing in Hypertext
Tsukasa Hirashima, K. Hachiya, Akihiro Kashihara, Jun'ichi Toyoda
User Model. User Adapt. Interact.4
1996 Toward a Learning Environment Allowing Learner-Directed Problem Practice
Tsukasa Hirashima, Akihiro Kashihara, Jun'ichi Toyoda
Intelligent Tutoring Systems3
1995 A Cognitive Load Application in Explanation
Akihiro Kashihara, Tsukasa Hirashima, Jun'ichi Toyoda
IEA/AIE3
1995 A Cognitive Load Application in Tutoring
Akihiro Kashihara, Tsukasa Hirashima, Jun'ichi Toyoda
User Model. User Adapt. Interact.3
1994 A Dynamic Organization in Distributed Constraint Satisfaction
Katsutoshi Hirayama, Seiji Yamada, Jun'ichi Toyoda
AAAI3
1993 Interleaving Planning with Execution using the Success Probability - Preliminary Report
abstract
The authors describe a method to interleave planning with execution in the dynamic world. The system interleaves planning with execution using the success probability, SP: likelihood that a plan is executed well. Elemental probabilities are assigned to operations' effects and irrelevant state descriptions. A partial plan is transformed into a Bayesian network and its SP is computed. An agent switches planning to execution when SP decreases less than an execution threshold. The authors made experiments in Tileworld and found optimal thresholds between reactivity and deliberation. This is a preliminary report for solving tradeoff between reactivity and deliberation.
Seiji Yamada, Yoshinori Isoda, Jun'ichi Toyoda
ICTAI3
1992 Providing Problem Explanation for ITS
Tsukasa Hirashima, Akihiro Kashihara, Jun'ichi Toyoda
Intelligent Tutoring Systems3
1989 Providing explanation capability based on individual understanding and domain principles
abstract
No abstract available.
Yuichi Nakamura 0003, Tsukasa Hirashima, Kuniaki Uehara, Jun'ichi Toyoda
IEA/AIE (2)4
1989 Integration of prolog and databases in both evaluational and non-evaluational approaches
Takeshi Imanaka, Kuniaki Uehara, Jun'ichi Toyoda
Knowl. Based Syst.3
1986 A Framework for ICAI Systems Based on Inductive Inference and Logic Programming
Kazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho, Jun'ichi Toyoda
ICLP4
1984 A Similarity Measure Between Patterns with Nonindependent Attributes
abstract
A generalized version of a set-theoretical measure for obtaining similarities between patterns with nonindependent attributes is presented. The dependence here is given by the pairwise correlation. Since the proposed measure needs no assumption of attribute independence, the resulting similarity values can reflect directly the relationships between the attributes.
Tetsuro Ito, Yoshifumi Kodama, Jun'ichi Toyoda
IEEE Trans. Pattern Anal. Mach. Intell.3
1977 Relational Data Graphs and Some Properties of Them
T. Tsuji, Jun'ichi Toyoda, Kokichi Tanaka
J. Comput. Syst. Sci.2
1976 Interactive Languages
Yoshinori Ezawa, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
J. Comput. Syst. Sci.3
1975 L-fuzzy grammars
Hyo Heng Kim, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
Inf. Sci.3
1975 Various Kinds of Automata with Weights
Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
J. Comput. Syst. Sci.2
1973 Examples of Formal Grammars with Weights
Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
Inf. Process. Lett.2
1973 N-fold fuzzy grammars
Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
Inf. Sci.2
1973 An automaton in the nonstationary random environment
Hidekazu Tsuji, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
Inf. Sci.3
1973 Web Grammars and Several Graphs
Norihiro Abe, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
J. Comput. Syst. Sci.3
1972 General formulation of formal grammars
Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
Inf. Sci.2
1969 Some Considerations on Fuzzy Automata
Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka
J. Comput. Syst. Sci.2
1966 Analysis of the Address Assignment Problem for Clustered Keys
abstract
The occurrence pattern of clusterings of keys is analyzed by use of the generating function. Probabilities of occurrences of several clustered patterns are given as the coefficients of generating functions. Moreover, the result when a key-to-address transformation of aK + b /mod c is performed on clustered keys is briefly discussed.
Jun'ichi Toyoda, Yoshikazu Tezuka, Yoshiro Kasahara
J. ACM1