I'm trying to run KNN on set of standardized inputs and identify 20 neighbors using Euclidean distance or other similar distance.
I would like to get top N neighbor, distance between the neighbors and my item as output. I don't have a target variable in my dataset, so I need this procedure to identify my neighbors based only on input space. I have 21K items and 145 variables in my dataset, so I'm also looking for efficiency of the procedure.
I tried MBR node in Enterprise miner and PROC DISCRIM in base SAS, but both requires target variable.
Can anyone kindly point me to the right procedure that would be helpful to implement my problem. Let me know if any other details are needed.
Thanks in advance
Try: Proc Cluster, Aceclus and Fastclus
Registration is open! SAS is returning to Vegas for an AI and analytics experience like no other! Whether you're an executive, manager, end user or SAS partner, SAS Innovate is designed for everyone on your team. Register for just $495 by 12/31/2023.
If you are interested in speaking, there is still time to submit a session idea. More details are posted on the website.
Learn the difference between classical and Bayesian statistical approaches and see a few PROC examples to perform Bayesian analysis in this video.
Find more tutorials on the SAS Users YouTube channel.