Jan Sobotka’s Post

I implemented the K nearest neighbours algorithm on the iris data set in R. Firstly I cleaned the data and ordered it into a format that the K nearest neighbours algorithm can deal with. I then visualised the data and saw that the data was separated into two clusters based on the type of flower it was (versicolor or setosa). I then chose to test the point (6, 7) with K = 3 to determine which flower it would classify as. After implementing the algorithm it classified as versicolor. Here is the code: https://lnkd.in/eSYhsPWc

Day 2 of GFG POTD Question: - Largest Number formed from an Array Topic: -Arrays, Data Structures

By examining both scatter plots side by side, one can gain a more comprehensive understanding of the data's structure and relationships. The original data plot showcases the true variability and distribution, while the min-max scaled data plot highlights relative positions and patterns, making it easier to interpret relationships and compare different datasets on a standardized scale.

📌 Merkle Trees These are cryptographic data-structure using hashes, that helps verify data integrity without needing to recheck the entire dataset 📌 Merkle Proofs are way of proving that some data is there in the tree

Check out our latest Llama 405B video where you can explore the use of LLMs for fine-tuning and synthetic data generation: https://bit.ly/3AdAano

Binary data in matrices with singular value decomposition method https://lnkd.in/deFzpwDC

this is dataset as give below output DATA G; X="AB12CD34"; run;

BIT is used to store binary data, representing either 0, 1, or NULL. It's commonly used for boolean values, such as true/false or yes/no. Range: 0 or 1 Storage Space: 1 bit per value

Considerations for k-shots: 1. Complexity of the tasks; 2. Quality of the data quality; and 3. Algorithm used. Experiment to balance performance and efficiency.