17,168 Hits in 4.1 sec

Branch-and-bound algorithm for reverse top-k queries

Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
Top-k queries return to the user only the k best objects based on the individual user preferences and comprise an essential tool for rank-aware query processing.  ...  To address these limitations, in this paper, we identify useful properties for processing reverse top-k queries without accessing each user's individual preferences nor executing the topk query.  ...  Reverse Top-k Queries Given a query object q, the reverse top-k query identifies all weighting vectors for which q belongs to the top-k result set.  ... 
doi:10.1145/2463676.2465278 dblp:conf/sigmod/VlachouDNK13 fatcat:56mcl6wcy5bo7luwbdqlduotzm

Efficient Methods for Aggregate Reverse Rank Queries

Yuyang DONG, Hanxiong CHEN, Kazutaka FURUSE, Hiroyuki KITAGAWA
2018 IEICE transactions on information and systems  
Given two data sets of user preferences and product attributes in addition to a set of query products, the aggregate reverse rank (ARR) query returns top-k users who regard the given query products as  ...  the highest aggregate rank than other users.  ...  The most relevant research related to this work is the aggregate reverse rank query [2] . Dong et al.  ... 
doi:10.1587/transinf.2017dap0007 fatcat:iq6z2b52e5gihejeoqz4elb2xq

Monochromatic and Bichromatic Reverse Top-k Queries

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Norvag
2011 IEEE Transactions on Knowledge and Data Engineering  
We formally define reverse top-k queries and introduce two versions of the query, monochromatic and bichromatic.  ...  Nowadays, most applications return to the user a limited set of ranked results based on the individual user's preferences, which are commonly expressed through top-k queries.  ...  Example of Reverse Top-k Query Given a database of products, a reverse top-k query returns those users (represented by weighting vectors) that rank a potential product highly.  ... 
doi:10.1109/tkde.2011.50 fatcat:uqnxxsr3hfdqljo5xv6cesjkve

Where to Start Browsing the Web? [chapter]

Dániel Fogaras
2003 Lecture Notes in Computer Science  
Somewhat surprisingly, the Page Rank scores computed on the reversed Web graph turn out to be a special case of our class of rank functions.  ...  Besides query based examples, we propose graph based techniques to evaluate the performance of the introduced ranking algorithms.  ...  Mixed and aggregate ranks We investigate the alternatives to combine Reverse Page Rank (RPR) with other ranking strategies to obtain refined quality measures on Web Pages.  ... 
doi:10.1007/978-3-540-39884-4_6 fatcat:g7qx3wulvzb7zftp6deiyukgvi

Query Aggregation in Session Search

Dongyi Guan, Hui Yang
2014 Proceedings of the 3rd Workshop on Data-Driven User Behavioral Modeling and Mining from Social Media - DUBMOD '14  
Evaluation conducted over TREC 2011 and 2012 shows that the proposed scheme works the best and outperforms the TREC best system as well as learned weights by learning to rank.  ...  Moreover, we compare various query aggregation schemes and investigate the best scheme for aggregating queries in session search.  ...  LEARNING THE QUERY WEIGHTS Besides query aggregation schemes derived based on the hypotheses, we investigate the optimal query weights by a supervised learning to rank method.  ... 
doi:10.1145/2665994.2666001 dblp:conf/cikm/GuanY14 fatcat:svgq4e5kgff4xolkyez6zqs5s4

Incremental Quality Based Reverse Ranking for Spatial Data

