{"id":"W2164832447","doi":"10.1109/tsmcb.2010.2048900","title":"A Bounded and Adaptive Memory-Based Approach to Mine Frequent Patterns From Very Large Databases","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Thrashing; Computer science; Demand paging; Physical address; Interleaved memory; Flat memory model; Virtual memory; Memory management; Memory map; Paging; Extended memory; Auxiliary memory; Block (permutation group theory); Page fault; Registered memory; Data structure; Shared memory; Parallel computing; Operating system; Overlay","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.0003148465,0.0004165786,0.0004165967,0.000200923,0.0003530161,0.0005388039,0.0006177637,0.0001471891,0.00002373301],"category_scores_gemma":[0.000007628844,0.0004081688,0.0000783429,0.0002639008,0.0001351073,0.0002294,0.00003204959,0.0004577293,0.00006617379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003674169,"about_ca_system_score_gemma":0.00007455381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002048946,"about_ca_topic_score_gemma":0.0009331381,"domain_scores_codex":[0.9973266,0.0001038704,0.0005006189,0.001085221,0.0004696945,0.0005139804],"domain_scores_gemma":[0.9977151,0.0002210816,0.0001468604,0.001304736,0.000113483,0.0004987663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007877651,0.0272544,0.004671494,0.001829722,0.003467022,0.0003835866,0.04074042,0.03289437,0.0337696,0.4029252,0.05241626,0.3988601],"study_design_scores_gemma":[0.004206236,0.0008484162,0.003912142,0.0005321833,0.0003468374,0.0001240069,0.001388843,0.8727629,0.01142266,0.0004807663,0.1016605,0.002314472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1522793,0.0001126289,0.8431423,0.0002496205,0.000839133,0.0006684166,0.001735855,0.0001646871,0.0008079943],"genre_scores_gemma":[0.9521373,0.00006128356,0.04587783,0.0004320596,0.0001821534,0.0003395609,0.0001014967,0.00004545569,0.0008228754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8398685,"threshold_uncertainty_score":0.999837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02807420880151816,"score_gpt":0.2443304961944392,"score_spread":0.2162562873929211,"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."}}