So I have a problem where I have a dataset that includes a list of Tools that are tied to Tasks. The data is structured as follows:
- The users do not rate the Tools, they simply use them in a method that adds the tools to a Task. Every entry in the dataset is a history of the users adding the tool to a Task, so there can be multiple entries of one Tool being added to a different Task
- As of right now, there is no data coming in that shows what user added the Tool. There is only a database of Tools associated with Tasks, giving information about the Task such as how much the task may cost, what Asset the Task is tied to, etc.
- Each Task has a specific code, and Tasks can have many Tools.
I have two questions:
A k-means cluster analysis would tell me that certain Tools are related to each other by the parameters given in the analysis, but would a recommendation system based on suggesting parts that fit into the cluster work if I had enough parameters?
This sounds like a setup for a cold-start problem since there are no user ratings, but I do have data, so is it possible to implement this as a binary classification task at runtime, where I populate the fields of the Tools with specific user information (not ratings, but other things akin to implicit filtering), and then create a new list of parts that are classified as "suggested" or "not-suggested?" If this is possible, are there any algorithms that keep track of user preference parameters in case they update and change the weights of the fields I deem relevant?
Last question, as a sanity check - am I even on the right path here?