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

Yuji Niwa

dblp:26/3248 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1Applied, 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 100%
Artificial intelligence
2 papers
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering › scientific machine learning
equation discovery
0.122000
Enhancing the Plausibility of Law Equation Discovery · ICML 2000
Discovering Admissible Model Equations from Observed Data Based on Scale-Types and Identity Constrains · IJCAI 1999
Computational science and engineering
system identification
0.011999
Discovering Admissible Model Equations from Observed Data Based on Scale-Types and Identity Constrains · IJCAI 1999
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge discovery
equation discovery
0.012000
Enhancing the Plausibility of Law Equation Discovery · ICML 2000
Knowledge, reasoning and agents › Knowledge representation and reasoning
qualitative reasoning
0.011999
Discovering Admissible Model Equations from Observed Data Based on Scale-Types and Identity Constrains · IJCAI 1999

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

equation discovery · 0.1scale-type reasoning · 0.0
YearPublicationVenuePosition
2005 Enhancing the plausibility of law equation discovery through cross check among multiple scale-type-based models
abstract
The study in the field of scientific discovery from data has been directed to the discovery of plausible law equations representing the first principles underlying objective systems. In this paper, a novel principle and an algorithm to predictively discover new scientific law equation formulae consisting of newly given quantities are proposed based on the candidate law equations governing the other quantities under current observation. The first principle-based scientific law equation formulae must follow some mathematical admissibility and consistency. These conditions enable efficient reasoning of the law equation formulae in the prediction process. The soundness and the reproducibility of the equation prediction by this approach have been tested through numerical simulations of physical examples, and, moreover, its practicality has been confirmed through a real socio-psychological analysis. The approach can discover a set of scientific law equations representing common first principles under different set of quantities, and enables to capture general scietific features of the objective system under analysis.
Takashi Washio, Hiroshi Motoda, Yuji Niwa
J. Exp. Theor. Artif. Intell.3
2001 Discovering Admissible Simultaneous Equation Models from Observed Data
Takashi Washio, Hiroshi Motoda, Yuji Niwa
ECML3
2000 Enhancing the Plausibility of Law Equation Discovery
Takashi Washio, Hiroshi Motoda, Yuji Niwa
ICML3
2000 Operator's situation awareness under different levels of automation; evaluations through probabilistic human cognitive simulations
abstract
The human-centered automation concept claims two general requirements on situation awareness (SA) of human operators. One is the necessity of keeping the SA of an artifact, and the other is keeping the SA of automation. Nevertheless, the fundamental methods or techniques, especially quantitative ones, are not mature enough to be used as rational tools for human-machine design. An important approach for establishing the method must be identification of a proper "level of automation", where ten levels are proposed by T.B. Sheridan (1999). A goal of the research presented is to establish a theoretical framework for evaluating automation levels from a viewpoint of operator's situation awareness in real domains. A method using discrete event simulation is developed, and applied to a particular artifact: a nuclear power plant.
Hiroshi Furukawa, Toshiyuki Inagaki, Yuji Niwa
SMC3
1999 Discovering Admissible Model Equations from Observed Data Based on Scale-Types and Identity Constrains
Takashi Washio, Hiroshi Motoda, Yuji Niwa
IJCAI3