Missing value replacement in strings and applications
From MaRDI portal
Cites work
- A NEW MEASURE OF RANK CORRELATION
- Algorithms on Strings
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Approximate clustering of incomplete fingerprints
- Approximate string-matching with q-grams and maximal matches
- Automata and forbidden words
- Bidirectional String Anchors: A New String Sampling Mechanism
- Clustering for metric and nonmetric distance measures
- Comparing clusterings -- an information based distance
- Comparing Degenerate Strings
- Compressed Weighted de Bruijn Graphs
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Efficient randomized pattern-matching algorithms
- Finding Groups in Data
- scientific article; zbMATH DE number 2140075 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- scientific article; zbMATH DE number 7651098 (Why is no real title available?)
- scientific article; zbMATH DE number 7695995 (Why is no real title available?)
- scientific article; zbMATH DE number 7696005 (Why is no real title available?)
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Introduction to algorithms.
- Logistic regression models.
- Longest Increasing and Decreasing Subsequences
- Managing and mining uncertain data
- On-line construction of suffix trees
- Random forest missing data algorithms
- Random forests
- Statistical analysis with missing data
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: Missing value replacement in strings and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008047)