{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HZ44SYQ5CD44CSMTR7MWT23BNQ","short_pith_number":"pith:HZ44SYQ5","schema_version":"1.0","canonical_sha256":"3e79c9621d10f9c149938fd969eb616c17cd76d1680cafbea5678880b12bcaba","source":{"kind":"arxiv","id":"1903.05962","version":1},"attestation_state":"computed","paper":{"title":"Low-rank Kernel Learning for Graph-based Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Liangjian Wen, Wenyu Chen, Zenglin Xu, Zhao Kang","submitted_at":"2019-03-14T12:59:52Z","abstract_excerpt":"Constructing the adjacency graph is fundamental to graph-based clustering. Graph learning in kernel space has shown impressive performance on a number of benchmark data sets. However, its performance is largely determined by the chosen kernel matrix. To address this issue, the previous multiple kernel learning algorithm has been applied to learn an optimal kernel from a group of predefined kernels. This approach might be sensitive to noise and limits the representation ability of the consensus kernel. In contrast to existing methods, we propose to learn a low-rank kernel matrix which exploits "},"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":"1903.05962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-14T12:59:52Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2e66b3dbb4aabbd5389c411d3478d0db450c18ec720181f0f01ad3f8298e40c3","abstract_canon_sha256":"7ff7f3b7d397519bc80613f184ec24a232fdae05b9113807a591539c2dc97092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.708648Z","signature_b64":"bAkfma/rtnvYdDodBYyu3XgFMaBC3jEa3Ph6sfxM4gPbnEizYVU3HOa0+cvH6ztGtuXk6k55GASbtTKRr/+SCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e79c9621d10f9c149938fd969eb616c17cd76d1680cafbea5678880b12bcaba","last_reissued_at":"2026-05-17T23:51:15.708202Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.708202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Kernel Learning for Graph-based Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Liangjian Wen, Wenyu Chen, Zenglin Xu, Zhao Kang","submitted_at":"2019-03-14T12:59:52Z","abstract_excerpt":"Constructing the adjacency graph is fundamental to graph-based clustering. Graph learning in kernel space has shown impressive performance on a number of benchmark data sets. However, its performance is largely determined by the chosen kernel matrix. To address this issue, the previous multiple kernel learning algorithm has been applied to learn an optimal kernel from a group of predefined kernels. This approach might be sensitive to noise and limits the representation ability of the consensus kernel. In contrast to existing methods, we propose to learn a low-rank kernel matrix which exploits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05962","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":"1903.05962","created_at":"2026-05-17T23:51:15.708262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05962v1","created_at":"2026-05-17T23:51:15.708262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05962","created_at":"2026-05-17T23:51:15.708262+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZ44SYQ5CD44","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZ44SYQ5CD44CSMT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZ44SYQ5","created_at":"2026-05-18T12:33:18.533446+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/HZ44SYQ5CD44CSMTR7MWT23BNQ","json":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ.json","graph_json":"https://pith.science/api/pith-number/HZ44SYQ5CD44CSMTR7MWT23BNQ/graph.json","events_json":"https://pith.science/api/pith-number/HZ44SYQ5CD44CSMTR7MWT23BNQ/events.json","paper":"https://pith.science/paper/HZ44SYQ5"},"agent_actions":{"view_html":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ","download_json":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ.json","view_paper":"https://pith.science/paper/HZ44SYQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05962&json=true","fetch_graph":"https://pith.science/api/pith-number/HZ44SYQ5CD44CSMTR7MWT23BNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HZ44SYQ5CD44CSMTR7MWT23BNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ/action/storage_attestation","attest_author":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ/action/author_attestation","sign_citation":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ/action/citation_signature","submit_replication":"https://pith.science/pith/HZ44SYQ5CD44CSMTR7MWT23BNQ/action/replication_record"}},"created_at":"2026-05-17T23:51:15.708262+00:00","updated_at":"2026-05-17T23:51:15.708262+00:00"}