{"id":"https://openalex.org/W253332932","doi":"https://doi.org/10.21437/eurospeech.1995-209","title":"Fast likelihood computation for continuous-mixture densities using a tree-based nearest neighbor search","display_name":"Fast likelihood computation for continuous-mixture densities using a tree-based nearest neighbor search","publication_year":1995,"publication_date":"1995-09-18","ids":{"openalex":"https://openalex.org/W253332932","doi":"https://doi.org/10.21437/eurospeech.1995-209","mag":"253332932"},"language":"en","primary_location":{"id":"doi:10.21437/eurospeech.1995-209","is_oa":false,"landing_page_url":"https://doi.org/10.21437/eurospeech.1995-209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4th European Conference on Speech Communication and Technology (Eurospeech 1995)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5072932051","display_name":"Frank Seide","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Frank Seide","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5072932051"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7544,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.64774251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1079","last_page":"1083"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.996399998664856,"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"}},"topics":[{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.996399998664856,"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/T11667","display_name":"Advanced Chemical Sensor Technologies","score":0.9621999859809875,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6959038376808167},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6750687956809998},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6399237513542175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6289519667625427},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.516697883605957},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48967745900154114},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4511035978794098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3709619641304016},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.350286602973938},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30584532022476196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24532470107078552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09395638108253479},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.08084619045257568}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6959038376808167},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6750687956809998},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6399237513542175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6289519667625427},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.516697883605957},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48967745900154114},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4511035978794098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3709619641304016},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.350286602973938},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30584532022476196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24532470107078552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09395638108253479},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08084619045257568},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21437/eurospeech.1995-209","is_oa":false,"landing_page_url":"https://doi.org/10.21437/eurospeech.1995-209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4th European Conference on Speech Communication and Technology (Eurospeech 1995)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W3096071782","https://openalex.org/W2375128115","https://openalex.org/W325985789","https://openalex.org/W2119808169"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}