Sebastian N. Bruch
Sebastian N. Bruch
Verified email at nih.gov
Title
Cited by
Cited by
Year
Mr. LDA: A flexible large scale topic modeling package using variational inference in mapreduce
K Zhai, J Boyd-Graber, N Asadi, ML Alkhouja
Proceedings of the 21st international conference on World Wide Web, 879-888, 2012
1852012
Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures
N Asadi, J Lin
Proceedings of the 36th international ACM SIGIR conference on Research and …, 2013
672013
Runtime optimizations for tree-based machine learning models
N Asadi, J Lin, AP De Vries
IEEE transactions on Knowledge and Data Engineering 26 (9), 2281-2292, 2013
57*2013
TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank
RK Pasumarthi, S Bruch, X Wang, C Li, M Bendersky, M Najork, J Pfeifer, ...
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019
56*2019
Pseudo test collections for learning web search ranking functions
N Asadi, D Metzler, T Elsayed, J Lin
Proceedings of the 34th international ACM SIGIR conference on Research and …, 2011
342011
Document vector representations for feature extraction in multi-stage document ranking
N Asadi, J Lin
Information retrieval 16 (6), 747-768, 2013
332013
Fast candidate generation for real-time tweet search with bloom filter chains
N Asadi, J Lin
ACM Transactions on Information Systems (TOIS) 31 (3), 1-36, 2013
322013
Training efficient tree-based models for document ranking
N Asadi, J Lin
European Conference on Information Retrieval, 146-157, 2013
312013
Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks
Q Ai, X Wang, S Bruch, N Golbandi, M Bendersky, M Najork
252019
Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks
S Bruch, M Zoghi, M Bendersky, M Najork
Proceedings of the 42nd International ACM SIGIR Conference on Research and …, 2019
232019
Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters
N Asadi, J Lin
Proceedings of the 21st ACM international conference on Information and …, 2012
172012
A Stochastic Treatment of Learning to Rank Scoring Functions
S Bruch, S Han, M Bendersky, M Najork
Proceedings of the 13th ACM International Conference on Web Search and Data …, 2020
132020
An Analysis of the Softmax Cross Entropy Loss for Learning-to-Rank with Binary Relevance
S Bruch, X Wang, M Bendersky, M Najork
Proceedings of the 2019 ACM SIGIR International Conference on Theory of …, 2019
132019
Dynamic memory allocation policies for postings in real-time twitter search
N Asadi, J Lin, M Busch
Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013
132013
UMD and USC/ISI: TREC 2010 Web Track Experiments with Ivory.
T Elsayed, N Asadi, L Wang, JJ Lin, D Metzler
TREC, 2010
102010
Fast, incremental inverted indexing in main memory for web-scale collections
N Asadi, J Lin
arXiv preprint arXiv:1305.0699, 2013
52013
Learning to Rank in Theory and Practice: From Gradient Boosting to Neural Networks and Unbiased Learning
C Lucchese, FM Nardini, RK Pasumarthi, S Bruch, M Bendersky, X Wang, ...
Proceedings of the 42nd International ACM SIGIR Conference on Research and …, 2019
42019
Multi-stage search architectures for streaming documents
N Asadi
42013
An Alternative Cross Entropy Loss for Learning-to-Rank
S Bruch
arXiv preprint arXiv:1911.09798, 2019
32019
An exploration of postings list contiguity in main-memory incremental indexing
N Asadi, J Lin
WSDM Workshop on Large-Scale and Distributed Systems for Information Retrieval, 2014
32014
The system can't perform the operation now. Try again later.
Articles 1–20