{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A7NLXJC6ZI2TFTKYRMXMB47UES","short_pith_number":"pith:A7NLXJC6","schema_version":"1.0","canonical_sha256":"07dabba45eca3532cd588b2ec0f3f424ae2a642ee88b5c97ae2b1a3c924c4f78","source":{"kind":"arxiv","id":"1610.06998","version":1},"attestation_state":"computed","paper":{"title":"Ranking of classification algorithms in terms of mean-standard deviation using A-TOPSIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andre G. C. Pacheco, Renato A. Krohling","submitted_at":"2016-10-22T05:19:44Z","abstract_excerpt":"In classification problems when multiples algorithms are applied to different benchmarks a difficult issue arises, i.e., how can we rank the algorithms? In machine learning it is common run the algorithms several times and then a statistic is calculated in terms of means and standard deviations. In order to compare the performance of the algorithms, it is very common to employ statistical tests. However, these tests may also present limitations, since they consider only the means and not the standard deviations of the obtained results. In this paper, we present the so called A-TOPSIS, based on"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1610.06998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-22T05:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"b75586410c3e7076ea36564397e93ae659fa58c08c751a8bd8ea2ffeec256356","abstract_canon_sha256":"1b6b007d292d227cbbc3570051d92e1753e3ed9e4b674a3c9fbe089ce5f42f5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.467213Z","signature_b64":"bq29wK1l6/nGvcdxpQPCQKsTh4jv03deYsCfm06Ey9xOA0aVEZMT0jvFSNu1K8J7eXtM51/CvOG/O69hb21MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07dabba45eca3532cd588b2ec0f3f424ae2a642ee88b5c97ae2b1a3c924c4f78","last_reissued_at":"2026-05-18T01:01:35.466730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.466730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking of classification algorithms in terms of mean-standard deviation using A-TOPSIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andre G. C. Pacheco, Renato A. Krohling","submitted_at":"2016-10-22T05:19:44Z","abstract_excerpt":"In classification problems when multiples algorithms are applied to different benchmarks a difficult issue arises, i.e., how can we rank the algorithms? In machine learning it is common run the algorithms several times and then a statistic is calculated in terms of means and standard deviations. In order to compare the performance of the algorithms, it is very common to employ statistical tests. However, these tests may also present limitations, since they consider only the means and not the standard deviations of the obtained results. In this paper, we present the so called A-TOPSIS, based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06998","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.06998","created_at":"2026-05-18T01:01:35.466808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06998v1","created_at":"2026-05-18T01:01:35.466808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06998","created_at":"2026-05-18T01:01:35.466808+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7NLXJC6ZI2T","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7NLXJC6ZI2TFTKY","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7NLXJC6","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES","json":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES.json","graph_json":"https://pith.science/api/pith-number/A7NLXJC6ZI2TFTKYRMXMB47UES/graph.json","events_json":"https://pith.science/api/pith-number/A7NLXJC6ZI2TFTKYRMXMB47UES/events.json","paper":"https://pith.science/paper/A7NLXJC6"},"agent_actions":{"view_html":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES","download_json":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES.json","view_paper":"https://pith.science/paper/A7NLXJC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06998&json=true","fetch_graph":"https://pith.science/api/pith-number/A7NLXJC6ZI2TFTKYRMXMB47UES/graph.json","fetch_events":"https://pith.science/api/pith-number/A7NLXJC6ZI2TFTKYRMXMB47UES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES/action/storage_attestation","attest_author":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES/action/author_attestation","sign_citation":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES/action/citation_signature","submit_replication":"https://pith.science/pith/A7NLXJC6ZI2TFTKYRMXMB47UES/action/replication_record"}},"created_at":"2026-05-18T01:01:35.466808+00:00","updated_at":"2026-05-18T01:01:35.466808+00:00"}