Titlebook: Intelligent Information Processing and Web Mining; Proceedings of the I Mieczysław A. Kłopotek,Sławomir T. Wierzchoń,Krzys Conference proce

HAWK

Discriminant versus Strong Rule Sets2 rule induction algorithm, induced rules are discriminant, i.e., every concept is completely described and rules are consistent. In the second approach, represented by the IRIM rule induction algorithm, a few strong and simple rules are induced. These rules do not necessarily completely describe co

Paradox

IDARM — Mining of Indirect Association Rulestions. In the web domain items correspond to pages and transactions to user sessions. The main idea of new approach 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 frequent

BACLE

充气女

Literal Trees and Resolution Techniqueogic, such as resolution-type methods, the model elimination method, the SLD-resolution, and so on. In this connection, it is desired to give a way for investigating their common and distinct features in order to use them better in theory and practice. This paper is devoted to such an investigation.

LEVY

鸽子

Rough Ethograms: Study of Intelligent System Behaviorsystems. In general, an ethogram is a record of behavior patterns, which has grown out of ethology (ways to explain agent behavior). The rough set approach introduced by Zdzisław Pawlak in 1982 provides a ground for deriving pattern-based rewards in the context of an approximation space. The framewo

ANTH

Automatic Knowledge Retrieval from the Webries to a knowledge database, similar to the ones that are being provided by the volunteer contributors. As only a small fraction of the statements accessible on the web can be treated as valid knowledge concepts we considered the method for their filtering and verification, based on the similarity

Cleave

山顶可休息

Efficient Processing of Frequent Itemset Queries Using a Collection of Materialized Viewsies specifying the source dataset, the minimum support threshold, and optional constraints on itemsets. We consider a data mining system which supports storing of results of previous queries in the form of materialized data mining views. Previous work on materialized data mining views addressed the

高谈阔论