Michal Černý
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Michal Černý has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Milan Hladík
Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
14 shared publications - Miroslav Rada
Department of Econometrics, Faculty of Informatics and Statistics, Prague University of Economics and Business, Prague, Czech Republic
9 shared publications - Jaromír Antoch
Charles University
5 shared publications - Ondřej Sokol
Department of Econometrics, Prague University of Economics and Business, Prague, Czech Republic
5 shared publications - Vladimír Holý
Department of Econometrics, Prague University of Economics and Business, Prague, Czech Republic
3 shared publications Miroslav Rada
University of Economics
2 shared publications
Latest Publications
- 3 July 2024
- Published by Springer Nature in computational complexity
- Vol. 33 (2) , 1-32
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
- 3 July 2024
- Published by Springer Nature in computational complexity
- Vol. 33 (2) , 1-32
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
- Open Access
Clustering Retail Products Based on Customer Behaviour
The categorization of retail products is essential for the business decision-making process. It is a common practice to classify products based on their quantitative and qualitative characteristics. In this paper we use a purely data-driven approach. Our clustering of products is based exclusively on the customer behaviour. We propose a method for clustering retail products using market basket data. Our model is formulated as an optimization problem which is solved by a genetic algorithm. It is demonstrated on simulated data how our method behaves in different settings. The application using real data from a Czech drugstore company shows that our method leads to similar results in comparison with the classification by experts. The number of clusters is a parameter of our algorithm. We demonstrate that if more clusters are allowed than the original number of categories is, the method yields additional information about the structure of the product categorization.
Open AccessClustering Retail Products Based on Customer Behaviour
The categorization of retail products is essential for the business decision-making process. It is a common practice to classify products based on their quantitative and qualitative characteristics. In this paper we use a purely data-driven approach. Our clustering of products is based exclusively on the customer behaviour. We propose a method for clustering retail products using market basket data. Our model is formulated as an optimization problem which is solved by a genetic algorithm. It is demonstrated on simulated data how our method behaves in different settings. The application using real data from a Czech drugstore company shows that our method leads to similar results in comparison with the classification by experts. The number of clusters is a parameter of our algorithm. We demonstrate that if more clusters are allowed than the original number of categories is, the method yields additional information about the structure of the product categorization.
- 3 May 2024
- Published by Springer Nature in Computational Statistics
- Vol. 40 (1) , 405-439
R-estimation in linear models: algorithms, complexity, challenges
- 3 May 2024
- Published by Springer Nature in Computational Statistics
- Vol. 40 (1) , 405-439
R-estimation in linear models: algorithms, complexity, challenges
- Open Access
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with high probability
We consider the algorithm by Ferson et al. (Reliable computing 11(3), p. 207-233, 2005) designed for solving the NP-hard problem of computing the maximal sample variance over interval data, motivated by robust statistics (in fact, the formulation can be written as a nonconvex quadratic program with a specific structure). First, we propose a new version of the algorithm improving its original time bound $O(n^2 2^\omega)$ to $O(n \log n+n\cdot 2^\omega)$, where $n$ is number of input data and $\omega$ is the clique number in a certain intersection graph. Then we treat input data as random variables as it is usual in statistics) and introduce a natural probabilistic data generating model. We get $2^\omega = O(n^{1/\log\log n})$ and $\omega = O(\log n / \log\log n)$ on average. This results in average computing time $O(n^{1+\epsilon})$ for $\epsilon > 0$ arbitrarily small, which may be considered as "surprisingly good" average time complexity for solving an NP-hard problem. Moreover, we prove the following tail bound on the distribution of computation time: hard instances, forcing the algorithm to compute in time $2^{\Omega(n)}$, occur rarely, with probability tending to zero at the rate $e^{-n\log\log n}$.Open AccessThe NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with high probability
We consider the algorithm by Ferson et al. (Reliable computing 11(3), p. 207-233, 2005) designed for solving the NP-hard problem of computing the maximal sample variance over interval data, motivated by robust statistics (in fact, the formulation can be written as a nonconvex quadratic program with a specific structure). First, we propose a new version of the algorithm improving its original time bound $O(n^2 2^\omega)$ to $O(n \log n+n\cdot 2^\omega)$, where $n$ is number of input data and $\omega$ is the clique number in a certain intersection graph. Then we treat input data as random variables as it is usual in statistics) and introduce a natural probabilistic data generating model. We get $2^\omega = O(n^{1/\log\log n})$ and $\omega = O(\log n / \log\log n)$ on average. This results in average computing time $O(n^{1+\epsilon})$ for $\epsilon > 0$ arbitrarily small, which may be considered as "surprisingly good" average time complexity for solving an NP-hard problem. Moreover, we prove the following tail bound on the distribution of computation time: hard instances, forcing the algorithm to compute in time $2^{\Omega(n)}$, occur rarely, with probability tending to zero at the rate $e^{-n\log\log n}$. - 3 March 2022
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 435-447
The last dozen of years of OR research in Czechia and Slovakia
- 3 March 2022
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 435-447
The last dozen of years of OR research in Czechia and Slovakia
- 22 November 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 449-477
Microfinance in Sub-Saharan Africa: social efficiency, financial efficiency and institutional factors
- 22 November 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 449-477
Microfinance in Sub-Saharan Africa: social efficiency, financial efficiency and institutional factors
- 25 September 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 573-593
Efficiency of antiquarian bookshops in informationally complete markets
- 25 September 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 573-593
Efficiency of antiquarian bookshops in informationally complete markets
- 21 July 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 667-682
Bertram’s pairs trading strategy with bounded risk
- 21 July 2021
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 30 (2) , 667-682
Bertram’s pairs trading strategy with bounded risk
- Open Access
Bertram's Pairs Trading Strategy with Bounded Risk
Finding Bertram's optimal trading strategy for a pair of cointegrated assets following the Ornstein--Uhlenbeck price difference process can be formulated as an unconstrained convex optimization problem for maximization of expected profit per unit of time. This model is generalized to the form where the riskiness of profit, measured by its per-time-unit volatility, is controlled (e.g. in case of existence of limits on riskiness of trading strategies imposed by regulatory bodies). The resulting optimization problem need not be convex. In spite of this undesirable fact, it is demonstrated that the problem is still efficiently solvable. In addition, the problem that parameters of the price difference process are never known exactly and are imprecisely estimated from an observed finite sample is investigated (recalling that this problem is critical for practice). It is shown how the imprecision affects the optimal trading strategy by quantification of the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly. The main results focus on the geometric and optimization-theoretic viewpoint of the risk-bounded trading strategy and the imprecision resulting from the statistical estimates.
Open AccessBertram's Pairs Trading Strategy with Bounded Risk
Finding Bertram's optimal trading strategy for a pair of cointegrated assets following the Ornstein--Uhlenbeck price difference process can be formulated as an unconstrained convex optimization problem for maximization of expected profit per unit of time. This model is generalized to the form where the riskiness of profit, measured by its per-time-unit volatility, is controlled (e.g. in case of existence of limits on riskiness of trading strategies imposed by regulatory bodies). The resulting optimization problem need not be convex. In spite of this undesirable fact, it is demonstrated that the problem is still efficiently solvable. In addition, the problem that parameters of the price difference process are never known exactly and are imprecisely estimated from an observed finite sample is investigated (recalling that this problem is critical for practice). It is shown how the imprecision affects the optimal trading strategy by quantification of the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly. The main results focus on the geometric and optimization-theoretic viewpoint of the risk-bounded trading strategy and the imprecision resulting from the statistical estimates.
- 19 February 2021
- Published by Springer Nature in Optimization Letters
- Vol. 15 (6) , 2331-2341
A new polynomially solvable class of quadratic optimization problems with box constraints
- 19 February 2021
- Published by Springer Nature in Optimization Letters
- Vol. 15 (6) , 2331-2341
A new polynomially solvable class of quadratic optimization problems with box constraints