Mining minimal non-redundant association rules using frequent closed itemsets

2009-02-232009-02-232000urn:nbn:de:hebis:34-2009022326389http://hdl.handle.net/123456789/2009022326389253958 bytesapplication/pdfengUrheberrechtlich geschützthttps://rightsstatements.org/page/InC/1.0/004Mining minimal non-redundant association rules using frequent closed itemsetsAufsatzData MiningEffizienter Algorithmus