{"id":39,"date":"2016-03-29T15:45:57","date_gmt":"2016-03-29T15:45:57","guid":{"rendered":"http:\/\/kelp.unidevel.it\/?page_id=39"},"modified":"2017-07-20T10:50:07","modified_gmt":"2017-07-20T10:50:07","slug":"javadoc-2","status":"publish","type":"page","link":"http:\/\/www.kelp-ml.org\/?page_id=39","title":{"rendered":"Input Data Format"},"content":{"rendered":"

The dataset input format for KeLP\u00a0takes inspiration from the SvmLight\/LibSVM formalism, extending it in order to deal with multiple labels and multiple representations. Notice that the following classes are described here<\/a>.<\/p>\n

A dataset is generally represented in a text file, where each row is\u00a0an example, that can have one of the following forms:<\/p>\n

label1 ... labelN |Btype1:name1|description|Etype1| |Btype2:name2|description|Etype2| ...\r\nlabel1 ... labelN |<| leftExample |,| rightExample |>|\r\n<\/pre>\n
The former row refers to a SimpleExample<\/a> while the latter describes an ExamplePair<\/a>, where leftExample<\/em> and rightExample<\/em> recursively have the form of one of these two formalisms.<\/p>\n
Each example starts with a list of labels separated by a white space. A label can be a simple string in the case of a classification label, or can have the form propertyName:value<\/em> (for instance height:10<\/em>) in the case of regression values. This formalisms allows to deal with multilabel classification tasks as well as with multivariate regression tasks. Note that an isolated number will be considered a classification label.<\/p>\n
In the SimpleExample<\/a>\u00a0case, after the labels parts, a list of representations begins. In the previous example there are two representations. Each representation must be included between a begin of representation<\/em> sequence of the form |Btype:name<\/em>|| and an end of representation<\/em> sequence of the form |Etype<\/em>| where type<\/em> is an identifier of the representation class (e.g., V for SparseVector<\/a>) and name<\/em>\u00a0is an identifier for that specific representation (e.g.,\u00a0BoW for a bag-of-words representation). If no name is specified for a representation, it will be identified by its position within the sequence (i.e., the third representation will be automatically named 3). The name identifies uniquely a representation for an example and it is necessary to support examples having multiple representations of the same class.<\/p>\n
Each representation has its own formalism:<\/p>\n