Computer Science – Artificial Intelligence
Scientific paper
2007-05-04
Computer Science
Artificial Intelligence
Scientific paper
One way of getting a better view of data is using frequent patterns. In this paper frequent patterns are subsets that occur a minimal number of times in a stream of itemsets. However, the discovery of frequent patterns in streams has always been problematic. Because streams are potentially endless it is in principle impossible to say if a pattern is often occurring or not. Furthermore the number of patterns can be huge and a good overview of the structure of the stream is lost quickly. The proposed approach will use clustering to facilitate the analysis of the structure of the stream. A clustering on the co-occurrence of patterns will give the user an improved view on the structure of the stream. Some patterns might occur so much together that they should form a combined pattern. In this way the patterns in the clustering will be the largest frequent patterns: maximal frequent patterns. Our approach to decide if patterns occur often together will be based on a method of clustering when only the distance between pairs is known. The number of maximal frequent patterns is much smaller and combined with clustering methods these patterns provide a good view on the structure of the stream.
de Graaf Edgar H.
Kok Joost N.
Kosters Walter A.
No associations
LandOfFree
Clustering Co-occurrence of Maximal Frequent Patterns in Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Clustering Co-occurrence of Maximal Frequent Patterns in Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering Co-occurrence of Maximal Frequent Patterns in Streams will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-615213