Mining probabilistic automata: a statistical view of sequential pattern mining
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- A theory of the learnable
- Complexity of automaton identification from given data
- Data mining for measuring and improving the success of web sites
- Discovering significant patterns
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Mining evolving data streams for frequent patterns
- Probability Inequalities for Sums of Bounded Random Variables
- Rule discovery in telecommunication alarm data
- SPADE: An efficient algorithm for mining frequent sequences
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
Cited in
(8)- Mining sequences with exceptional transition behaviour of varying order using quality measures based on information-theoretic scoring functions
- Sequential pattern mining for ICT risk assessment and management
- Improving hospital layout planning through clinical pathway mining
- Are sequential patterns shareable? Ensuring individuals' privacy
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling
- Significant motifs in time series
- Sequential pattern analysis: a statistical investigation of sequence length and support
- Statistical significance of episodes with general partial orders
This page was built for publication: Mining probabilistic automata: a statistical view of sequential pattern mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959646)