A data mining algorithm for inducing temporal constraint networks

Authors:
Miguel R. Álvarez;Paulo Félix;Purificación Cariñena;Abraham Otero
Affiliations:
Departamento de Electrónica e Computación, Universidade de Santiago de Compostela, Santiago de Compostela, Spain;Departamento de Electrónica e Computación, Universidade de Santiago de Compostela, Santiago de Compostela, Spain;Departamento de Electrónica e Computación, Universidade de Santiago de Compostela, Santiago de Compostela, Spain;Departamento de Electrónica e Computación, Universidade de Santiago de Compostela, Santiago de Compostela, Spain
Venue:
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Year:
2010

Citing 6
Cited 2

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Beyond intratransaction association analysis: mining multidimensional intertransaction association rules

ACM Transactions on Information Systems (TOIS)
Discovery of Frequent Episodes in Event Sequences

Data Mining and Knowledge Discovery
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovering chronicles with numerical time constraints from alarm logs for monitoring dynamic systems

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Mining temporal constraint networks by seed knowledge extension

AIME'11 Proceedings of the 13th conference on Artificial intelligence in medicine
Discovering metric temporal constraint networks on temporal databases

Artificial Intelligence in Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach to the problem of temporal knowledge induction from a collection of temporal events is presented. As a result, a set of frequent temporal patterns is obtained, represented following the Simple Temporal Problem (STP) formalism: a set of event types and a set of constraints describing common temporal arrangements between the events. The use of a clustering technique makes it possible to discriminate between the frequent patterns that are found in the collection.