{"id":"https://openalex.org/W2155010204","doi":"https://doi.org/10.1109/isit.2006.261842","title":"A Nearest-Neighbor Approach to Estimating Divergence between Continuous Random Vectors","display_name":"A Nearest-Neighbor Approach to Estimating Divergence between Continuous Random Vectors","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2155010204","doi":"https://doi.org/10.1109/isit.2006.261842","mag":"2155010204"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2006.261842","doi":"https://doi.org/10.1109/isit.2006.261842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261842","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5103567145","display_name":"Qing Wang","orcid":"https://orcid.org/0009-0004-8834-957X","observed_orcids":["https://orcid.org/0009-0004-8834-957X"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qing Wang","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053530986","display_name":"Sanjeev R. Kulkarni","orcid":"https://orcid.org/0000-0002-5308-5250","observed_orcids":["https://orcid.org/0000-0002-5308-5250"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Kulkarni","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103184697","display_name":"Sergio Verd\u00fa","orcid":"https://orcid.org/0000-0003-1254-9116","observed_orcids":["https://orcid.org/0000-0003-1254-9116"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sergio Verdu","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":6.1556,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.96919431,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"242","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13141","display_name":"Statistical Methods and Applications","score":0.1941000074148178,"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/T13141","display_name":"Statistical Methods and Applications","score":0.1941000074148178,"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/T12261","display_name":"Statistical Mechanics and Entropy","score":0.08760000020265579,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13500","display_name":"Probability and Statistical Research","score":0.07840000092983246,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divergence-estimation","display_name":"divergence estimation","score":0.9810000061988831},{"id":"https://openalex.org/keywords/nearest-neighbor-distance","display_name":"nearest neighbor distance","score":0.5950000286102295},{"id":"https://openalex.org/keywords/multivariate-distributions","display_name":"multivariate distributions","score":0.8360000252723694},{"id":"https://openalex.org/keywords/high-dimensional-data","display_name":"high-dimensional data","score":0.8399999737739563},{"id":"https://openalex.org/keywords/i-i-d-samples","display_name":"i.i.d. samples","score":0.7570000290870667},{"id":"https://openalex.org/keywords/bias-and-variance","display_name":"bias and variance","score":0.6769999861717224},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.5630000233650208}],"concepts":[{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.8108128309249878},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7904505729675293},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.697813868522644},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6204628348350525},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6167647838592529},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.5850546360015869},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5835167169570923},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5694722533226013},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.5044823884963989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46552321314811707},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.4412236511707306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41836827993392944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40971314907073975},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2610716223716736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22831138968467712},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"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":3,"locations":[{"id":"doi:10.1109/isit.2006.261842","doi":"https://doi.org/10.1109/isit.2006.261842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261842","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.7372","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.7372","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.princeton.edu/~verdu/nearest.neigh.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.739.7675","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.739.7675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.princeton.edu/%7Everdu/reprints/A%20Nearest-Neighbor%20Approach%20to%20Estimating.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W3487859","https://openalex.org/W1546862366","https://openalex.org/W1564947197","https://openalex.org/W1595303882","https://openalex.org/W1965555277","https://openalex.org/W1967320885","https://openalex.org/W1978807281","https://openalex.org/W2050913223","https://openalex.org/W2088171019","https://openalex.org/W2092260586","https://openalex.org/W2092939357","https://openalex.org/W2099111195","https://openalex.org/W2103174987","https://openalex.org/W2114758632","https://openalex.org/W2119868454","https://openalex.org/W2121445748","https://openalex.org/W2122111042","https://openalex.org/W2138570191","https://openalex.org/W2147684887","https://openalex.org/W2149268774","https://openalex.org/W2163634074","https://openalex.org/W2165558283","https://openalex.org/W2751862591","https://openalex.org/W2790825170","https://openalex.org/W3014432339","https://openalex.org/W3148595793","https://openalex.org/W4205885661","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2150879893","https://openalex.org/W7096813612","https://openalex.org/W3080661392","https://openalex.org/W2001150023","https://openalex.org/W2092813355","https://openalex.org/W2157510479","https://openalex.org/W7095912490","https://openalex.org/W102481553","https://openalex.org/W121168560","https://openalex.org/W2149268774"],"abstract_inverted_index":{"A":[0],"method":[1],"for":[2],"divergence":[3],"estimation":[4],"between":[5],"multidimensional":[6],"distributions":[7],"based":[8,54],"on":[9,39,55],"nearest":[10,43],"neighbor":[11,44],"distances":[12],"is":[13],"proposed.":[14],"Given":[15],"i.i.d.":[16],"samples,":[17],"both":[18],"the":[19,22,42],"bias":[20],"and":[21],"variance":[23],"of":[24],"this":[25],"estimator":[26],"are":[27],"proven":[28],"to":[29,35,51],"vanish":[30],"as":[31],"sample":[32],"sizes":[33],"go":[34],"infinity.":[36],"In":[37],"experiments":[38],"high-dimensional":[40],"data,":[41],"approach":[45],"generally":[46],"exhibits":[47],"faster":[48],"convergence":[49],"compared":[50],"previous":[52],"algorithms":[53],"partitioning":[56]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}