A. Sasi Kumar, G. Suseendran
2016 Indian Journal of Science and Technology  
Methods: Improves the query processing in spatial database by using the existing R Tree, IR Tree and Reverse Ranking.  ...  Applications: A spatial preference query ranks objects (e.g.  ...  Reverse Ranking Query Given a query object q and an object set O, an RR query RRQ(q,O,t) retrieve t objects from O with the smallest expected reverse ranks; formally, RRQ(q,O,t)={r|r ∈ R ∧∀o∈(O-R)Rr <Ro  ... 
doi:10.17485/ijst/2016/v9i1/80395 fatcat:f2gjllgjsrbuthu4dtytrby644

Aggregate Nearest Neighbor Queries [chapter]

2017 Encyclopedia of GIS  
Given a query point and a time interval, it returns the top-k locations that have the smallest weighted sums of (i) the spatial distance to the query point and (ii) a temporal aggregate on a certain attribute  ...  We study a new type of queries called the k-nearest neighbor temporal aggregate (kNNTA) query.  ...  The ranking score of an entry e is the weighted sum of the spatial distance from the query point to the MBR of e and the aggregate computed by the TIA of e.  ... 
doi:10.1007/978-3-319-17885-1_100047 fatcat:6w6wxdkj2be5dbsn3m57m7lpae

A New Case of Rank Reversal in Analytic Hierarchy Process due to Aggregation of Cost and Benefit Criteria

Abhijit Majumdar, Manoj Kumar Tiwari, Aastha Agarwal, Kanika Prajapat
2021 Operations Research Perspectives  
However, rank reversal due to the aggregation of benefit and cost criteria has not been addressed with requisite rigour.  ...  The results also counter the notion that multiplicative AHP is immune to rank reversal between ratio and difference methods of aggregation.  ...  In AHP and RAHP, rank reversal takes place in difference method of aggregation when the criteria weights are normalised based on sum 1 or sum 2 approaches.  ... 
doi:10.1016/j.orp.2021.100185 fatcat:tondkj4kdvdy5imtr4bv3v467u

Answering why-not questions on reverse top-kqueries

Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
2015 Proceedings of the VLDB Endowment  
Given an initial reverse top-k query and a missing/why-not weighting vector set W m that is absent from the query result, why-not questions on reverse top-k queries explain why W m does not appear in the  ...  reverse top-k queries.  ...  Why-not questions on Select-Project-Join-Aggregation (SPJA) queries [30] , top-k queries [14] , reverse skyline queries [21] , and image search [4] all belong to this category.  ... 
doi:10.14778/2752939.2752943 fatcat:4lf532s3rjdxpevy33i27bfhtu

Reverse top-k queries

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Norvag
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences.  ...  We first provide a geometric interpretation of the monochromatic reverse top-k query in the solution space that helps to understand the reverse top-k query conceptually.  ...  Data points that are dominated 2 by q are always ranked after q for any weighting vector w, while points that dominate q are ranked before q for any weighting vector w.  ... 
doi:10.1109/icde.2010.5447890 dblp:conf/icde/VlachouDKN10 fatcat:6fk6wpcdkzbkzcarpnujey6ehu

Learning Rank Functionals: An Empirical Study [article]

Truyen Tran, Dinh Phung, Svetha Venkatesh
2015 arXiv   pre-print
In practical settings, the task often reduces to estimating a rank functional of an object with respect to a query.  ...  For the loss function, we study three techniques: approximating the rank metric by a smooth function, decomposition of the loss into a weighted sum of element-wise losses and into a weighted sum of pairwise  ...  Figure 1 : 1 Graphical illustration of query models. (a) Plackett-Luce, (b) Reverse Plackett-Luce, (c) Markov random field and (d) Group-level Plackett-Luce. Rank func.  ... 
arXiv:1407.6089v2 fatcat:fpk5ppzzbrca3ngnjuepxawuwe

Answering why-not and why questions on reverse top-k queries

Qing Liu, Yunjun Gao, Gang Chen, Baihua Zheng, Linlin Zhou
2016 The VLDB journal  
why-not questions on reverse top-k queries.  ...  We first formalize why-not questions on reverse top-k queries, which try to include the missing objects in the reverse top-k query results, and then, we propose a unified framework called WQRTQ to answer  ...  The top-k query ranks the points based on the user specified scoring function f that aggregates the individual score of a point into an overall scoring value.  ... 
doi:10.1007/s00778-016-0443-4 fatcat:pkhl6ao2j5c6thbt4jx2xedb2m

CRF framework for supervised preference aggregation

Maksims N. Volkovs, Richard S. Zemel
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
Experiments on benchmark tasks demonstrate significant performance gains over existing rank aggregation methods.  ...  We develop a flexible Conditional Random Field framework for supervised preference aggregation, which combines preferences from multiple experts over items to form a distribution over rankings.  ...  For instance, in meta-search an issued query is sent to several search engines and the (often partial) rankings returned by them are aggregated to generate more comprehensive ranking results.  ... 
doi:10.1145/2505515.2505713 dblp:conf/cikm/VolkovsZ13 fatcat:gojj4loxxratrakpyvzlcdoxfm

Accurate Image Search Using the Contextual Dissimilarity Measure

H. Jegou, C. Schmid, H. Harzallah, J. Verbeek
2010 IEEE Transactions on Pattern Analysis and Machine Intelligence  
We have also evaluated two novel variants, multiple assignment and rank aggregation. They are shown to further improve accuracy, at the cost of higher memory usage and lower efficiency.  ...  Rank aggregation The results show that rank aggregation improves accuracy. The scores are consistently improved for all sets of parameters.  ...  To be more precise, if an image i is well-ranked for a query j, then j is not necessarily well-ranked for query i.  ... 
doi:10.1109/tpami.2008.285 pmid:19926895 fatcat:rhpvp6h7dzbebgkicisgnkm6p4

Top-$k$ Preferences in High Dimensions

Albert Yu, Pankaj K. Agarwal, Jun Yang
2016 IEEE Transactions on Knowledge and Data Engineering  
Original space Check if a subspace is relevant to query object Query object query Reverse top−k Reverse top−k query Reverse top−k query Aggregate top objects Compute best combination  ...  Weight of a subspace. The weight of a subspace, w(H), depends on the importance of H and the cost of supporting preference and reverse top-k queries in H.  ... 
doi:10.1109/tkde.2015.2451630 fatcat:lazczohbynhl3l4pn7efrh5eey
« Previous Showing results 1 — 15 out of 17,168 results