Adaptive data reduction for large-scale transaction data
From MaRDI portal
Recommendations
- Data reduction via adaptive sampling.
- Enhancing Density-Based Data Reduction Using Entropy
- DB-HReduction: a data preprocessing algorithm for data mining applications
- Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
- Identifying approximate itemsets of interest in large databases
Cites work
- A note on genetic algorithms for large-scale feature selection
- A unifying view on instance selection
- Adaptive sampling methods for scaling up knowledge discovery algorithms
- Data reduction via adaptive sampling.
- Direct Marketing Performance Modeling Using Genetic Algorithms
- Generation of reducts and rules in multi-attribute and multi-criteria classification
- Genetic Algorithms for Product Design
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 2111986 (Why is no real title available?)
Cited in
(8)- Data reduction via adaptive sampling.
- Efficient data reconciliation
- Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
- Comparison of imputation methods for discriminant analysis with strategically hidden data
- \(T\)-closeness slicing: a new privacy-preserving approach for transactional data publishing
- Enhancing Density-Based Data Reduction Using Entropy
- An algorithm for reducing the dimension and size of a sample for data exploration procedures
- Synergies of operations research and data mining
This page was built for publication: Adaptive data reduction for large-scale transaction data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475835)
