Nearest Neighbors - Query
I want to design a RM flow, where applying KNN model should return the k nearest neighbors instead of predicting the class of the unlabeled data based on k nearest neighbors.
i.e if I provide one row of input data, the result I need is the k records which are neighbors to it, nothing more.
Here i am attempting to design a recommendation system using rapid miner flow. I am not sure if its possible to design such a flow. I would be grateful if anybody can help.
Thanks,
Venki
i.e if I provide one row of input data, the result I need is the k records which are neighbors to it, nothing more.
Here i am attempting to design a recommendation system using rapid miner flow. I am not sure if its possible to design such a flow. I would be grateful if anybody can help.
Thanks,
Venki
Find more posts tagged with
Sort by:
1 - 5 of
51
RapidMiner 5 has an operator called Cross Distances, which exactly does what you are longing for. You must give it two example sets, one containing the request examples and one containing the reference examples. It will return the top k nearest or farthest examples on any distance measure available.
If you build your recommendation system, please keep in mind that it has to be licensed under the AGPL3 unless you have bought an OEM license of RapidMiner.
Greetings,
Sebastian