Mccrosky Jesse (7 results)
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 81.99
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 68 pages. 8.66x5.91x0.16 inches. In Stock.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 38.24
£ 59.94 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. A New Measure for Clustering Model Selection | Automatic Detection of the Number of Clusters in a Data Set | Jesse McCrosky | Taschenbuch | 68 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838323978 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848…Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 90.89
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 68 pages. 8.66x5.91x0.16 inches. In Stock.
Language: English
Published by LAP LAMBERT Academic Publishing Sep 2010, 2010
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 43.22
£ 19.70 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Typical k-means clustering procedures require a priori knowledge of the number of clusters in the data set. This value can be very difficult to ascertain. Existing heuristic methods work in some cases, but are rarely very reliable.…Herein, a new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from its theoretical basis and its implementation is examined and compared to existing solutions. 68 pp. Englisch.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 36.21
£ 41.95 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: McCrosky JesseJesse McCrosky, M.Math completed his Master s Degree in Computer Science at the University of Waterloo. He is currently pursuing a Ph.D. in Community Health and Epidemiology at the Univers…ity of Saskatchewan and worki.
Language: English
Published by LAP LAMBERT Academic Publishing Sep 2010, 2010
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 43.22
£ 51.38 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Typical k-means clustering procedures require a priori knowledge of the number of clusters in the data set. This value can be very difficult to ascertain. Existing heuristic methods work in some cases, but are rarely very reliable. Here…in, a new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from its theoretical basis and its implementation is examined and compared to existing solutions.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 43.74
£ 51.89 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Typical k-means clustering procedures require a priori knowledge of the number of clusters in the data set. This value can be very difficult to ascertain. Existing heuristic methods work in some cases, but are rarely very reliable. Herei…n, a new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from its theoretical basis and its implementation is examined and compared to existing solutions.
