Thumbnail
Access Restriction
Subscribed

Author Kryszkiewicz, M.
Sponsorship IEEE Comput. Soc. Tech. Committe on Pattern Anal. & Machine Intelligence (TCPAMI)
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Itemsets ♦ Association rules ♦ Transaction databases ♦ Data mining ♦ Relational databases ♦ Computer science ♦ Clustering algorithms
Abstract Many data mining problems require the discovery of frequent patterns in order to be solved. Frequent itemsets are useful in the discovery of association rules, episode rules, sequential patterns and clusters. The number of frequent itemsets is usually huge. Therefore, it is important to work out concise representations of frequent itemsets. We describe three basic lossless representations of frequent patterns in a uniform way and offer a new lossless representation of frequent patterns based on disjunction-free generators. The new representation is more concise than two of the basic representations and more efficiently computable than the third representation. We propose an algorithm for determining the new representation.
Description Author affiliation: Inst. of Comput. Sci., Warsaw Univ. of Technol., Poland (Kryszkiewicz, M.)
ISBN 0769511198
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-11-29
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 705.27 kB
Page Count 8
Starting Page 305
Ending Page 312


Source: IEEE Xplore Digital Library