{"id":"W2001159324","doi":"10.1109/fpl.2012.6339141","title":"K-means implementation on FPGA for high-dimensional data using triangle inequality","year":2012,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"MNIST database; Computer science; Cluster analysis; Triangle inequality; Benchmark (surveying); Software; Curse of dimensionality; Field-programmable gate array; Overhead (engineering); Speedup; Parallel computing; Algorithm; Computer hardware; Computer engineering; Artificial neural network; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429424,0.00008952624,0.0001095139,0.00004678168,0.0001632918,0.00006959714,0.0006181069,0.00002970099,0.00009312492],"category_scores_gemma":[0.00002962489,0.00006845688,0.00002275476,0.0001075867,0.000008808535,0.001511699,0.0006371655,0.00004173749,0.00001992199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003321111,"about_ca_system_score_gemma":0.0000422436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000320944,"about_ca_topic_score_gemma":0.00001447645,"domain_scores_codex":[0.9989523,0.00005583918,0.0002090767,0.0002943574,0.0002373046,0.0002511505],"domain_scores_gemma":[0.9987771,0.0001386513,0.00008247131,0.0008736422,0.00004230597,0.00008584284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009109333,0.0007579811,0.001425161,0.00003516313,0.00006992563,0.000001931382,0.0004176805,0.0005007523,0.00515,0.2969686,0.09592957,0.5986522],"study_design_scores_gemma":[0.002674171,0.0002215048,0.007976729,0.00002559575,0.00002895128,0.000007723771,0.00007094727,0.944184,0.01382128,0.004538112,0.02600725,0.0004437152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02222922,0.00002768206,0.9762019,0.0003249578,0.0006453214,0.0002260385,0.0002149451,0.00006491287,0.00006500863],"genre_scores_gemma":[0.3896062,8.863893e-7,0.6086131,0.0006524267,0.0003551852,0.000008677799,0.0007088789,0.000007145303,0.00004747667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9436833,"threshold_uncertainty_score":0.2791591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1868024076149054,"score_gpt":0.4029007120003215,"score_spread":0.2160983043854161,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}