- 1、本文档共29页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chromatic Nearest Neighbor Searching A Query Sensitive Approach
Chromatic Nearest Neighbor Searching:
A Query Sensitive Approach?
David M. Mount? Nathan S. Netanyahu? Ruth Silverman§
Angela Y. Wu?
Last modified: October 21, 1996.
(Minor updates made: August 24, 2000.)
Final version for CGTA.
Abstract
The nearest neighbor problem is that of preprocessing a set P of n data
points in Rd so that, given any query point q, the closest point in P to q can be
determined efficiently. In the chromatic nearest neighbor problem, each point
of P is assigned a color, and the problem is to determine the color of the near-
est point to the query point. More generally, given k ≥ 1, the problem is to
determine the color occurring most frequently among the k nearest neighbors.
The chromatic version of the nearest neighbor problem is used in many appli-
cations in pattern recognition and learning. In this paper we present a simple
algorithm for solving the chromatic k nearest neighbor problem. We provide
a query sensitive analysis, which shows that if the color classes form spatially
well separated clusters (as often happens in practice), then queries can be an-
swered quite efficiently. We also allow the user to specify an error bound ≥ 0,
?A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference
on Computational Geometry, 1995, 261–266.
?Department of Computer Science and Institute for Advanced Computer Studies, University of
Maryland, College Park, MD 20742. Email: mount@cs.umd.edu. The support of the National
Science Foundation under grant CCR–9310705 is gratefully acknowledged.
?Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan 52900,
Israel, and Center for Automation Research, University of Maryland, College Park, Maryland 20742.
This research was carried out while the author was also affiliated with the Center of Excellence in
Space Data and Information Sciences at NASA Goddard Space Flight Center, Greenbelt, MD 20771.
Email: nathan@macs.biu.ac.il.
§Center for Automation Re
您可能关注的文档
- characteristics of stemflow for tall stewartia growing on a hillslope.pdf
- Characteristics and sources of chromophoric dissolved organic matter in lakes of the Yungui Plateau.pdf
- Characterization of Electrochemically Grown Crystalline CuInSe2 Thin Films.pdf
- Characterization of PM2.5 in the ambientair of Shanghaicity by analyzingindividualparticles.pdf
- Characterizations of essential ideals as operator modules over C-algebras.pdf
- Characterizing packet audio streams from internet multimedia applications.pdf
- Charge amplification concepts for direction-sensitive dark matter detectors.pdf
- Charge carriers of different origin in cuprates as revealed by experiment.pdf
- Charge collective modes in an incommensurately modulated cuprate.pdf
- Charge exchange for medium energy He and Ne ions in a large-angle collision at solid surfaces.pdf
文档评论(0)