{"id":"W2123728119","doi":"10.1109/ipdps.2009.5161150","title":"An Aggregated Ant Colony Optimization approach for pricing options","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Profit (economics); Ant colony optimization algorithms; Mathematical optimization; Traverse; Node (physics); Shortest path problem; Optimization problem; Operations research; Microeconomics; Economics; Artificial intelligence; Mathematics; Engineering; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004657748,0.0005448099,0.0008393475,0.0006539156,0.0004101606,0.0009376075,0.001155911,0.001025432,0.001999601],"category_scores_gemma":[0.001474298,0.0003006292,0.0006305379,0.0008454625,0.0004448934,0.0007776783,0.0006167294,0.0007764387,0.0002635924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005549931,"about_ca_system_score_gemma":0.0006785852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004047228,"about_ca_topic_score_gemma":0.004287583,"domain_scores_codex":[0.9996265,0.0001131829,0.00001641588,0.00005356894,0.0001599499,0.00003037799],"domain_scores_gemma":[0.9995126,0.000231065,0.00005582453,0.00003569044,0.0001263349,0.00003849665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001593683,0.0000225541,0.0001957201,0.00002284056,0.0000279092,0.00005673562,0.00002409184,0.9693229,0.0008289404,0.00639098,0.0004449539,0.02264661],"study_design_scores_gemma":[0.000002555867,0.00000612181,0.00002168328,0.000001052939,0.000002593864,0.000008047766,0.000002251401,0.9978983,0.00007331283,0.001680373,0.0003020118,0.000001579685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01867808,0.0002955596,0.9739387,0.0002227962,0.00007868412,0.00005781218,0.00003376444,0.0001947306,0.006499869],"genre_scores_gemma":[0.6070846,0.0003524363,0.3852534,0.0001425261,0.00008273823,0.000184392,0.00007775466,0.0000825464,0.006739581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004047228,"threshold_uncertainty_score":0.008047342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03032860513241782,"score_gpt":0.3141963081946118,"score_spread":0.283867703062194,"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."}}