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

Jan M. Zytkow

dblp:63/6215 · DBLP profile ↗
← Back
38ranked-venue papers
15as 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 · 32 · 12 first-authorDatabases, data management, data science and information retrieval · 12 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-authorTheory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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.

Artificial intelligence
7 papers
Knowledge representation and reasoning · 82% Reinforcement learning · 16% Planning, search and constraint satisfaction · 2%
Databases, data mining, and information retrieval
3 papers
Data mining · 92% Machine learning and data management · 8%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational science and engineering · 100%
Theoretical computer science
3 papers
Automated reasoning and model checking · 51% Logic in computer science · 31% Algorithms and data structures · 18%

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

TopicWeightPapersLastEvidence papers
Data mining
pattern mining
0.011996
Automated Pattern Mining with a Scale Dimension · KDD 1996
Data mining
educational data mining
0.011995
Discovering Enrollment Knowledge in University Databases · KDD 1995
Computational science and engineering › scientific machine learning
equation discovery
0.011992
Discovery of Equations: Experimental Evaluation of Convergence · AAAI 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge discovery
discovery systems
0.011990
Automated Discovery in a Chemistry Laboratory · AAAI 1990
Logic in computer science
formal semantics
0.011997
Knowledge = Concepts: A Harmful Equation · KDD 1997
Requirements engineering and software design
model-driven engineering
0.011992
A Framework for Discovering Discrete Event Models · ML 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning
scientific discovery
0.011983
Three Facets of Scientific Discovery · IJCAI 1983
Machine learning › Reinforcement learning
experience reuse
0.011988
Utilizing Experience for Improving the Tactical Manager · ML 1988

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

