Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleSeptember 2000
Basis of Fuzzy Knowledge Discovery System
Considering a fuzzy knowledge discovery system we have realized we describe here the main features of such systems. First, we consider possible methods to define fuzzy partitions on numerical attributes in order to replace continuous or symbolic ...
- ArticleSeptember 2000
Aggregation and Association in Cross Tables
PKDD '00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge DiscoveryPages 593–598The strength of association between the row and column variables in a cross table varies with the level of aggregation of each variable. In many settings like the simultaneous discretization of two variables, it is useful to determine the aggregation ...
- ArticleSeptember 2000
A Genetic Algorithm-Based Solution for the Problem of Small Disjuncts
PKDD '00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge DiscoveryPages 345–352In essence, small disjuncts are rules covering a small number of examples. Hence, these rules are usually error-prone, which contributes to a decrease in predictive accuracy. The problem is particularly serious because, although each small disjuncts ...
- ArticleSeptember 2000
Algorithms for Mining Share Frequent Itemsets Containing Infrequent Subsets
PKDD '00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge DiscoveryPages 316–324The share measure for itemsets provides useful information about numerical values associated with transaction items, that the support measure cannot. Finding share frequent itemsets is difficult because share frequency is not downward closed when it is ...
- ArticleSeptember 2000
Discovering Association Rules in Large, Dense Databases
PKDD '00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge DiscoveryPages 638–645In this paper we propose an approach for mining association rules in large, dense databases. For finding such rules, frequent itemsets must first be discovered. As finding all the frequent itemsets is very time-consuming for dense databases, we propose ...