Large scale kernel machines (4 resultados)
- Tapa dura
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de AmericaThriftBooks-Dallas
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 20,83
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Librería: Mesilla Internet, Las Cruces, NM, Estados Unidos de AmericaMesilla Internet
Contactar con el vendedorVendedor de 2 estrellasCondición: Nuevo
EUR 22,17
Envío por EUR 2,59Se envía dentro de Estados Unidos de AmericaCantidad disponible: 6 disponibles
Añadir al carritoCondición: New.
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 51,10
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 61,08Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
