{"id":"W2093729845","doi":"10.5539/cis.v7n1p94","title":"3N-Q: Natural Nearest Neighbor with Quality","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Outlier; Cluster analysis; Nearest-neighbor chain algorithm; Data mining; Pattern recognition (psychology); Nearest neighbor search; Best bin first; Artificial intelligence; Quality (philosophy); Value (mathematics); Nearest neighbor graph; Function (biology); Machine learning; Fuzzy clustering; Canopy clustering algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003007615,0.0006999436,0.001552511,0.002165611,0.001168384,0.001361492,0.002800795,0.00152451,0.00204106],"category_scores_gemma":[0.01178085,0.0004351406,0.001056916,0.002333793,0.001112957,0.002618865,0.002040494,0.001318551,0.001119655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214489,"about_ca_system_score_gemma":0.001622066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006254356,"about_ca_topic_score_gemma":0.007126184,"domain_scores_codex":[0.9961021,0.0008464073,0.000291488,0.0006970541,0.001855788,0.0002072251],"domain_scores_gemma":[0.9951797,0.001498,0.0004844279,0.0008355867,0.001806684,0.0001957504],"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.0005548337,0.0002267766,0.01033422,0.0003417156,0.0001471011,0.0001969435,0.0003078,0.1147689,0.00930887,0.0190623,0.01020656,0.8345441],"study_design_scores_gemma":[0.00006900104,0.0002118619,0.002026738,0.00003217761,0.0000319783,0.0004856184,0.00009450889,0.9644898,0.005771343,0.01744825,0.009272783,0.00006598508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0110604,0.0004910747,0.9860313,0.0001717355,0.0001189991,0.0001325791,0.0001114028,0.0008936464,0.0009888284],"genre_scores_gemma":[0.2115653,0.000332497,0.7845796,0.0002878743,0.00009709241,0.0002905876,0.0005254886,0.0001761725,0.002145443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006254356,"threshold_uncertainty_score":0.01590604,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007062638474805923,"score_gpt":0.2465234933179873,"score_spread":0.2394608548431813,"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."}}