An algorithm for reducing the dimension and size of a sample for data exploration procedures
From MaRDI portal
Publication:5494417
DOI10.2478/amcs-2014-0011zbMath1292.93044OpenAlexW1988272438MaRDI QIDQ5494417
Piotr Kulczycki, Szymon Łukasik
Publication date: 28 July 2014
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2014-0011
Related Items (4)
Detection of Atypical Elements by Transforming Task to Supervised Form ⋮ Optimization of the maximum likelihood estimator for determining the intrinsic dimensionality of high-dimensional data ⋮ Parallel complete gradient clustering algorithm and its properties ⋮ Dimension reduction for objects composed of vector sets
Uses Software
Cites Work
- Statistical inferences for termination of Markov type random search algorithms
- Data dimensionality estimation methods: A survey.
- Reduction techniques for instance-based learning algorithms
- Feature Subset Selection by Bayesian network-based optimization
- Three-objective genetics-based machine learning for linguistic rule extraction
- Computing the initial temperature of simulated annealing
- Stochastic global optimization.
- FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
- Modern multidimensional scaling. Theory and applications.
- A complete gradient clustering algorithm formed with kernel estimators
- Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Order Statistics
- Pattern Recognition Algorithms for Data Mining
- Data reduction in classification: A simulated annealing based projection method
- A rainfall forecasting method using machine learning models and its application to the Fukuoka city case
- Parallel Metaheuristics
- Handbook of metaheuristics
- Data mining. Concepts and techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm for reducing the dimension and size of a sample for data exploration procedures