A generative pattern model for mining binary datasets

Lucchese C., Perego R., Orlando S.

Top-k Pattern Mining  Algorithms  Frequent pattern mining  Database Applications. Data mining  Matrix Decomposition 

In many application fields, huge binary datasets modeling real life-phenomena are daily produced. These datasets record observations of some events, and people are often interested in mining them in order to recognize recurrent patterns. However, the discovery of the most important patterns is very challenging. For example, these patterns may overlap, or be related only to a particular subset of the observations. Finally, the mining can be hindered by the presence of noise. In this paper, we introduce a generative pattern model, and an associated cost model for evaluating the goodness of the set of patterns extracted from a binary dataset. We pro- pose an efficient algorithm, named GPM, for the discovery of the most relevant patterns according to the model. We show that the proposed model generalizes other approaches and supports the discovery of high quality patterns.

Source: 25th ACM Symposium On Applied Computing, pp. 1109–1110, Crans Montana, Switzerland, March 22,26

Metrics