Mining generalized temporal patterns based on fuzzy counting

详细信息    查看全文

• 作者：Francisco Guil^a ; ^fguil@ual.es ; Antonio Bailó ; n^b ; ^{bailon@decsai.ugr.es} ; José ; A. Á ; lvarez^a ; ^{jaberme@ual.es} ; Roque Marí ; n^c ; ^{roquemm@um.es}
• 关键词：Temporal data mining ; Fuzzy sets ; Temporal patterns ; Event-based sequences
• 刊名：Expert Systems with Applications
• 出版年：2013
• 出版时间：March, 2013
• 年：2013
• 卷：40
• 期：4
• 页码：1296-1304
• 全文大小：403 K

文摘

Event-based sequences are a kind of pattern based on temporal associations with two essential characteristics: they are syntactically simple and have a great expressive power. For this reason, event-based sequence mining is an interesting solution to the problem of knowledge discovery in dynamic domains, mainly characterized by a time-varying nature. The inter-transactional model has led to the design of algorithms aimed to obtain this sort of patterns from time-stamped datasets. These algorithms extend the well-known Apriori algorithm, by explicitly adding the temporal context where associations among frequent events occurs. This leads to the possibility of extracting a larger number of patterns with a potential interest in decision making. However, its usefulness is diminished in those datasets where the characteristics of variability and uncertainty are present, which is a common issue in real domains. This is due to the rigidity of the counting method, which uses an exact measure of distance between temporal events. As a solution, we propose a generalization of the temporal mining process, which implies a relaxation of the counting method including the concept of approximate temporal distance between events. In particular, in this paper we present an algorithm, called TSET^fuzzy-Miner, which incorporates a fuzzy-based counting technique in order to extract general, flexible, and practical temporal patterns taking into account the particular characteristics of real domains.