- 1、本文档共16页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Similarity Searching in High Dimensions viaHashing
Similarity Searching in High Dimensions viaHashing Paper by: Aristides Gionis, Poitr Indyk, Rajeev Motwani The approach of using the similarity searching is to be used only in high dimensions. The reason, or the idea behind the approach is that since the selection of features and the choice of distance is rather heuristic, determining an appropriate nearest neighbor should suffice for most practical purposes. The basic idea is to hash the points from the database so as to ascertain that the probability of collision is much higher for objects that are close to each other than for those that are far apart. The necessity arose from the so called ‘curse of dimensionality’ fact for the large databases. In this case all the searching techniques reduce to linear search, if are being searched for the appropriate answer. The similarity search problem involves the nearest ( most similar ) object in a given collection of objects to a given query. Typically the objects of interest are represented as points in ?d and a distance metric is used to measure the similarity of the objects. The basic problem is to perform indexing or similarity searching for query objects. The problem arises due to the fact that the present methods are not entirely satisfactory, for large d. And is based on the idea that for most applications it is not necessary for the exact answer. It also provides the user with a time-quality trade-off. The above statements are based on the assumption that the searching for approximate answers is faster than for finding the exact answers. The technique is to use locality-sensitive hashing instead of space sensitive hashing. The idea is to hash points points using several hash functions so as to ensure that, for each function the probability of collision is much higher for objects that are close to each other. Then, one can determine near neighbors by hashing the query point and retrieving elements stored in buckets containing that point. The LSH ( locality sensiti
您可能关注的文档
- PQRASME要求填写的焊接工艺评定报告.doc
- Practical Automatic Determination of Causal Relationships in Software Execution Traces.pdf
- Prediction of Physical, Color, and Sensory Characteristics of Broiler Breasts by VisibleNea.pdf
- Precision Spectroscopy of Pionic Atoms From Pion Mass Evaluation to Tests of Chiral Perturb.pdf
- Predictive Evaluation of Econometric Forecasting Models in Commodity Futures Markets.pdf
- Predicting the Performance of Randomized Parallel Search An Application to Robot Motion Pla.pdf
- PRELIMINARY VERSION A Design Diversity Metric and Analysis of Redundant Systems.pdf
- Present and NearFuture Reflected Light Searches for CloseIn Planets.pdf
- prepared for a special issue of abour Economics,.pdf
- Present and Future Electroweak Precision Measurements and the Indirect Determination of the.pdf
最近下载
- AutoCAD2022基础教程PPT完整全套教学课件.pptx
- 【沪科】八年级物理(全一册)知识点总结.docx VIP
- 【沪科物理八年级】3.2 声音的特性 同步练习.docx VIP
- 导轨单杆切割磁感线+电容(解析版)--2024高考物理疑难题.pdf
- 新能源汽车技术专业职业生涯规划书发展报告大一全国大学生职业规划大赛模板范文1500字.pdf VIP
- 中班语言《耳朵上的绿星星》课件.pptx
- 水力学典型复习题及答案详解.docx
- TBT454.1-2021 铁路通信信号词汇 第1部分:铁路信号词汇.pdf
- Dirty Rotten Scoundrels《骗徒臭事多(1988)》完整中英文对照剧本.docx VIP
- 舒平木门加工中心培训.docx
文档评论(0)