Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
    
    
  
  
  
      
      
      
        
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 3, pp. 276-284
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The computational complexity of a new class of combinatorial optimization problems that are induced by optimal machine learning procedures in the class of collective piecewise linear classifiers of committee type is studied.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
empirical risk minimization, committee decision rule, computational complexity.
                    
                  
                
                
                @article{TIMM_2010_16_3_a28,
     author = {M. Yu. Khachai},
     title = {Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {276--284},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a28/}
}
                      
                      
                    TY - JOUR AU - M. Yu. Khachai TI - Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning JO - Trudy Instituta matematiki i mehaniki PY - 2010 SP - 276 EP - 284 VL - 16 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a28/ LA - ru ID - TIMM_2010_16_3_a28 ER -
%0 Journal Article %A M. Yu. Khachai %T Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning %J Trudy Instituta matematiki i mehaniki %D 2010 %P 276-284 %V 16 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a28/ %G ru %F TIMM_2010_16_3_a28
M. Yu. Khachai. Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 3, pp. 276-284. http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a28/