16,101 Hits in 1.7 sec

Orthogonal query recommendation

Hossein Vahabi, Margareta Ackerman, David Loker, Ricardo Baeza-Yates, Alejandro Lopez-Ortiz
2013 Proceedings of the 7th ACM conference on Recommender systems - RecSys '13  
We intentionally seek out orthogonal queries, which are related queries that have (almost) no common terms with the user's query.  ...  By using this technique to generate query recommendations, we outperform several known approaches, being the best for long tail queries.  ...  Orthogonal query recommendation is complementary to traditional query recommendation, each technique may succeed when the other fails.  ... 
doi:10.1145/2507157.2507159 dblp:conf/recsys/VahabiALBL13 fatcat:fidf4repwbauxnil4lyccp2com

SOLAR: Sparse Orthogonal Learned and Random Embeddings [article]

Tharun Medini, Beidi Chen, Anshumali Shrivastava
2020 arXiv   pre-print
The label vectors are random, sparse, and near-orthogonal by design, while the query vectors are learned and sparse.  ...  This is facilitated by our novel asymmetric mixture of Sparse, Orthogonal, Learned and Random (SOLAR) Embeddings.  ...  This dataset comprises of 1604777 training books whose titles serve as input queries. Each query book is mapped to a set of target books serving as labels (related products recommendation problem).  ... 
arXiv:2008.13225v1 fatcat:lv2kwqdimbgnpmfufqv4zy6tja

Orthogonal Query Expansion [article]

Margareta Ackerman, David Loker, Alejandro Lopez-Ortiz
2011 arXiv   pre-print
We intentionally seek out orthogonal queries, which are related queries that have low similarity to the user's query.  ...  The result sets of orthogonal queries intersect with the result set of the original query on a small number of pages.  ...  [3] propose a query recommendation method that is similar to our approach in that it utilizes a query log.  ... 
arXiv:1109.0530v1 fatcat:ov7g5wkoknfv7lrbtzcjessuwu

Provable Non-linear Inductive Matrix Completion

Kai Zhong, Zhao Song, Prateek Jain, Inderjit S. Dhillon
2019 Neural Information Processing Systems  
Consider a standard recommendation/retrieval problem where given a query, the goal is to retrieve the most relevant items.  ...  Non-linear IMC (NIMC) uses non-linear networks to embed the query as well as items, and is known to be highly effective for a variety of tasks, such as video recommendations for users, semantic web search  ...  Introduction Real-world recommendation systems and information retrieval systems aim to obtain the relevance between "queries" and "items", such as user-item ratings, query-web relevance, query-product  ... 
dblp:conf/nips/ZhongS0D19 fatcat:35yohmlxezgrji6m5fxilhfehu

OLOBO: A New Ontology for Linking and Integrating Open Biological and Biomedical Ontologies

Edison Ong, Yongqun He
2017 International Conference on Biomedical Ontology  
OLOBO was queried, analyzed, and applied to identify potential deprecated terms and discrepancy among different OBO library ontologies.  ...  Ontobee SPARQL queries was used to query OLOBO (Ong et al., 2017) .  ...  achieving orthogonality would be difficult.  ... 
dblp:conf/icbo/OngH17 fatcat:pdugq5hwxrfo3ne25b6jky7tue

A quantum-inspired classical algorithm for recommendation systems [article]

Ewin Tang
2019 arXiv   pre-print
Further, under strong input assumptions, the classical recommendation system resulting from our algorithm produces recommendations exponentially faster than previous classical systems, which run in time  ...  We give a classical analogue to Kerenidis and Prakash's quantum recommendation system, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning  ...  Π will always refer to an orthogonal projector.  ... 
arXiv:1807.04271v2 fatcat:qjxdqtl6dnhtvkbycjwlvfecoq

Context-aware citation recommendation

Qi He, Jian Pei, Daniel Kifer, Prasenjit Mitra, Lee Giles
2010 Proceedings of the 19th international conference on World wide web - WWW '10  
Do you wish to have a recommendation system which can recommend a small number of good candidates for every place that you want to make some citations?  ...  High quality citation recommendation is challenging: not only should the citations recommended be relevant to the paper under composition, but also should match the local contexts of the places citations  ...  Given query manuscript d1, we use Equation 1 to rank documents for global recommendation.  ... 
doi:10.1145/1772690.1772734 dblp:conf/www/HePKMG10 fatcat:si3tvuodjrgydnsz226nugqly4

Query-By-Multiple-Examples: Content-Based Search In Computer-Assisted Sound-Based Musical Composition

Tiago Fernandes Tavares, Jônatas Manzolli
2014 Proceedings of the SMC Conferences  
The NB approach assumes that dimensions spanned by features are orthogonal.  ...  Then, the system yields a recommendation, which can be used by the composer.  ... 
doi:10.5281/zenodo.850561 fatcat:us56gox2wranhevawfrkz764zy

