TY - GEN
T1 - TNS
T2 - 28th Annual ACM Symposium on Applied Computing, SAC 2013
AU - Fournier-Viger, Philippe
AU - Tseng, S.
PY - 2013
Y1 - 2013
N2 - Mining sequential rules from sequence databases is an important research problem with wide applications. However, depending on the choice of the thresholds, current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. Moreover, a large proportion of sequential rules generated are redundant. In previous works, these two problems have been addressed separately. In this paper, we address both by proposing an algorithm for mining top-k non redundant sequential rules.
AB - Mining sequential rules from sequence databases is an important research problem with wide applications. However, depending on the choice of the thresholds, current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. Moreover, a large proportion of sequential rules generated are redundant. In previous works, these two problems have been addressed separately. In this paper, we address both by proposing an algorithm for mining top-k non redundant sequential rules.
KW - Algorithm
KW - Redundancy
KW - Sequential rules
KW - Top-k pattern mining
UR - http://www.scopus.com/inward/record.url?scp=84877976643&partnerID=8YFLogxK
U2 - 10.1145/2480362.2480395
DO - 10.1145/2480362.2480395
M3 - Conference contribution
AN - SCOPUS:84877976643
SN - 9781450316569
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 164
EP - 166
BT - 28th Annual ACM Symposium on Applied Computing, SAC 2013
Y2 - 18 March 2013 through 22 March 2013
ER -