• DocumentCode
    1934035
  • Title

    The Key Theorem of Learning Theory Based on Random Sets Samples

  • Author

    Ha, Ming-Hu ; Zheng, Li-fang ; Chen, Ji-qiang

  • Author_Institution
    Hebei Univ., Baoding
  • Volume
    5
  • fYear
    2007
  • fDate
    19-22 Aug. 2007
  • Firstpage
    2826
  • Lastpage
    2831
  • Abstract
    Statistical learning theory based on random samples is regarded as the best theory for dealing with small-sample learning problems at present. And it has become an interesting research after neural networks in machine learning. But it can hardly be handle by the learning problems based on random sets samples. In this paper, combined with the theory of random sets, the definition of the subtraction between the set and the real number is presented, and then some correlative theorems are proven. According to these, some of main concepts of statistical learning theory based on random sets samples are introduced, and at last, the key theorem of learning theory based on random sets samples is given and proven.
  • Keywords
    learning (artificial intelligence); neural nets; random processes; set theory; statistical analysis; theorem proving; correlative theorem proving; machine learning; neural networks; random sets samples; statistical learning theory; subtraction definition; Computer science; Cybernetics; Educational institutions; Learning systems; Machine learning; Mathematics; Neural networks; Random variables; Statistical learning; Support vector machines; ERM principle; Hausdorff metric; Key theorem; Random sets; Subtraction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2007 International Conference on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4244-0973-0
  • Electronic_ISBN
    978-1-4244-0973-0
  • Type

    conf

  • DOI
    10.1109/ICMLC.2007.4370629
  • Filename
    4370629