experimental evaluation · 0.0discrete-event simulation · 0.0discrete event simulation · 0.0case-based reasoning · 0.0
YearPublicationVenuePosition
2005 Unified algorithm for undirected discovery of exception rules
abstract
This article presents an algorithm that seeks every possible exception rule that violates a commonsense rule and satisfies several assumptions of simplicity. Exception rules, which represent systematic deviation from commonsense rules, are often found interesting. Discovery of pairs that consist of a commonsense rule and an exception rule, resulting from undirected search for unexpected exception rules, was successful in various domains. In the past, however, an exception rule represented a change of conclusion caused by adding an extra condition to the premise of a commonsense rule. That approach formalized only one type of exception and failed to represent other types. To provide a systematic treatment of exceptions, we categorize exception rules into 11 categories, and we propose a unified algorithm for discovering all of them. Preliminary results on 15 real-world datasets provide an empirical proof of effectiveness of our algorithm in discovering interesting knowledge. The empirical results also match our theoretical analysis of exceptions, showing that the 11 types can be partitioned in three classes according to the frequency with which they occur in data. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 673–691, 2005.
Einoshin Suzuki, Jan M. Zytkow
Int. J. Intell. Syst.2
2003 Analysis of Feature Dependencies in Sound Description
Alicja Wieczorkowska, Jan M. Zytkow
J. Intell. Inf. Syst.2
2000 Foundations and Discovery of Operational Definitions
Jan M. Zytkow, Zbigniew W. Ras
ISMIS1
2000 Unified Algorithm for Undirected Discovery of Execption Rules
Einoshin Suzuki, Jan M. Zytkow
PKDD2
2000 Mining for Attribute Definitions in a Distributed Two-Layered DB System
Zbigniew W. Ras, Jan M. Zytkow
J. Intell. Inf. Syst.2
1999 The Melting Pot of Automated Discovery: Principles for a New Science
Jan M. Zytkow
Discovery Science1
1999 On Discovering Functional Relationships When Observations Are Noisy: 2D Case
Jan Cwik, Jacek Koronacki, Jan M. Zytkow
ISMIS3
1999 Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases
Zbigniew W. Ras, Jan M. Zytkow
PAKDD2
1999 Taxonomy Formation by Approximate Equivalence Relations, Revisited
F. A. El-Mouadib, Jacek Koronacki, Jan M. Zytkow
PKDD3
1998 Modeling the Business Process by Mining Multiple Databases
Arun P. Sanjeev, Jan M. Zytkow
PKDD2
1997 Discovering Empirical Equations from Robot-Collected Data
Kuang-Ming Huang, Jan M. Zytkow
ISMIS2
1997 Knowledge = Concepts: A Harmful Equation
Jan M. Zytkow
KDD1
1997 techniques and Applications of KDD (Abstract)
Willi Klösgen, Jan M. Zytkow
PKDD2
1997 Contigency Tables as the Foundation for Concepts, Concept Hierarchies and Rules: The 49er System Approach
abstract
We analyze relationships between different forms of knowledge that can be discovered in the same data matrix (relational table): contingency tables, equations, concept definitions, concept hierarchies, and rules. We argue that contingency tables are
Jan M. Zytkow, Robert Zembowicz
Fundam. Informaticae1
1996 Search for Patterns at Each Scale in Massive Data
Jan M. Zytkow, Robert Zembowicz
ISMIS1
1996 Automated Pattern Mining with a Scale Dimension
Jan M. Zytkow, Robert Zembowicz
KDD1
1996 Automated Discovery of Empirical Laws
abstract
We define the problem of empirical search for knowledge by interaction with a setup experiment, and we present a solution implemented in the FAHRENHEIT discovery system. FAHRENHEIT autonomously explores multi-dimensional empirical spaces of numerical
Jan M. Zytkow
Fundam. Informaticae1
1995 Discovering Enrollment Knowledge in University Databases
Arun P. Sanjeev, Jan M. Zytkow
KDD2
1994 Concept Hierarchies: A Restricted Form of Knowledge Derived From Regularities
Molly Troxel, Kim Swarm, Jan M. Zytkow
ISMIS3
1993 Scientific Model-Building as Search in Matrix Spaces
Raúl E. Valdés-Pérez, Jan M. Zytkow, Herbert A. Simon
AAAI2
1993 Automatic Theorem Generation in Plane Geometry
Rajiv Bagai, Vasant Shanbhogue, Jan M. Zytkow, Shang-Ching Chou
ISMIS3
1993 Recognition of Functional Dependencies in Data
Robert Zembowicz, Jan M. Zytkow
ISMIS2
1993 Database Exploration in Search of Regularities
Jan M. Zytkow, Robert Zembowicz
J. Intell. Inf. Syst.1
1993 Introduction: Cognitive Autonomy in Machine Discovery
Jan M. Zytkow
Mach. Learn.1
1992 Discovery of Equations: Experimental Evaluation of Convergence
Robert Zembowicz, Jan M. Zytkow
AAAI2
1992 Operational Definition Refinement: A Discovery Process
Jan M. Zytkow, Jieming Zhu, Robert Zembowicz
AAAI1
1992 A Framework for Discovering Discrete Event Models
Ashvin Radiya, Jan M. Zytkow
ML2
1992 The First Phase of Real-World Discovery: Determining Repeatability and Error of Experiments
Jan M. Zytkow, Jieming Zhu, Robert Zembowicz
ML1
1991 Automated Discovery of Empirical Equations from Data
Robert Zembowicz, Jan M. Zytkow
ISMIS2
1991 Constructing Models of Hidden Structure
Jan M. Zytkow, Paul J. Fischer
ISMIS1
1990 Automated Discovery in a Chemistry Laboratory
Jan M. Zytkow, Jieming Zhu, Abul Hussam
AAAI1
1989 Data-Driven Approaches to Empirical Discovery
Pat Langley, Jan M. Zytkow
Artif. Intell.2
1988 Utilizing Experience for Improving the Tactical Manager
Michael D. Erickson, Jan M. Zytkow
ML2
1988 A Methdology for Multisearch Systems
Andrzej Jankowski, Jan M. Zytkow
ISMIS2
1987 Tactical Manager in a Simulated Environment
Jan M. Zytkow, Michael D. Erickson
ISMIS1
1986 Experimenting and theorizing in theory formation
abstract
The BACON system, developed by Langley, Simon and Bradshaw, has shown the utility of a data driven discovery system. A new system, called FAHRENHEIT, has been built which extends BACON, making it more robust and allowing it perform a wider range of discovery activity. The new system extends BACON in several ways: 1) It determines the scope of a law by making simulated experiments, and by searching for regularities that describe the scope boundaries. 2) The world model in which the experiments are performed is more sophisticated. 3) The order in which the data are considered is placed under the control of FAHRENHEIT so that the system continues the discovery process even if no regularity is found for a particular variable.
B. W. Koehn, Jan M. Zytkow
ISMIS2
1986 A Theory of Historical Discovery: The Construction of Componential Models
Jan M. Zytkow, Herbert A. Simon
Mach. Learn.1
1983 Three Facets of Scientific Discovery
Pat Langley, Jan M. Zytkow, Gary L. Bradshaw, Herbert A. Simon
IJCAI2