http://dbpedia.org/ontology/abstract
|
Margin-infused relaxed algorithm (MIRA) is … Margin-infused relaxed algorithm (MIRA) is a machine learning algorithm, an online algorithm for multiclass classification problems. It is designed to learn a set of parameters (vector or matrix) by processing all the given training examples one-by-one and updating the parameters according to each training example, so that the current training example is classified correctly with a margin against incorrect classifications at least as large as their loss. The change of the parameters is kept as small as possible. A two-class version called binary MIRA simplifies the algorithm by not requiring the solution of a quadratic programming problem (see below). When used in a configuration, binary MIRA can be extended to a multiclass learner that approximates full MIRA, but may be faster to train. The flow of the algorithm looks as follows: Algorithm MIRA Input: Training examples Output: Set of parameters ← 0, ← 0 for ← 1 to for ← 1 to ← update according to ← end for end for return
* "←" denotes assignment. For instance, "largest ← item" means that the value of largest changes to the value of item.
* "return" terminates the algorithm and outputs the following value. The update step is then formalized as a quadratic programming problem: Find , so that , i.e. the score of the current correct training must be greater than the score of any other possible by at least the loss (number of errors) of that in comparison to .mber of errors) of that in comparison to .
|
http://dbpedia.org/ontology/wikiPageExternalLink
|
https://cwiki.apache.org/confluence/display/MAHOUT/Online%2BPassive%2BAggressive +
, https://github.com/jihelhere/adMIRAble +
, https://code.google.com/p/miralium/ +
|
http://dbpedia.org/ontology/wikiPageID
|
24933015
|
http://dbpedia.org/ontology/wikiPageLength
|
3769
|
http://dbpedia.org/ontology/wikiPageRevisionID
|
1000090380
|
http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Hadoop +
, http://dbpedia.org/resource/One-vs-all +
, http://dbpedia.org/resource/Category:Classification_algorithms +
, http://dbpedia.org/resource/Online_algorithm +
, http://dbpedia.org/resource/Margin_%28machine_learning%29 +
, http://dbpedia.org/resource/Apache_Mahout +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Quadratic_programming +
, http://dbpedia.org/resource/Multiclass_classification +
|
http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Algorithm-begin +
, http://dbpedia.org/resource/Template:Algorithm-end +
, http://dbpedia.org/resource/Template:Reflist +
|
http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Classification_algorithms +
|
http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Margin-infused_relaxed_algorithm?oldid=1000090380&ns=0 +
|
http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Margin-infused_relaxed_algorithm +
|
owl:sameAs |
http://dbpedia.org/resource/Margin-infused_relaxed_algorithm +
, http://www.wikidata.org/entity/Q6760391 +
, https://global.dbpedia.org/id/4rFip +
|
rdfs:comment |
Margin-infused relaxed algorithm (MIRA) is … Margin-infused relaxed algorithm (MIRA) is a machine learning algorithm, an online algorithm for multiclass classification problems. It is designed to learn a set of parameters (vector or matrix) by processing all the given training examples one-by-one and updating the parameters according to each training example, so that the current training example is classified correctly with a margin against incorrect classifications at least as large as their loss. The change of the parameters is kept as small as possible. The flow of the algorithm looks as follows:he flow of the algorithm looks as follows:
|
rdfs:label |
Margin-infused relaxed algorithm
|