NNH Improving Performance of NearestNeighbor Searches usingNNH提高性能最近邻搜索使用.pptVIP

下载本文档

2
0
约7.95千字
约 47页
2017-03-08 发布于上海
举报
版权申诉

NNH Improving Performance of NearestNeighbor Searches usingNNH提高性能最近邻搜索使用.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

NNH Improving Performance of NearestNeighbor Searches usingNNH提高性能最近邻搜索使用

NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms Liang Jin (UC Irvine) Nick Koudas (ATT) Chen Li (UC Irvine) Outline Motivation: NN search NNH: Proposed histogram structure Main idea Utilizing NNH in a search (KNN, join) Constructing NNH Incremental maintenance Experiments NN (nearest-neighbor) search KNN: find the k nearest neighbors of an object. Example: image search Other Applications Websearch “Find 100 most similar pages for a given page” Page represented as word-frequency vector Similarity: vector distance GIS: “find 5 closest cities of Irvine” CAD, information retrieval, molecular biology, data cleansing, … Challenges: Efficiency, Scalability NN Algorithms Distance measurement: For objects are points, distance well defined Usually Euclidean Other distances possible For arbitrary-shaped objects, assume we have a distance function between them Most algorithms assume a high-dimensional tree structure exists for the datasets. Example: R-Trees Minimal Bounding Rectangle MBR is an n-dimensional rectangle that bounds its corresponding objects. MBR face property: Every face of any MBR contains at least one point of some object Search process (1-NN for example) Most algorithms traverse the structure (e.g., R-tree) top down, and follow a branch-and-bound approach Keep a priority queue of nodes (mbr’s) to be visited Sorted based on the “minimum distance” between q and each node Improvement: Use MINDIST and MINMAXDIST Reduce the queue size Avoid unnecessary disk IO’s to access MBR’s MINDIST MINMAXDIST Pruning in NN search 3. Discard mbr1 if MINDIST(q,mbr1) disk(q,o) Problem Queue size may be large: Example: 60,000, 32d (image) vectors, 50 NNs Max queue size: 15K entries Avg queue size: half (7.5K entries) If queue can’t fit in memory, more disk IOs! Problem worse for k-NN joins E.g., 1500 x 1500 join: Max queue size: 1.7M entries: = 1GB memory! 750 seconds to run Couldn’t scale up to 2000 objects! Disk thrashing Our Solution: Nearest-Ne