Algorithm for generalization of action rules to summaries

Angelina Tzacheva

The search session has expired. Please query the service again.

Displaying similar documents to “Algorithm for generalization of action rules to summaries”

Decisions to Bias Case and Case-Based decision.

A. Y. BILLOT AND J. LANFRACHI (1999)

Revista de la Real Academia de Ciencias Exactas Físicas y Naturales

Similarity:

Interactive approach based on stochastic dominance

Maciej Nowak (2004)

Control and Cybernetics

Similarity:

Reasons: belief support and goal dynamics.

Cristiano Castelfranchi (1996)

Mathware and Soft Computing

Similarity:

The paper is devoted to the structural relation between beliefs and goals. I discuss its importance in modelling cognitive agents; its origin in cognitive processing; its structure (belief structure relative to a goal); its crucial role in rationality, mediating between epistemic and pragmatic rationality; its role in goal Dynamics. I stress the crucial contribution of the supporting beliefs to the Processing of goals; to the Revision of goals (or Dynamics in a narrow sense), i.e. the...

A rough set-based knowledge discovery process

Ning Zhong, Andrzej Skowron (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The knowledge discovery from real-life databases is a multi-phase process consisting of numerous steps, including attribute selection, discretization of real-valued attributes, and rule induction. In the paper, we discuss a rule discovery process that is based on rough set theory. The core of the process is a soft hybrid induction system called the Generalized Distribution Table and Rough Set System (GDT-RS) for discovering classification rules from databases with uncertain and incomplete...

Minimal decision rules based on the apriori algorithm

María Fernández, Ernestina Menasalvas, Óscar Marbán, José Peña, Socorro Millán (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing...

Quality improvement of rule-based gene group descriptions using information about GO terms importance occurring in premises of determined rules

Marek Sikora, Aleksandra Gruca (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we present a method for evaluating the importance of GO terms which compose multi-attribute rules. The rules are generated for the purpose of biological interpretation of gene groups. Each multi-attribute rule is a combination of GO terms and, based on relationships among them, one can obtain a functional description of gene groups. We present a method which allows evaluating the influence of a given GO term on the quality of a rule and the quality of a whole set of rules....

Formal Model of Activities As a Segment of Organizational Stock of Knowledge

Dubravka Ćećez-Kecmanović, Olivera Kruševac, Radivoj Petrović (1992)

The Yugoslav Journal of Operations Research

Similarity:

Modeling of distributed objects computing design pattern combinations using a formal specification language

Toufik Taibi, David Ngo (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

Design patterns help us to respond to the challenges faced while developing Distributed Object Computing (DOC) applications by shifting developers' focus to high-level design concerns, rather than platform specific details. However, due to the inherent ambiguity of the existing textual and graphical descriptions of the design patterns, users are faced with difficulties in understanding when and how to use them. Since design patterns are seldom used in isolation but are usually combined...

Mining indirect association rules for web recommendation

Przemysław Kazienko (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Classical association rules, here called “direct”, reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, “third” pages, called transitive, with which they appear relatively frequently. Two types of indirect associations...