A constraint-based querying system for exploratory pattern discovery

  • Authors:
  • Francesco Bonchi;Fosca Giannotti;Claudio Lucchese;Salvatore Orlando;Raffaele Perego;Roberto Trasarti

  • Affiliations:
  • Yahoo! Research Barcelona, Ocata 1, Barcelona, Spain;ISTI-CNR, Area della Ricerca di Pisa, Via Giuseppe Moruzzi 1, Pisa, Italy;ISTI-CNR, Area della Ricerca di Pisa, Via Giuseppe Moruzzi 1, Pisa, Italy and Dipartimento di Informatica, Universití Ca' Foscari di Venezia, Via Torino 155, Venezia Mestre, Italy;Dipartimento di Informatica, Universití Ca' Foscari di Venezia, Via Torino 155, Venezia Mestre, Italy;ISTI-CNR, Area della Ricerca di Pisa, Via Giuseppe Moruzzi 1, Pisa, Italy;ISTI-CNR, Area della Ricerca di Pisa, Via Giuseppe Moruzzi 1, Pisa, Italy and Dipartimento di Informatica, Universití di Pisa, Largo Pontecorvo 3, Pisa, Italy

  • Venue:
  • Information Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we present ConQueSt, a constraint-based querying system able to support the intrinsically exploratory (i.e., human-guided, interactive and iterative) nature of pattern discovery. Following the inductive database vision, our framework provides users with an expressive constraint-based query language, which allows the discovery process to be effectively driven toward potentially interesting patterns. Such constraints are also exploited to reduce the cost of pattern mining computation. ConQueSt is a comprehensive mining system that can access real-world relational databases from which to extract data. Through the interaction with a friendly graphical user interface (GUI), the user can define complex mining queries by means of few clicks. After a pre-processing step, mining queries are answered by an efficient and robust pattern mining engine which entails the state-of-the-art of data and search space reduction techniques. Resulting patterns are then presented to the user in a pattern browsing window, and possibly stored back in the underlying database as relations.