{"id":"https://openalex.org/W2295220129","doi":null,"title":"Scalable Inference on Kingman's Coalescent using Pair Similarity","display_name":"Scalable Inference on Kingman's Coalescent using Pair Similarity","publication_year":2012,"publication_date":"2012-03-21","ids":{"openalex":"https://openalex.org/W2295220129","mag":"2295220129"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5984","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/%7Ewelling/publications/papers/fastCoalescentAISTATS_2012.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081258844","display_name":"Dilan G\u00f6r\u00fcr","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dilan G\u00f6r\u00fcr","raw_affiliation_strings":["University College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, London, United Kingdom","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014330481","display_name":"Levi Boyles","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Levi Boyles","raw_affiliation_strings":["University of California, Irvine, Irvine, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, United States","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087368991","display_name":"Max Welling","orcid":"https://orcid.org/0000-0003-1484-2121","observed_orcids":["https://orcid.org/0000-0003-1484-2121"]},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Max Welling","raw_affiliation_strings":["University of California, Irvine, Irvine, United States"],"raw_orcid":"https://orcid.org/0000-0003-1484-2121","affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, United States","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9182,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79042186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequential-monte-carlo","display_name":"sequential Monte Carlo","score":0.9430000185966492},{"id":"https://openalex.org/keywords/nearest-neighbor-algorithm","display_name":"nearest neighbor algorithm","score":0.878000020980835},{"id":"https://openalex.org/keywords/scalable-inference","display_name":"scalable inference","score":0.875},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.6039999723434448},{"id":"https://openalex.org/keywords/particle-methods","display_name":"particle methods","score":0.43700000643730164},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.7480000257492065},{"id":"https://openalex.org/keywords/bird-images","display_name":"bird imagery","score":0.5989999771118164}],"concepts":[{"id":"https://openalex.org/C2554327","wikidata":"https://www.wikidata.org/wiki/Q2698599","display_name":"Coalescent theory","level":4,"score":0.6764762997627258},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6517199277877808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6191852688789368},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5954541563987732},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5633409023284912},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5557999610900879},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5549415946006775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5088422894477844},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4919411838054657},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4369087219238281},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.396931916475296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28151804208755493},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5984","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/%7Ewelling/publications/papers/fastCoalescentAISTATS_2012.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.417.3750","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.3750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/proceedings/papers/v22/gorur12/gorur12.pdf","raw_type":"text"},{"id":"mag:2295220129","doi":null,"is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v22/gorur12/gorur12.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419146","display_name":"International Conference on Artificial Intelligence and Statistics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Artificial Intelligence and Statistics","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W14333344","https://openalex.org/W1980674207","https://openalex.org/W2040640649","https://openalex.org/W2086300240","https://openalex.org/W2103490241","https://openalex.org/W2117287544","https://openalex.org/W2133296809","https://openalex.org/W2146638375","https://openalex.org/W2149313766","https://openalex.org/W2165558283","https://openalex.org/W2168853692","https://openalex.org/W2319462502","https://openalex.org/W2962839807","https://openalex.org/W3120740533"],"related_works":["https://openalex.org/W2117287544","https://openalex.org/W7099798495","https://openalex.org/W1584160924","https://openalex.org/W3039857044","https://openalex.org/W7099943478","https://openalex.org/W7221332343","https://openalex.org/W7095887004","https://openalex.org/W4400024099","https://openalex.org/W3024404698","https://openalex.org/W2903055217"],"abstract_inverted_index":{"We":[0,18,51,87],"present":[1],"a":[2,30,37,57,100],"scalable":[3],"sequential":[4],"Monte":[5],"Carlo":[6],"algorithm":[7,44,90],"and":[8],"its":[9],"greedy":[10],"counterpart":[11],"for":[12,69,91,103],"models":[13],"based":[14],"on":[15,97],"Kingman\u2019s":[16],"coalescent.":[17],"utilize":[19],"fast":[20],"nearest":[21],"neighbor":[22],"algorithms":[23,106],"to":[24,28,108],"limit":[25],"expensive":[26],"computations":[27],"only":[29],"subset":[31],"of":[32,40,73,84,95],"data":[33],"point":[34],"pairs.":[35],"For":[36],"dataset":[38,101],"size":[39,102],"n,":[41],"the":[42,63,71],"resulting":[43],"has":[45],"O(n":[46],"log":[47],"n)":[48],"computational":[49],"complexity.":[50],"empirically":[52],"verify":[53],"that":[54],"we":[55,75],"achieve":[56],"large":[58],"speedup":[59],"in":[60,65],"computation.":[61],"When":[62],"gain":[64],"speed":[66],"is":[67],"used":[68],"increasing":[70],"number":[72],"particles,":[74],"can":[76],"often":[77],"obtain":[78],"significantly":[79],"better":[80],"samples":[81],"than":[82],"those":[83],"previous":[85,105],"algorithms.":[86],"apply":[88],"our":[89],"learning":[92],"visual":[93],"taxonomies":[94],"birds":[96],"6033":[98],"examples,":[99],"which":[104],"fail":[107],"be":[109],"feasible.":[110],"1":[111]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}