{"id":"W1554401943","doi":"10.1007/978-3-642-01815-2_13","title":"Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Generality; Hasse diagram; Computation; Formal concept analysis; Scalability; Theoretical computer science; Lattice (music); Image stitching; Algorithm; Set (abstract data type); Data mining; Partially ordered set; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Database","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009531135,0.0004681061,0.0005860538,0.0003401916,0.0002788472,0.0004913865,0.004001678,0.0002673229,0.000005639056],"category_scores_gemma":[0.00008470943,0.0003144445,0.0002280919,0.0005104154,0.0007967728,0.0004080029,0.0008286277,0.0005552262,0.000004082037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001078639,"about_ca_system_score_gemma":0.0003124113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001651899,"about_ca_topic_score_gemma":0.00001347396,"domain_scores_codex":[0.9967753,0.00004044686,0.0005601043,0.001174714,0.0007834675,0.0006659168],"domain_scores_gemma":[0.9967197,0.001114507,0.0004019083,0.001368765,0.0002787392,0.0001163591],"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.000002219013,0.00002359502,0.000001888759,0.00001269393,0.000009844469,0.0000145477,0.0007335666,0.003687247,0.00001519621,0.01719399,0.00004673878,0.9782585],"study_design_scores_gemma":[0.0003045598,0.0003621108,0.000029703,0.000211015,0.00001411483,0.00004197237,2.999617e-7,0.801703,0.0005662319,0.1928793,0.00348125,0.0004063763],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001610086,0.0007404396,0.9945636,0.001351863,0.001278807,0.0007389692,0.00001700308,0.00007779161,0.001215368],"genre_scores_gemma":[0.01656524,0.00002475663,0.9800159,0.002756893,0.0004288044,0.00001745176,0.000003647008,0.00002340174,0.0001639084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9778521,"threshold_uncertainty_score":0.9999307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02308036911788027,"score_gpt":0.2622118186136647,"score_spread":0.2391314494957844,"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."}}