Frequency-based views to pattern collections
From MaRDI portal
Publication:2489656
Recommendations
Cites work
- scientific article; zbMATH DE number 1651999 (Why is no real title available?)
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 2089373 (Why is no real title available?)
- scientific article; zbMATH DE number 1934545 (Why is no real title available?)
- scientific article; zbMATH DE number 1943761 (Why is no real title available?)
- scientific article; zbMATH DE number 1943770 (Why is no real title available?)
- scientific article; zbMATH DE number 2086610 (Why is no real title available?)
- A local search approximation algorithm for \(k\)-means clustering
- A theory of inductive query answering
- Approximate clustering via core-sets
- Approximation schemes for clustering problems
- Complete mining of frequent patterns from graphs: Mining graph data
- How fast is the \(k\)-means method?
- Linear probing and graphs
- On Grouping for Maximum Homogeneity
- On clusterings: good, bad and spectral
- On the computational complexity of optimal multisplitting
- SPADE: An efficient algorithm for mining frequent sequences
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(3)
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)