Affiner la recherche

  • Livres (7)

à

Fourchette de prix personnalisée (EUR)

à

Large scale kernel machines (7 résultats)

Titre: 
Affiner les résultats avec une recherche avancée
  • Langue : anglais

    Edité par MIT Press, 2007

    0262026252 / 9780262026253

    • Couverture rigide

    Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-UnisThriftBooks-Atlanta

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Occasion - Satisfaisant

    EUR 21,95

     Frais de port gratuits 
    Expédition nationale : Etats-Unis

    Quantité disponible : 1 disponible

    Hardcover. Etat : Good. No Jacket. Missing dust jacket; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

  • Langue : anglais

    Edité par MIT Press, 2007

    0262026252 / 9780262026253

    • Couverture rigide

    Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-UnisThriftBooks-Dallas

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Occasion - Assez bon

    EUR 21,95

     Frais de port gratuits 
    Expédition nationale : Etats-Unis

    Quantité disponible : 1 disponible

    Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

  • Langue : anglais

    Edité par The MIT Press, 2007

    0262026252 / 9780262026253

    • Couverture rigide

    Vendeur : HPB-Red, Dallas, TX, Etats-UnisHPB-Red

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Occasion - Satisfaisant

    EUR 20,29

    EUR 3,42 expédition 
    Expédition nationale : Etats-Unis

    Quantité disponible : 1 disponible

    Hardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

  • Langue : anglais

    Edité par LAP LAMBERT Academic Publishing, 2011

    384654146X / 9783846541463

    • Couverture souple

    Vendeur : preigu, Osnabrück, Allemagnepreigu

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Neuf

    EUR 51,35

    EUR 70,00 expédition 
    Expédition depuis Allemagne vers Etats-Unis

    Quantité disponible : 5 disponibles

    Taschenbuch. Etat : Neu. Efficient Kernel Methods For Large Scale Classification | Scalable methods for training Support Vector Machines | Asharaf S | Taschenbuch | 132 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846541463 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

  • Langue : anglais

    Edité par LAP LAMBERT Academic Publishing, 2011

    384654146X / 9783846541463

    • Couverture souple

    Vendeur : Home-set, Mannheim, AllemagneHome-set

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Neuf

    EUR 73,75

    EUR 49,90 expédition 
    Expédition depuis Allemagne vers Etats-Unis

    Quantité disponible : 2 disponibles

    Softcover/Taschenbuch. Etat : Neu. Classification algorithms have been widely used in many application domains. Most of these domains deal with massive collection of data and hence demand classification algorithms that scale well with the size of the data sets involved. A classification algorithm is said to be scalable if there is no significant increase in time and space requirements for the algorithm (without compromising the generalization performance) when dealing with an increase in the training set size. Support Vector Machine (SVM) is one of the most celebrated kernel based classification methods used in Machine Learning. An SVM capable of handling large scale classification problems will definitely be an ideal candidate in many real world applications. The training process involved in SVM classifier is usually formulated as a Quadratic Programing (QP) problem. The existing solution strategies for this problem have an associated time and space complexity that is (at least) quadratic in the number of training points. It makes SVM training very expensive. This thesis addresses the scalability of the training algorithms involved in SVM to make it feasible with large training data sets. Sprache: Englisch Gewicht in Gramm: 215.…

  • Vendeur : Mesilla Internet, Las Cruces, NM, Etats-UnisMesilla Internet

    Vendeur avec une évaluation de 2 étoiles
    Contacter le vendeur

    Etat: Neuf

    EUR 66,27

    EUR 2,73 expédition 
    Expédition nationale : Etats-Unis

    Quantité disponible : 6 disponibles

    Ajouter au panier

    Etat : New.

  • Langue : anglais

    Edité par LAP LAMBERT Academic Publishing, 2011

    384654146X / 9783846541463

    • Couverture souple
    • impression à la demande

    Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH

    Vendeur avec une évaluation de 5 étoiles
    Contacter le vendeur

    Etat: Neuf

    EUR 67,39

    EUR 35,00 expédition 
    Expédition depuis Allemagne vers Etats-Unis

    Quantité disponible : 1 disponible

    Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Classification algorithms have been widely used in many application domains. Most of these domains deal with massive collection of data and hence demand classification algorithms that scale well with the size of the data sets involved. A classification algorithm is said to be scalable if there is no significant increase in time and space requirements for the algorithm (without compromising the generalization performance) when dealing with an increase in the training set size. Support Vector Machine (SVM) is one of the most celebrated kernel based classification methods used in Machine Learning. An SVM capable of handling large scale classification problems will definitely be an ideal candidate in many real world applications. The training process involved in SVM classifier is usually formulated as a Quadratic Programing (QP) problem. The existing solution strategies for this problem have an associated time and space complexity that is (at least) quadratic in the number of training points. It makes SVM training very expensive. This thesis addresses the scalability of the training algorithms involved in SVM to make it feasible with large training data sets.…