188,708 Hits in 6.2 sec

Effective top-k computation in retrieving structured documents with term-proximity support

Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
2007 Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07  
This paper studies the performance of some existing top-k computation approaches using term-proximity-enabled ranking functions.  ...  Although many dynamic index pruning strategies have been proposed for efficient top-k computation, most of them are prone to ignore some especially important factors in ranking functions, e.g. term proximity  ...  Figure 4 . 4 Two index structures for efficient top-k computation with term proximity support Figure 5 . 5 Pruning strategy for the index structure of Figure 4 (a) .  ... 
doi:10.1145/1321440.1321547 dblp:conf/cikm/ZhuSLW07 fatcat:eg4w2cacz5chfadxbqngfkjkle

A Survey: Searching Techniques

Miss Mangala S. Teli, Asst. Prof. Priti S. Subramanium
2017 IOSR Journal of Computer Engineering  
As compared to a term-based top-k evaluation algorithm achieves an improvement of two orders of magnitude, with a improved result quality with static index pruning for the proximity lists, [3] A.  ...  The term proximity has been frequently used to enhance retrieval quality. According to proximity scoring top k results are calculated using algorithms [3] .  ... 
doi:10.9790/0661-1903064748 fatcat:dki5qs5n6fa4jee6edkgoivkvy

Efficient Dynamic Pruning with Proximity Support

Nicola Tonellotto, Craig Macdonald, Iadh Ounis
2010 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval  
terms in close proximity to each other in documents.  ...  The adoption of these proximity weighting models can cause a computational overhead when documents are scored, negatively impacting the efficiency of the retrieval process.  ...  These strategies are safe-up-to-rank-K [20] , meaning that the ranking of documents up to rank K will have full possible effectiveness, but with increased efficiency.  ... 
dblp:conf/sigir/TonellottoMO10 fatcat:a7ectv3ofnfuxdw7dd6vuisnty

Fast and exact top-k search for random walk with restart

Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuka, Masaru Kitsuregawa
2012 Proceedings of the VLDB Endowment  
Our solution, Kdash, is based on two ideas: (1) It computes the proximity of a selected node efficiently by sparse matrices, and (2) It skips unnecessary proximity computations when searching for the top-k  ...  The results show that K-dash can find top-k nodes significantly faster than the previous approaches while it guarantees exactness.  ...  Find: Top K nodes with the highest proximities with respect to node q exactly.  ... 
doi:10.14778/2140436.2140441 fatcat:folzpskzmjdq7mbroq2rwqh5ey

Location-Based Top-k Term Querying over Sliding Window [chapter]

Ying Xu, Lisi Chen, Bin Yao, Shuo Shang, Shunzhi Zhu, Kai Zheng, Fang Li
2017 Lecture Notes in Computer Science  
Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering both the term frequency and the proximities  ...  In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window.  ...  Based on the user requirements, we consider a new kind of top-k term query, Location-based Top-k Term Query (LkTQ), that returns top-k locally popular terms by taking into account both location proximity  ... 
doi:10.1007/978-3-319-68783-4_21 fatcat:yqjiux3uevclbex7wkpgebwg2m

Term Proximity Scoring for Keyword-Based Retrieval Systems [chapter]

Yves Rasolofo, Jacques Savoy
2003 Lecture Notes in Computer Science  
Second, by applying a term-proximity scoring heuristic to the top documents returned by a keyword-based system, our aim is to enhance retrieval performance.  ...  This paper suggests the use of proximity measurement in combination with the Okapi probabilistic model.  ...  Acknowledgement This research was supported by the SNSF (Swiss National Science Foundation) under grant 21-58'813.99.  ... 
doi:10.1007/3-540-36618-0_15 fatcat:hbhtdyoyrzamlljscmhv6lfwnm

FuzzyPR: An Effective Passage Retrieval System for QAS [chapter]

Hans Ulrich Christensen, Daniel Ortiz-Arroyo
2007 Lecture Notes in Computer Science  
Our experiments show that FuzzyPR achieves consistently better performance in terms of coverage than JIRS on the TREC corpora and slightly better on the CLEF corpora.  ...  [ 6 ] 6 described by s(p, q) = n max k − |x − i| k , 0 , where the parameter adjusting the support k = 70. The values of v 1 , v 2 , α f and k are determined experimentally.  ...  A last difference is that FuzzyPR computes the proximity of the question terms occurring in a passage rather than relying on n-gram or subsequence matching.  ... 
doi:10.1007/978-3-540-72530-5_23 fatcat:7qsgylhdf5hk7mlqifbvrb7pqq

Spatio-temporal top-k term search over sliding window

Lisi Chen, Shuo Shang, Bin Yao, Kai Zheng
2018 World wide web (Bussum)  
Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering term frequency, spatial proximity, and  ...  term freshness.  ...  Conclusions We propose a new approach for supporting querying the local top-k most frequent, popular, and trending terms in social stream data with a huge amount of geo-tagged tweets.  ... 
doi:10.1007/s11280-018-0606-x fatcat:bqthhmo3hfaf3onnfysko2e2ja

