Filters








64 Hits in 4.7 sec

The nearest neighbour problem in information retrieval

A. F. Smeaton, C. J. van Rijsbergen
1981 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval theoretical issues in information retrieval - SIGIR '81  
ACKNOWLEDGEMENT We wish to thank Dr Porter and Dr Harper for their help in formulating some of the ideas in this paper  ...  In this algorithm, the user specifies a limit to the error tolerance, but in many applications of the nearest neighbour problem in I.R.  ...  Bentley and Friedman <I> gave an algorithm of order log(N) but this was unusable in the information retrieval case because it has a multiplicative constant of 1.6 n where n is the dimension of Permission  ... 
doi:10.1145/511754.511767 dblp:conf/sigir/SmeatonR81 fatcat:27ycuewypja5znbtaqnbmhtgnm

A network organization used for document retrieval

W. B. Croft, R. Wolf, R. Thompson
1983 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '83  
This organization has significant advantages in terms of the range of searches that can be used when compared to either inverted or clustered file organizations.  ...  A network organization for implementing a document retrieval system is proposed.  ...  Murtagh used an upperbound (U2) which would be calculated for eac~ candidate document on the inverted lists in order 5o determine whettler the here is a comblnation of these two approaches wlLh  ... 
doi:10.1145/511793.511820 dblp:conf/sigir/CroftWT83 fatcat:7po7kchcczhahmbddtk2jkncoq

A network organization used for document retrieval

W. B. Croft, R. Wolf, R. Thompson
1983 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '83  
This organization has significant advantages in terms of the range of searches that can be used when compared to either inverted or clustered file organizations.  ...  A network organization for implementing a document retrieval system is proposed.  ...  Murtagh used an upperbound (U2) which would be calculated for eac~ candidate document on the inverted lists in order 5o determine whettler the here is a comblnation of these two approaches wlLh  ... 
doi:10.1145/511819.511820 fatcat:rvsocfrka5gqrfqqscbu4sjine

Parallel computing in information retrieval – an updated review

A. Macfarlane, S.E. Robertson, J.A. Mccann
1997 Journal of Documentation  
We give a description of the retrieval models used in parallel Information Processing.. We describe areas of research which we believe are needed.  ...  In particular we stress the importance of the motivation in using parallel computing for Text Retrieval.  ...  We are grateful to Ephraim Vishniac and Dennis Parkinson for information on various aspects of the CM-2 and DAP systems described in this paper.  ... 
doi:10.1108/eum0000000007201 fatcat:2zuwtehixbd6xk33hwb3j43nse

Parallel text searching in serial files using a processor farm

J. K. Cringean, R. England, G. A. Manson, P. Willett
1990 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '90  
This paper discusses the implementation of a parallel text retrieval system using a microprocessor network.  ...  One point that should be made about these results is that they have been obtained in nearest neighbour searches where the natural language queries have been converted to a set of right-hand truncated  ...  The speed-up for P processors, Sp, is defined as Tl Sp = - TP' where Tl *and Tp are the times to carry out an algorithm on one and P processors respectively.  ... 
doi:10.1145/96749.98249 dblp:conf/sigir/CringeanEMW90 fatcat:mwhfu7auvfhqxn6hcn7jeq4nhy

Approximate algorithms for static and continuous range queries in mobile navigation

Haidar AL-Khalidi, David Taniar, Maytham Safar
2012 Computing  
This type of query is used in Geographical Information Systems (GIS), such as Google Maps, Whereis Maps, Bing Maps and mobile navigation [6] , and in other areas such as wireless sensor network, vehicular  ...  One of the most frequently used queries in such applications is range search query (RSQ) [1].  ...  The source of our implementations can be downloaded from the following URL: http://users.monash.edu/~dtaniar/Approx-Range-Computing-Journal.  ... 
doi:10.1007/s00607-012-0219-7 fatcat:kwqc3wdghretjfaysjv2a3emfm

Improved Similarity Search for Large Data in Machine Learning and Robotics

Josiah Walker
2019 Figshare  
A simplified boosting algorithm is given which improves performance overa state-of-the-art method while also being more efficient.  ...  While traditionally database and data analysis oriented applications of similarity search have been search throughput oriented, in the areas of online classification and robotic control it is also important  ...  Frequently, more points than just the single nearest neighbour are used in analysis algorithms.  ... 
doi:10.6084/m9.figshare.9942509 fatcat:ajvkwfnmyff6hjw7kh2njeuosm

Nearest Neighbours Search Using the PM-Tree [chapter]

Tomáš Skopal, Jaroslav Pokorný, Václav Snášel
2005 Lecture Notes in Computer Science  
We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases.  ...  Besides the description of PM-tree, we propose an optimal k-NN search algorithm. Finally, the efficiency of k-NN search is experimentally evaluated on large synthetic as well as real-world datasets.  ...  This research has been partially supported by grant 201/ 05/P036 of the Czech Science Foundation (GAČR) and the National programme of research (Information society project 1ET100300419).  ... 
doi:10.1007/11408079_73 fatcat:zmj3zplqwnfbzpvlppypvyce7e

