Frequency-based views to pattern collections
From MaRDI portal
Publication:2489656
DOI10.1016/J.DAM.2005.08.005zbMATH Open1090.68089OpenAlexW2086753586MaRDI QIDQ2489656FDOQ2489656
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.08.005
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)
Cites Work
- SPADE: An efficient algorithm for mining frequent sequences
- The elements of statistical learning. Data mining, inference, and prediction
- On Grouping for Maximum Homogeneity
- Linear probing and graphs
- On clusterings
- Title not available (Why is that?)
- Complete mining of frequent patterns from graphs: Mining graph data
- Approximate clustering via core-sets
- Approximation schemes for clustering problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A local search approximation algorithm for \(k\)-means clustering
- Title not available (Why is that?)
- How fast is the \(k\)-means method?
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational complexity of optimal multisplitting
- Title not available (Why is that?)
- A Theory of Inductive Query Answering
Cited In (2)
Uses Software
This page was built for publication: Frequency-based views to pattern collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489656)