I have documents that contain an arbitrary amount of key/value fields. The value can be a primitive or a list.
Completed documents all have an associated state (such as passed, failed, halted, etc.).
Using completed documents as training data in a machine learning algorithm, my goal is to pass the system an incomplete document and determine the probable outcome. Is it more likely that the incomplete document I'm currently looking at will pass, fail or halt?
The identifying information I'm looking to compare here consists mostly of unique keys. So a document could look something like:
id: 1 keys_of_type_x: [x1, x2, x3, ..] keys_of_type_y: [y1, y2, y3, ..] key_z: "sample text field" etc.
I am not necessarily looking for a concrete answer, but more for a push in the right direction with information regarding what algorithm is best suited for this sort of multi-value based classification.