Large Scale Kernel Machines (3 results)

Title
Refine with Advanced Search

Refine your search

  • Books (3)

to

Custom price range (US$)

to

  • Language: English

    Published by MIT Press, 2007

    0262026252 / 9780262026253

    • Hardcover

    Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.ThriftBooks-Dallas

    5-star seller
    Contact seller

    Condition: Used - Very good

    US$ 23.37

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

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

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384654146X / 9783846541463

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    US$ 60.45

    US$ 80.40 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: 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.

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384654146X / 9783846541463

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    US$ 69.80

    US$ 70.16 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: 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.