Efficient Processing of Top-k Spatial Keyword Queries [chapter]

João B. Rocha-Junior, Orestis Gkorgkas, Simon Jonassen, Kjetil Nørvåg
2011 Lecture Notes in Computer Science  
Given a spatial location and a set of keywords, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query  ...  Moreover, we present algorithms that exploit S2I to process top-k spatial keyword queries efficiently.  ...  Aggregating term-scores to compute the top-k spatio-textual objects is similar to aggregating ranked inputs to compute the top-k results [9, 15] .  ... 
doi:10.1007/978-3-642-22922-0_13 fatcat:c3tuy2dmabairdbxiymmqnaogu

Discovering human routines from cell phone data with topic models

Katayoun Farrahi, Daniel Gatica-Perez
2008 2008 12th IEEE International Symposium on Wearable Computers  
The framework is built from a probabilistic topic model learned on novel bag type representations of activity-related cues (location, proximity and their temporal variations over a day) of peoples' daily  ...  Using real-life data from the Reality Mining dataset, covering 68 000+ hours of human activities, we can successfully discover location-driven (from cell tower connections) and proximity-driven (from Bluetooth  ...  We thank Nathan Eagle (MIT) for sharing the data and helping with various aspects of the collection structure.  ... 
doi:10.1109/iswc.2008.4911580 dblp:conf/iswc/FarrahiG08 fatcat:2mgwnt4rfvds5p5dpfi743fm6u

A Network-Aware Approach for Searching As-You-Type in Social Media

Paul Lagrée, Bogdan Cautis, Hossein Vahabi
2015 Proceedings of the 24th ACM International on Conference on Information and Knowledge Management - CIKM '15  
We present in this paper a novel approach for as-you-type top-k keyword search over social media.  ...  They show that our solution is effective in answering realtime as-you-type searches over social media.  ...  Acknowledgements This work was partially supported by the French research project ALICIA (ANR-13-CORD-0020) and by the EU research project LEADS (ICT-318809).  ... 
doi:10.1145/2806416.2806435 dblp:conf/cikm/LagreeCV15 fatcat:t46h5zrwsrgytovy3ygomosfd4

A Network-Aware Approach for Searching As-You-Type in Social Media (Extended Version) [article]

Paul Lagrée and Bogdan Cautis and Hossein Vahabi
2015 arXiv   pre-print
We present in this paper a novel approach for as-you-type top-k keyword search over social media.  ...  They show that our solution is effective in answering real-time as-you-type searches over social media.  ...  Acknowledgement This work was partially supported by the French research project ALICIA (ANR-13-CORD-0020) and by the EU research project LEADS (ICT-318809).  ... 
arXiv:1507.08107v1 fatcat:s5dpugn47jenloxkb7o5dyuzwu

Theoretical study of large proximity-induceds-wave-like pairing from ad-wave superconductor

Wan-Ju Li, Sung-Po Chao, Ting-Kuo Lee
2016 Physical review B  
Proximity effect is used to generate effective topological superconductor by placing strong spin orbit interacting metals with superconducting materials, aiming to produce Majorana zero modes useful for  ...  topologically protected quantum computations.  ...  PROXIMITY EFFECT: BSCCO AND Bi2Se3 Here we start with the model Hamiltonian describing the Bi 2 Se 3 , a type of three dimensional topological insulator(TI), grown on top of the BSCCO.  ... 
doi:10.1103/physrevb.93.035140 fatcat:bpi2ks7zv5bi5b74vypsplgfgq

Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures

Nima Asadi, Jimmy Lin
2013 Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13  
Postings intersection with SvS, while fast, yields substantially lower end-to-end effectiveness, suggesting that document and term frequencies remain important in the initial ranking stage.  ...  Given a fixed set of features and a learning-to-rank model, we explore effectiveness/efficiency tradeoffs with three candidate generation approaches: postings intersection with SvS, conjunctive query evaluation  ...  to generate candidates quickly and only compute "expensive" term proximity features when necessary-thus decreasing overall query evaluation latency.  ... 
doi:10.1145/2484028.2484132 dblp:conf/sigir/AsadiL13 fatcat:cfqhzl5odrgf7fkpjnxbdvrqwa

Efficient Top-K Retrieval in Online Social Tagging Networks [article]

Silviu Maniu, Bogdan Cautis
2012 arXiv   pre-print
We describe how this can be done on the fly (without any pre-computations) for several possible choices - arguably the most natural ones - of proximity computation in a user network.  ...  Based on this, our top-k algorithm is sound and complete, while addressing the scalability issues of the existing ones.  ...  Computing σ + We describe in this section a key aspect of our algorithm for top-k search, namely onthe-fly computation of proximity values with respect to a seeker s.  ... 
arXiv:1104.1605v6 fatcat:kfyei4u22vek7ea7lfffrt3rgi
« Previous Showing results 1 — 15 out of 188,708 results