These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

71 related articles for article (PubMed ID: 25420243)

  • 1. A deep connection between the Vapnik-Chervonenkis entropy and the Rademacher complexity.
    Anguita D; Ghio A; Oneto L; Ridella S
    IEEE Trans Neural Netw Learn Syst; 2014 Dec; 25(12):2202-11. PubMed ID: 25420243
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A local Vapnik-Chervonenkis complexity.
    Oneto L; Anguita D; Ridella S
    Neural Netw; 2016 Oct; 82():62-75. PubMed ID: 27474843
    [TBL] [Abstract][Full Text] [Related]  

  • 3. The Vapnik-Chervonenkis dimension of graph and recursive neural networks.
    Scarselli F; Tsoi AC; Hagenbuchner M
    Neural Netw; 2018 Dec; 108():248-259. PubMed ID: 30219742
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Discretized-Vapnik-Chervonenkis dimension for analyzing complexity of real function classes.
    Zhang C; Bian W; Tao D; Lin W
    IEEE Trans Neural Netw Learn Syst; 2012 Sep; 23(9):1461-72. PubMed ID: 24807929
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An improved analysis of the Rademacher data-dependent bound using its self bounding property.
    Oneto L; Ghio A; Anguita D; Ridella S
    Neural Netw; 2013 Aug; 44():107-11. PubMed ID: 23587720
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Structure of indicator function classes with finite Vapnik-Chervonenkis dimensions.
    Zhang C; Tao D
    IEEE Trans Neural Netw Learn Syst; 2013 Jul; 24(7):1156-60. PubMed ID: 24808529
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Model complexity control for regression using VC generalization bounds.
    Cherkassky V; Shao X; Mulier FM; Vapnik VN
    IEEE Trans Neural Netw; 1999; 10(5):1075-89. PubMed ID: 18252610
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Rademacher chaos complexities for learning the kernel problem.
    Ying Y; Campbell C
    Neural Comput; 2010 Nov; 22(11):2858-86. PubMed ID: 20804384
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Refined rademacher chaos complexity bounds with applications to the multikernel learning problem.
    Lei Y; Ding L
    Neural Comput; 2014 Apr; 26(4):739-60. PubMed ID: 24479777
    [TBL] [Abstract][Full Text] [Related]  

  • 10. VC-dimension of univariate decision trees.
    Yildiz OT
    IEEE Trans Neural Netw Learn Syst; 2015 Feb; 26(2):378-87. PubMed ID: 25594983
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On the complexity of computing and learning with multiplicative neural networks.
    Schmitt M
    Neural Comput; 2002 Feb; 14(2):241-301. PubMed ID: 11802913
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Local Rademacher Complexity: sharper risk bounds with and without unlabeled samples.
    Oneto L; Ghio A; Ridella S; Anguita D
    Neural Netw; 2015 May; 65():115-25. PubMed ID: 25734890
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Descartes' rule of signs for radial basis function neural networks.
    Schmitt M
    Neural Comput; 2002 Dec; 14(12):2997-3011. PubMed ID: 12487802
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A comparative analysis of support vector machines and extreme learning machines.
    Liu X; Gao C; Li P
    Neural Netw; 2012 Sep; 33():58-66. PubMed ID: 22572469
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Towards a Unified Theory of Learning and Information.
    Alabdulmohsin I
    Entropy (Basel); 2020 Apr; 22(4):. PubMed ID: 33286212
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Empirical measure of multiclass generalization performance: the K-winner machine case.
    Ridella S; Zunino R
    IEEE Trans Neural Netw; 2001; 12(6):1525-9. PubMed ID: 18249984
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On Consistent Entropy-Regularized k-Means Clustering With Feature Weight Learning: Algorithm and Statistical Analyses.
    Chakraborty S; Paul D; Das S
    IEEE Trans Cybern; 2023 Aug; 53(8):4779-4790. PubMed ID: 35609103
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Measuring the VC-dimension using optimized experimental design.
    Shao X; Cherkassky V; Li W
    Neural Comput; 2000 Aug; 12(8):1969-86. PubMed ID: 10953247
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the capabilities of higher-order neurons: a radial basis function approach.
    Schmitt M
    Neural Comput; 2005 Mar; 17(3):715-29. PubMed ID: 15802012
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Rademacher Complexity for Enhancing the Generalization of Genetic Programming for Symbolic Regression.
    Chen Q; Xue B; Zhang M
    IEEE Trans Cybern; 2022 Apr; 52(4):2382-2395. PubMed ID: 32673201
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.