Frequency-based views to pattern collections
From MaRDI portal
Publication:2489656
Recommendations
Cites work
- 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
- Local and global methods in data mining: Basic techniques and open problems
- Mining all non-derivable frequent itemsets
- Mining minimal non-redundant association rules using frequent closed itemsets
- On clusterings: good, bad and spectral
- On Grouping for Maximum Homogeneity
- On the computational complexity of optimal multisplitting
- Pattern detection and discovery
- Performance guarantees for hierarchical clustering
- Relational association rules: Getting WARMeR
- Relational data mining
- 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)