We present an interactive discovery support system, which for a given starting concept of interest, discovers new, potentially meaningful relations with other concepts that have no...
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Abstract. The notion of rules is very popular and appears in different flavors, for example as association rules in data mining or as functional dependencies in databases. Their s...
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...