{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485871,0.0008262871,0.001650773,0.004723179,0.001016624,0.001918172,0.001098614,0.0009625265,0.0009231555],"category_scores_gemma":[0.01501178,0.0005743806,0.001394089,0.004411127,0.0008975301,0.003432033,0.00119239,0.001149728,0.0004451615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005395763,"about_ca_system_score_gemma":0.001918402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015371,"about_ca_topic_score_gemma":0.002619673,"domain_scores_codex":[0.9971616,0.0004672608,0.0004101244,0.0005759661,0.001170885,0.0002142445],"domain_scores_gemma":[0.9869489,0.008455784,0.001401813,0.001316694,0.00153328,0.00034354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001060183,0.000749558,0.0530154,0.001623452,0.0004457575,0.004391152,0.001666145,0.1408927,0.03525902,0.05267023,0.008462062,0.6997643],"study_design_scores_gemma":[0.00009789277,0.0003136003,0.009357158,0.0001538466,0.0001178326,0.002682037,0.0006911347,0.7034766,0.01903647,0.2536132,0.01036521,0.00009503088],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.272223,0.001294818,0.7156366,0.0006841759,0.00006437194,0.0004384091,0.005819207,0.001985955,0.001853438],"genre_scores_gemma":[0.4113231,0.0007874842,0.5706759,0.0001953525,0.00008160876,0.0004010982,0.01523666,0.0001494501,0.001149406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004723179,"threshold_uncertainty_score":0.007858098,"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."}}