Paperback (22 Mar 2020)
Not available for sale
Out of stock
In this research investigation, the author has presented a Novel way of finding the Optimal Number of Clusters for use in the K-Means Clustering Algorithm using a Novel definition of a Complement of a Vector or an n Dimensional Matrix.
| ISBN: | 9798629329602 |
| Publisher: | Independently Published |
| Imprint: | Independently Published |
| Pub date: | 22 Mar 2020 |
| Language: | English |
| Number of pages: | 86 |
| Weight: | 136g |
| Height: | 229mm |
| Width: | 152mm |
| Spine width: | 5mm |
Education and Technology
Paperback
Published 16 Dec 2021
$1.48off
Sweet Distress
Paperback
Published 31 Mar 2020
Save $1.48
$7.22off
Effective Practices in AI Liter...
Hardback
Published 12 Dec 2024
Save $7.22
$8.26off
Academic Identity in the Age of...
Hardback
Published 09 Dec 2024
Save $8.26
$6.62off
Let's All Teach Computer Science!
Paperback
Published 30 Jul 2024
Save $6.62
Generative AI in Higher Education
Hardback
Published 17 Jan 2025
$5.96off
Families at Play
Paperback
Published 02 Jul 2024
Save $5.96
Whatsapp Mastery for Grandpas
Paperback
Published 07 Dec 2015
$44.41off
Revolutionizing English Education
Hardback
Published 16 May 2024
Save $44.41