The main position of this paper is that constraints can be a very useful tool in the search for local patterns. The justification for our position is twofold. On one hand, pushing constraints makes feasible the computation of frequent patterns at very low frequency levels, which is where local patterns are. On the other hand constraints can be exploited to guide the search for those patterns showing deviating, surprising characteristics. We first review the many definitions of local patterns. This review leads us to justify our position. We then provide a survey of techniques for pushing constraint into the frequent pattern computation. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bonchi, F., & Giannotti, F. (2005). Pushing constraints to detect local patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3539 LNAI, pp. 1–19). Springer Verlag. https://doi.org/10.1007/11504245_1
Mendeley helps you to discover research relevant for your work.