A branch-and-bound framework for unsupervised common event discovery
From MaRDI portal
Recommendations
- Hierarchical visual event pattern mining and its applications
- A content-adaptive analysis and representation framework for audio event discovery from ``unscripted multimedia
- Learning relational event models from video
- Accelerating the discovery of unsupervised-shapelets
- Video behaviour mining using a dynamic topic model
Cites work
- A Branch and Bound Algorithm for Feature Subset Selection
- A stochastic grammar of images
- Algorithms on Strings, Trees and Sequences
- Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
- Fast PRISM: branch and bound Hough transform for object class detection
- scientific article; zbMATH DE number 1414290 (Why is no real title available?)
- Machine learning. A probabilistic perspective
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- The Complexity of Some Problems on Subsequences and Supersequences
- The earth mover's distance as a metric for image retrieval
Cited in
(1)
This page was built for publication: A branch-and-bound framework for unsupervised common event discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193773)