Fast Scalable k-NN Computation for Very Large Point Clouds [article]

Sandro Spina, Kurt Debattista, Keith Bugeja, Alan Chalmers
2012 Computer Graphics and Visual Computing  
A common factor in these algorithms is the recurring need for the computation of point neighborhoods, usually by applying algorithms to compute the k-nearest neighbours of each point.  ...  The process of reconstructing virtual representations of large real-world sites is traditionally carried out through the use of laser scanning technology.  ...  Acknowledgements The point clouds used in this publication originate from a number of sources.  ... 
doi:10.2312/localchapterevents/tpcg/tpcg12/085-092 dblp:conf/tpcg/SpinaDBC12 fatcat:s6w4b7dgurcz7olth63qacferi

Selectively diversifying web search results

Rodrygo L.T. Santos, Craig Macdonald, Iadh Ounis
2010 Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM '10  
In particular, we examine how the need for diversification can be learnt for each query-given a diversification approach and an unseen query, we predict an effective tradeoff between relevance and diversity  ...  Thorough experiments using the TREC ClueWeb09 collection show that our selective approach can significantly outperform a uniform diversification for both classical and state-of-the-art diversification  ...  In this work, we employ a k-nearest neighbour (k-NN) [2] algorithm. As an instance-based learning approach, k-NN does not have an explicit training phase.  ... 
doi:10.1145/1871437.1871586 dblp:conf/cikm/SantosMO10 fatcat:7wnlagil5jf2jmwvc7d5gcpqoi

Segment-Level Sequence Modeling using Gated Recursive Semi-Markov Conditional Random Fields

Jingwei Zhuo, Yong Cao, Jun Zhu, Bo Zhang, Zaiqing Nie
2016 Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)  
Most of the sequence tagging tasks in natural language processing require to recognize segments with certain syntactic role or semantic meaning in a sentence.  ...  They are usually tackled with Conditional Random Fields (CRFs), which do indirect word-level modeling over word-level features and thus cannot make full use of segment-level information.  ...  We train the model on the CONLL 2003 training set and find nearest neighbours in the CONLL 2003 test set.  ... 
doi:10.18653/v1/p16-1134 dblp:conf/acl/ZhuoCZZN16 fatcat:mhzmy24zuzbzbkh2efew6xoy4a

Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis

Neal Bishop, Valerie J. Gillet, John D. Holliday, Peter Willett
2003 Journal of information science  
This paper reviews the work of the Chemoinformatics Research Group in the Department of Information Studies at the University of Sheffield, focussing particularly on the work carried out in the period  ...  An analysis of citations to 321 publications from the Group shows that it attracted a total of 3725 residual citations during the period 1980-2002.  ...  who acted as the PhD supervisor for three of us (VJG, JDH and PW).  ... 
doi:10.1177/01655515030294003 fatcat:w552bado5nb5jiz3qxnqdooiwa

Index ordering by query-independent measures

Paul Ferguson, Alan F. Smeaton
2012 Information Processing & Management  
Conventional approaches to information retrieval search through all applicable entries in an inverted file for a particular collection in order to find those documents with the highest scores.  ...  A solution to this problem is to only search a limited amount of the collection at query-time, in order to speed up the retrieval process.  ...  Acknowledgments This work was funded by Science Foundation Ireland as part of the CLARITY CSET, under grant numbers 03/IN.3/I361 and 07/CE/I1147.  ... 
doi:10.1016/j.ipm.2011.10.003 fatcat:t35xsxhvejecpfvelqxpmm37fa

Searching for pharmacophoric patterns in databases of three-dimensional chemical structures

Peter Willett
1995 Journal of Molecular Recognition  
The target structure and the five nearest neighbours for a 3D similarity searching using atom mapping. 300 P.  ...  An implementation of these ideas is now used for 3D similarity searching in the Zeneca Agrochemicals corporate database. The upperbound ° 6) / Figure 6.  ... 
doi:10.1002/jmr.300080503 pmid:8619950 fatcat:zrw25m53obdyjp5posqipup26a

Curse of Dimensionality in the Application of Pivot-based Indexes to the Similarity Search Problem [article]

Ilya Volnyansky
2009 arXiv   pre-print
That is for large enough d the difference between using such an index and performing a search without an index at all is negligeable. Thus we confirm the curse of dimensionality in this setting.  ...  We demonstrate that if the spaces Ω_d exhibit the (fairly common) concentration of measure phenomenon the performance of similarity search using such indexes is asymptotically linear in n.  ...  d allowing exact nearest neighbour search in time polynomial in d must use n ω(1) space.  ... 
arXiv:0905.2141v1 fatcat:uu62ihtpkrbpdgzp4z4o5jmy7m
« Previous Showing results 1 — 15 out of 64 results