Towards a task-based search and recommender systems

Gabriele Tolomei, Salvatore Orlando, Fabrizio Silvestri
2010 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)  
The second research challenge is to devise a novel recommender system that goes beyond the simple query suggestion of modern WSEs.  ...  (i.e., clusters of task-related queries) and taskflows.  ...  We claim that next Web recommender systems should deal with two orthogonal issues: (i) what items should be recommended and (ii) how recommendation should be performed.  ... 
doi:10.1109/icdew.2010.5452726 dblp:conf/icde/TolomeiOS10 fatcat:q7ogloyxdrh67fwqk765g5ryvq

A Reformulation Of The Quantum Query Model With A Linear Condition For Exact Algorithms

S. A. Grillo, F. L. Marquezino
2016 Zenodo  
We present a reformulation of the Quantum Query Model (QQM) without considering the measurement step.  ...  By using orthogonal Block Sets, we can obtain a quantum exact algorithm that distinguishes two sets X Y ⊂ {0 1} in queries. This is equivalent to the following problem.  ...  Conclusions Selected Papers and Recommended Reading Fig. 1 : 1 The relation between both models is not bijective.  ... 
doi:10.5281/zenodo.50143 fatcat:n2kfyyr6tjhjzmdjpvectzjf4e

Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations

Haim Kaplan, Jay Tenenbaum, Susanne Albers
2020 Scandinavian Workshop on Algorithm Theory  
Such a system embeds movies and users in the same feature space, and the task of recommending a movie for a group to watch together, translates to a set-query Q using an appropriate similarity.  ...  An important application that motivates our work is group recommendation systems.  ...  of the set-query. used for individual recommendations but do not naturally support group recommendations.  ... 
doi:10.4230/lipics.swat.2020.28 dblp:conf/swat/KaplanT20 fatcat:zzqggtwyzvdo5nymzmvzhabal4

SVD-CNN: A Convolutional Neural Network Model with Orthogonal Constraints Based on SVD for Context-Aware Citation Recommendation

Shaoyu Tao, Chaoyuan Shen, Li Zhu, Tao Dai, Giosuè Lo Bosco
2020 Computational Intelligence and Neuroscience  
In this paper, we propose a novel context-aware citation recommendation approach that can essentially improve the orthogonality of the weight matrix and explore more accurate citation patterns.  ...  Context-aware citation recommendation aims to automatically predict suitable citations for a given citation context, which is essentially helpful for researchers when writing scientific papers.  ...  For each query in the test set, we use the original set of references as the ground truth R g . Assume that the set of recommended citations is R r , and the correct recommendations are R g ∩ R r .  ... 
doi:10.1155/2020/5343214 pmid:33149736 pmcid:PMC7603561 fatcat:fzeq3cuiejbi7oyoqhd5hdaxx4

Generating Multidimensional Schemata from Relational Aggregation Queries [chapter]

Chaoyi Pang, Kerry Taylor, Xiuzhen Zhang, Mark Cameron
2004 Lecture Notes in Computer Science  
The schema produced with our approach has good properties such as non-redundant dimensional attributes and orthogonality among dimensions and can answer many more queries than just those it was generated  ...  Queries on operational databases can be viewed as a form of business rules on data warehouse schema design.  ...  orthogonality among dimensions.  ... 
doi:10.1007/978-3-540-30480-7_60 fatcat:gnexbuf5onhi7kdvhrrfqef6ua

Talking the talk vs. walking the walk

Mikhail Bilenko, Ryen W. White, Matthew Richardson, G. Craig Murray
2008 Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '08  
Traditional information retrieval models assume that users express their information needs via text queries (i.e., their "talk").  ...  ., users' "walk") as an alternative source of signal describing users' information needs, and compare it to the query-expressed information needs on a large dataset.  ...  This demonstrates that the information intents expressed through those different behaviors are primarily orthogonal.  ... 
doi:10.1145/1390334.1390461 dblp:conf/sigir/BilenkoWRM08 fatcat:xrupwc3ilvhk3frtoye55x43n4

Text Document Cluster Analysis Through Visualization of 3D Projections [chapter]

Masaki Aono, Mei Kobayashi
2014 Studies in Big Data  
More specifically, given a set of documents modeled as vectors in an orthogonal coordinate system and a query, our system finds three orthogonal coordinate axes that are most relevant to generate a display  ...  (or users may choose any three orthogonal axes).  ...  The query is converted to a vector, and the system computes three recommended axes for displaying results based on their proximity to the query vector using the cosine distance.  ... 
doi:10.1007/978-3-642-45252-9_15 fatcat:qqcre6popbaylffnklmjxxd7aa
« Previous Showing results 1 — 15 out of 16,101 results