pith. sign in

arxiv: cs/0505071 · v1 · submitted 2005-05-26 · 💻 cs.DB · cs.AI· cs.DS

Summarization Techniques for Pattern Collections in Data Mining

classification 💻 cs.DB cs.AIcs.DS
keywords datapatterncollectionspatternslargeminingsummarizingtechniques
0
0 comments X
read the original abstract

Discovering patterns from data is an important task in data mining. There exist techniques to find large collections of many kinds of patterns from data very efficiently. A collection of patterns can be regarded as a summary of the data. A major difficulty with patterns is that pattern collections summarizing the data well are often very large. In this dissertation we describe methods for summarizing pattern collections in order to make them also more understandable. More specifically, we focus on the following themes: 1) Quality value simplifications. 2) Pattern orderings. 3) Pattern chains and antichains. 4) Change profiles. 5) Inverse pattern discovery.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.