{"id":"W2142103633","doi":"10.1109/tkde.2006.172","title":"Discovering Frequent Closed Partial Orders from Strings","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Multiset; Data mining; String (physics); Pruning; Set (abstract data type); Knowledge extraction; Order (exchange); Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.00008104604,0.0001492711,0.000122726,0.00008592279,0.0001420045,0.0001899458,0.0006378362,0.00004413474,0.000008920797],"category_scores_gemma":[0.000002348714,0.0001527701,0.00002621944,0.0002340124,0.00001832911,0.0007576906,0.00002214874,0.0001532406,0.00003306237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002516229,"about_ca_system_score_gemma":0.00002570348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004847812,"about_ca_topic_score_gemma":0.00008797783,"domain_scores_codex":[0.9990181,0.000007836794,0.0001836054,0.0004833777,0.00009854178,0.0002085265],"domain_scores_gemma":[0.9989446,0.00008500744,0.00002527378,0.0008537541,0.00001596807,0.00007543514],"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.00001634502,0.0009825596,0.00007444298,0.00009596853,0.0002083218,0.00002896053,0.0008142356,0.08190013,0.02814152,0.01764404,0.003848367,0.8662451],"study_design_scores_gemma":[0.0003411898,0.00002322897,0.0003339497,0.00004581538,0.00002177482,0.000003886598,0.00001091036,0.9626608,0.01192566,0.00008028219,0.0243016,0.0002508315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0177417,0.000153687,0.980753,0.00007641144,0.0003722316,0.00008412961,0.0004548825,0.0002235896,0.0001403496],"genre_scores_gemma":[0.9338047,0.00004879589,0.06574257,0.00001367867,0.0001530315,0.00003123274,0.0001263956,0.00001734937,0.0000622417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.916063,"threshold_uncertainty_score":0.6229783,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01726091384251803,"score_gpt":0.2454227689265866,"score_spread":0.2281618550840686,"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."}}