Taxonomy-driven lumping for sequence mining

Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Given a taxonomy of events and a dataset of sequences of these events, we study the problem of finding efficient and effective ways to produce a compact representation of the sequences. We model sequences with Markov models whose states correspond to nodes in the provided taxonomy, and each state represents the events in the subtree under the corresponding node. By lumping observed events to states that correspond to internal nodes in the taxonomy, we allow more compact models that are easier to understand and visualize, at the expense of a decrease in the data likelihood. We formally define and characterize our problem, and we propose a scalable search method for finding a good trade-off between two conflicting goals: maximizing the data likelihood, and minimizing the model complexity. We implement these ideas in Taxomo, a taxonomy-driven modeler, which we apply in two different domains, query-log mining and mining of moving-object trajectories. The empirical evaluation confirms the feasibility and usefulness of our approach.

Original languageEnglish
Pages (from-to)227-244
Number of pages18
JournalData Mining and Knowledge Discovery
Volume19
Issue number2
DOIs
Publication statusPublished - 1 Oct 2009
Externally publishedYes

Fingerprint

Taxonomies
Trajectories

Keywords

  • Data mining
  • Markov models
  • Query-log analysis
  • Sequence analysis
  • Spatial-data analysis

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Taxonomy-driven lumping for sequence mining. / Bonchi, Francesco; Castillo, Carlos; Donato, Debora; Gionis, Aristides.

In: Data Mining and Knowledge Discovery, Vol. 19, No. 2, 01.10.2009, p. 227-244.

Research output: Contribution to journalArticle

Bonchi, F, Castillo, C, Donato, D & Gionis, A 2009, 'Taxonomy-driven lumping for sequence mining', Data Mining and Knowledge Discovery, vol. 19, no. 2, pp. 227-244. https://doi.org/10.1007/s10618-009-0141-6
Bonchi, Francesco ; Castillo, Carlos ; Donato, Debora ; Gionis, Aristides. / Taxonomy-driven lumping for sequence mining. In: Data Mining and Knowledge Discovery. 2009 ; Vol. 19, No. 2. pp. 227-244.
@article{657644f0c3aa4fc1ac25221d792014ba,
title = "Taxonomy-driven lumping for sequence mining",
abstract = "Given a taxonomy of events and a dataset of sequences of these events, we study the problem of finding efficient and effective ways to produce a compact representation of the sequences. We model sequences with Markov models whose states correspond to nodes in the provided taxonomy, and each state represents the events in the subtree under the corresponding node. By lumping observed events to states that correspond to internal nodes in the taxonomy, we allow more compact models that are easier to understand and visualize, at the expense of a decrease in the data likelihood. We formally define and characterize our problem, and we propose a scalable search method for finding a good trade-off between two conflicting goals: maximizing the data likelihood, and minimizing the model complexity. We implement these ideas in Taxomo, a taxonomy-driven modeler, which we apply in two different domains, query-log mining and mining of moving-object trajectories. The empirical evaluation confirms the feasibility and usefulness of our approach.",
keywords = "Data mining, Markov models, Query-log analysis, Sequence analysis, Spatial-data analysis",
author = "Francesco Bonchi and Carlos Castillo and Debora Donato and Aristides Gionis",
year = "2009",
month = "10",
day = "1",
doi = "10.1007/s10618-009-0141-6",
language = "English",
volume = "19",
pages = "227--244",
journal = "Data Mining and Knowledge Discovery",
issn = "1384-5810",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Taxonomy-driven lumping for sequence mining

AU - Bonchi, Francesco

AU - Castillo, Carlos

AU - Donato, Debora

AU - Gionis, Aristides

PY - 2009/10/1

Y1 - 2009/10/1

N2 - Given a taxonomy of events and a dataset of sequences of these events, we study the problem of finding efficient and effective ways to produce a compact representation of the sequences. We model sequences with Markov models whose states correspond to nodes in the provided taxonomy, and each state represents the events in the subtree under the corresponding node. By lumping observed events to states that correspond to internal nodes in the taxonomy, we allow more compact models that are easier to understand and visualize, at the expense of a decrease in the data likelihood. We formally define and characterize our problem, and we propose a scalable search method for finding a good trade-off between two conflicting goals: maximizing the data likelihood, and minimizing the model complexity. We implement these ideas in Taxomo, a taxonomy-driven modeler, which we apply in two different domains, query-log mining and mining of moving-object trajectories. The empirical evaluation confirms the feasibility and usefulness of our approach.

AB - Given a taxonomy of events and a dataset of sequences of these events, we study the problem of finding efficient and effective ways to produce a compact representation of the sequences. We model sequences with Markov models whose states correspond to nodes in the provided taxonomy, and each state represents the events in the subtree under the corresponding node. By lumping observed events to states that correspond to internal nodes in the taxonomy, we allow more compact models that are easier to understand and visualize, at the expense of a decrease in the data likelihood. We formally define and characterize our problem, and we propose a scalable search method for finding a good trade-off between two conflicting goals: maximizing the data likelihood, and minimizing the model complexity. We implement these ideas in Taxomo, a taxonomy-driven modeler, which we apply in two different domains, query-log mining and mining of moving-object trajectories. The empirical evaluation confirms the feasibility and usefulness of our approach.

KW - Data mining

KW - Markov models

KW - Query-log analysis

KW - Sequence analysis

KW - Spatial-data analysis

UR - http://www.scopus.com/inward/record.url?scp=68749103149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68749103149&partnerID=8YFLogxK

U2 - 10.1007/s10618-009-0141-6

DO - 10.1007/s10618-009-0141-6

M3 - Article

VL - 19

SP - 227

EP - 244

JO - Data Mining and Knowledge Discovery

JF - Data Mining and Knowledge Discovery

SN - 1384-5810

IS - 2

ER -