Displaying similar documents to “A rough set-based knowledge discovery process”

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...

Data mining techniques using decision tree model in materialised projection and selection view.

Y. W. Teh (2004)

Mathware and Soft Computing

Similarity:

With the availability of very large data storage today, redundant data structures are no longer a big issue. However, an intelligent way of managing materialised projection and selection views that can lead to fast access of data is the central issue dealt with in this paper. A set of implementation steps for the data warehouse administrators or decision makers to improve the response time of queries is also defined. The study concludes that both attributes and tuples, are important...

User Profiling for the Web

Miha Grčar, Dunja Mladenič, Marko Grobelnik (2006)

Computer Science and Information Systems

Similarity:

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...

Experiments with two Approaches for Tracking Drifting Concepts

Koychev, Ivan (2007)

Serdica Journal of Computing

Similarity:

This paper addresses the task of learning classifiers from streams of labelled data. In this case we can face the problem that the underlying concepts can change over time. The paper studies two mechanisms developed for dealing with changing concepts. Both are based on the time window idea. The first one forgets gradually, by assigning to the examples weight that gradually decreases over time. The second one uses a statistical test to detect changes in concept and then optimizes the...

Improving feature selection process resistance to failures caused by curse-of-dimensionality effects

Petr Somol, Jiří Grim, Jana Novovičová, Pavel Pudil (2011)

Kybernetika

Similarity:

The purpose of feature selection in machine learning is at least two-fold - saving measurement acquisition costs and reducing the negative effects of the curse of dimensionality with the aim to improve the accuracy of the models and the classification rate of classifiers with respect to previously unknown data. Yet it has been shown recently that the process of feature selection itself can be negatively affected by the very same curse of dimensionality - feature selection methods may...