{"entities":{"Q6825311":{"pageid":15092059,"ns":120,"title":"Item:Q6825311","lastrevid":56069407,"modified":"2026-03-09T07:49:57Z","type":"item","id":"Q6825311","labels":{"en":{"language":"en","value":"support vector machine (svm) training problem (max-margin classification; dual is a convex qp)"}},"descriptions":{"en":{"language":"en","value":"Specialized coordinate descent or qp solvers apply; kernelized duals are qps."}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"0181fa8fd505e26c4a307b8dc70ce23a291f0198","datavalue":{"value":{"entity-type":"item","numeric-id":6775701,"id":"Q6775701"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$B3F19DBA-FA61-4C6B-AEED-61E6D1742B35","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"764735b5e850a89763258ea7664872496b79cdc2","datavalue":{"value":{"entity-type":"item","numeric-id":6534272,"id":"Q6534272"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$0A78FF03-691E-4DBB-B823-5F4E75CB731F","rank":"normal"}],"P1765":[{"mainsnak":{"snaktype":"value","property":"P1765","hash":"07c3e0da5e69974150da0fb3a759d36d43039506","datavalue":{"value":"pr:svm_training","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6825311$42EAD562-C912-4AD6-B47F-8EFAAFCF04D6","rank":"normal"}],"P1578":[{"mainsnak":{"snaktype":"value","property":"P1578","hash":"85eadab73c5b44122b549d97aeceba658a2265bc","datavalue":{"value":{"entity-type":"item","numeric-id":6825603,"id":"Q6825603"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$639272C5-2EE8-4B7F-81B1-252E24BE9E35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1578","hash":"4cf34106b25cd24acc54bf6dfdf21157763fb75e","datavalue":{"value":{"entity-type":"item","numeric-id":6825627,"id":"Q6825627"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$923C472C-A06D-44CB-B9E2-2FF1243966EB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1578","hash":"4245b32365d1b8d5efbdf27e123d3407cf118b4a","datavalue":{"value":{"entity-type":"item","numeric-id":6825368,"id":"Q6825368"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$7C71BB2F-70CB-4B62-A70B-D6205A35990F","rank":"normal"}],"P286":[{"mainsnak":{"snaktype":"value","property":"P286","hash":"8a81ca2ec97ec2aa71aebd09c84f8557c5705f15","datavalue":{"value":{"entity-type":"item","numeric-id":6824243,"id":"Q6824243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P560":[{"snaktype":"value","property":"P560","hash":"9becf743cb663559ec4901fe0e904d18c037cc9e","datavalue":{"value":{"entity-type":"item","numeric-id":6825292,"id":"Q6825292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P560"],"id":"Q6825311$0E7A29AF-ECEF-43B9-AD42-9F7EA204AC7C","rank":"normal"}],"P1495":[{"mainsnak":{"snaktype":"value","property":"P1495","hash":"f2805069b00f1b632c8b9c49f426bddff1a8d1c5","datavalue":{"value":{"entity-type":"item","numeric-id":6830558,"id":"Q6830558"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825311$49B5E26A-A7EA-4E3B-8D9D-62EFFEF899D5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Support vector machine (svm) training problem (max-margin classification; dual is a convex qp)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Support_vector_machine_(svm)_training_problem_(max-margin_classification;_dual_is_a_convex_qp)"}}}}}