Showing 101 - 120 results of 440 for search '"curse of dimensionality"', query time: 0.08s Refine Results
  1. 101

    Quantifying dissipation using fluctuating currents by Li, Junang, Horowitz, Jordan M, Gingrich, Todd R, Fakhri, Nikta

    Published 2021
    “…Probability currents can be inferred and utilized to indirectly quantify the entropy production rate, but this approach requires prohibitive amounts of data in high-dimensional systems. This curse of dimensionality can be partially mitigated by using the thermodynamic uncertainty relation to bound the entropy production rate using statistical fluctuations in the probability currents.…”
    Get full text
    Article
  2. 102

    Intelligent job shop scheduling via deep reinforcement learning over graphs by Zhang, Cong

    Published 2023
    “…One is high computation overhead due to the nature of computational inefficiency of the methods and the curse of dimensionality (the problem sizes). The other is that existing methods strongly depend on human expert experience for algorithm design, which is less automatic. …”
    Get full text
    Thesis-Doctor of Philosophy
  3. 103

    A study of dimensionality reduction as subspace data embedding linked by multidimensional scaling by Wang, Wan Qiu

    Published 2011
    “…The first category is to mitigate the computational load and to address the Curse-of-Dimensionality, and the second category is to model the data spread or manifold. …”
    Get full text
    Thesis
  4. 104

    Find your neighbors (quickly!) by Wong, Wei Tian.

    Published 2012
    “…Therefore in recent years, the approximate nearest neighbor solution was proposed to mitigate the curse of dimensionality issue. These approximate algorithms are known to provide large speedups with a minor tradeoff between the loss of efficiency or accuracy. …”
    Get full text
    Final Year Project (FYP)
  5. 105

    Efficient algorithms for Bayesian semi-parametric regression models by Zhao Kaifeng

    Published 2015
    “…They are known to be very flexible while overcoming the problem of ‘curse of dimensionality’, and thus find numerous applications in the fields of econometrics, bioinformatics, biomedicine and others. …”
    Get full text
    Thesis
  6. 106

    Numerically solving parametric families of high-dimensional Kolmogorov partial differential equations via deep learning by Berner, J, Dablander, M, Grohs, P

    Published 2020
    “…Most notably, our numerical observations and theoretical results also demonstrate that the proposed method does not suffer from the curse of dimensionality, distinguishing it from almost all standard numerical methods for PDEs.…”
    Conference item
  7. 107

    The damped stochastic wave equation on post-critically finite fractals by Hambly, B, Yang, W

    Published 2020
    “…The fractal spaces that we work with always have spectral dimension less than 2, and show that this is the right analog of dimension to express the “curse of dimensionality” of the stochastic wave equation. …”
    Conference item
  8. 108

    Integrative gene selection for classification of microarray data by Ong, Huey Fang, Mustapha, Norwati, Sulaiman, Md. Nasir

    Published 2011
    “…The main challenge in building this classification system is the curse of dimensionality problem. Thus, there is a considerable amount of studies on gene selection method for building effective classification models. …”
    Get full text
    Article
  9. 109

    An overview of outlier detection methods by Md. Sap, Mohd. Noor, Mohebi, Ehsan

    Published 2008
    “…In high dimensional datasets, it's very difficult to find outliers with the measure of distance or density methods, because in such spaces the data become sparse and the imagination of data distribution is also hard. So with the curse of dimensionality we discuss a cluster based method that examines the behavior of the data in low dimensional projection. …”
    Get full text
    Article
  10. 110

    An adapted cuckoo optimization algorithm and genetic algorithm approach to the university course timetabling problem by Wibowo, Antoni, Teoh, Chong Keat, Ngadiman, Mohd. Salihin

    Published 2014
    “…This algorithm includes features such as local random walk on discrete data which mimics the behavior of Lévy flights and an Elitism-based mechanism which echoes back the best candidate solutions and prevents the algorithm from plunging into a curse of dimensionality. The algorithm was tested on a problem instance gathered from a University in Malaysia and the results indicate that the proposed algorithm exhibits very promising results in terms of solution quality and computational speed when compared to genetic algorithms…”
    Article
  11. 111

    Optimal decision policy development for hybrid MTS-MTO supply chains by Wang, Fengyu

    Published 2015
    “…Over multi-period planning horizon, the development of joint control policy faces the “curse of dimensionality” precluding an exhaustive search for the optimal policy in polynomial time. …”
    Get full text
    Thesis
  12. 112

    Deep Q-Learning Aided Energy-Efficient Caching and Transmission for Adaptive Bitrate Video Streaming Over Dynamic Cellular Networks by Junfeng Xie

    Published 2024-01-01
    “…Since the action space of the MDP is huge, to cope with the “curse of dimensionality”, linear approximation is integrated into the designed algorithm. …”
    Get full text
    Article
  13. 113

    Non-Uniform Embedding Scheme and Low-Dimensional Approximation Methods for Causality Detection by Angeliki Papana

    Published 2020-07-01
    “…The non-uniform embedding (NUE) scheme has been developed to address the “curse of dimensionality”, since the estimation relies on high-dimensional conditional mutual information (CMI) terms. …”
    Get full text
    Article
  14. 114

    Kinetic Theory Modeling and Efficient Numerical Simulation of Gene Regulatory Networks Based on Qualitative Descriptions by Francisco Chinesta, Morgan Magnin, Olivier Roux, Amine Ammar, Elias Cueto

    Published 2015-04-01
    “…The last equation is efficiently solved by considering a separated representation within the proper generalized decomposition framework that allows circumventing the so-called curse of dimensionality. Finally, model parameters can be added as extra-coordinates in order to obtain a parametric solution of the model.…”
    Get full text
    Article
  15. 115

    UAV Formation Shape Control via Decentralized Markov Decision Processes by Md Ali Azam, Hans D. Mittelmann, Shankarachary Ragi

    Published 2021-03-01
    “…As most decision-theoretic formulations suffer from the curse of dimensionality, we adapt an existing fast approximate dynamic programming method called <i>nominal belief-state optimization</i> (NBO) to approximately solve the formation control problem. …”
    Get full text
    Article
  16. 116

    Basic pathway decomposition of biochemical reaction networks within growing cells by Jay R. Walton, Paul A. Lindahl

    Published 2024-01-01
    “…The algorithm used to construct the set of basic pathways scales as a polynomial of the system size in contrast to the NP-hard algorithms employed in the traditional notions of solution named extreme pathways, elementary flux modes, MEMos, and MinSpan, and that therefore suffer from the curse of dimensionality. The basic pathways approach is applied to a metabolic network consisting of a simplified version of the TCA cycle coupled to glycolysis highlighting that each basic pathway has a readily understood chemical interpretation. …”
    Get full text
    Article
  17. 117

    An Adaptive-to-Model Test for Parametric Functional Single-Index Model by Lili Xia, Tingyu Lai, Zhongzhan Zhang

    Published 2023-04-01
    “…However, this kind of test suffers from the curse of dimensionality, resulting in slow convergence, especially for functional data with infinite dimensional features. …”
    Get full text
    Article
  18. 118

    An algorithm to create model file for Partially Observable Markov Decision Process for mobile robot path planning by Shripad V. Deshpande, R. Harikrishnan, Jahariah Sampe, Abhimanyu Patwa

    Published 2024-06-01
    “…The Partially Observable Markov Decision Process (POMDP), a mathematical framework for decision-making in uncertain environments suffers from the curse of dimensionality. There are various methods that can handle huge sizes of POMDP matrices to create approximate solutions, but no serious effort has been reported to effectively control the size of the POMDP matrices. …”
    Get full text
    Article
  19. 119

    Multi-Class Skin Lesions Classification Using Deep Features by Muhammad Usama, M. Asif Naeem, Farhaan Mirza

    Published 2022-10-01
    “…Lastly, optimal features were selected using moth flame optimization (MFO) to overcome the curse of dimensionality. This helped us in improving accuracy and efficiency of our model. …”
    Get full text
    Article
  20. 120

    Efficient machine learning of solute segregation energy based on physics-informed features by Zongyi Ma, Zhiliang Pan

    Published 2023-07-01
    “…Lumping many features together can give a decent accuracy but may suffer the curse of dimensionality. Here, we modeled the segregation energy with efficient machine learning using physics-informed features identified based on solid physical understanding. …”
    Get full text
    Article