One of the main issues in the rule/pattern mining is of measuring the interestingness of a pattern. The interestingness has been evaluated previously in literature using several approaches for association as well as for sequential mining. These approaches generally view a sequence as another form of association for computations and understanding. But, by doing so, a sequence might not be fully understood for its statistical significance such as dependence and applicability. This paper proposes a new framework to study sequences' interestingness. It suggests two kinds of Markov processes, namely Bayesian networks, to represent the sequential patterns. The patterns are studied for statistical dependencies in order to rank the sequential patterns interestingness. This procedure is very shown when the domain knowledge is not easily accessible. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Vellaisamy, K., & Li, J. (2006). Bayesian approaches to ranking sequential patterns interestingness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4099 LNAI, pp. 241–250). Springer Verlag. https://doi.org/10.1007/978-3-540-36668-3_27
Mendeley helps you to discover research relevant for your work.