Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences - Special issu on PODS 2001
A sparse Johnson: Lindenstrauss transform
Proceedings of the forty-second ACM symposium on Theory of computing
Self-taught hashing for fast similarity search
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Estimating rates of rare events with multiple hierarchies through scalable log-linear models
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-task learning for boosting with application to web search ranking
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
The Journal of Machine Learning Research
N-best reranking by multitask learning
WMT '10 Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR
Uncertainty detection as approximate max-margin sequence labelling
CoNLL '10: Shared Task Proceedings of the Fourteenth Conference on Computational Natural Language Learning --- Shared Task
Enhanced email spam filtering through combining similarity graphs
Proceedings of the fourth ACM international conference on Web search and data mining
Like like alike: joint friendship and interest propagation in social networks
Proceedings of the 20th international conference on World wide web
K-means clustering with feature hashing
HLT-SS '11 Proceedings of the ACL 2011 Student Session
Collaborative competitive filtering: learning recommender using context of user choice
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Response prediction using collaborative filtering with hierarchies and side-information
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Online active inference and learning
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Detecting adversarial advertisements in the wild
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Temporal multi-hierarchy smoothing for estimating rates of rare events
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
BitShred: feature hashing malware for scalable triage and semantic analysis
Proceedings of the 18th ACM conference on Computer and communications security
Sparser Johnson-Lindenstrauss transforms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast top-k retrieval for model based recommendation
Proceedings of the fifth ACM international conference on Web search and data mining
Factorizing YAGO: scalable machine learning for linked data
Proceedings of the 21st international conference on World Wide Web
Linear support vector machines via dual cached loops
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Multimedia features for click prediction of new ads in display advertising
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Learning from evolving data streams: online triage of bug reports
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Fast large-scale approximate graph construction for NLP
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Black box features for the WMT 2012 quality estimation shared task
WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
If you are happy and you know it... tweet
Proceedings of the 21st ACM international conference on Information and knowledge management
From sBoW to dCoT marginalized encoders for text representation
Proceedings of the 21st ACM international conference on Information and knowledge management
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
Quality and efficiency for kernel density estimates in large data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Juxtapp: a scalable system for detecting code reuse among android applications
DIMVA'12 Proceedings of the 9th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment
Fast and scalable polynomial kernels via explicit feature maps
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Simple and deterministic matrix sketching
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
New features for query dependent sponsored search click prediction
Proceedings of the 22nd international conference on World Wide Web companion
A unified search federation system based on online user feedback
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Ad click prediction: a view from the trenches
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable supervised dimensionality reduction using clustering
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Scaling factorization machines to relational data
Proceedings of the VLDB Endowment
Sparsity lower bounds for dimensionality reducing maps
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Robust models of mouse movement on dynamic web search results pages
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
b-bit minwise hashing in practice
Proceedings of the 5th Asia-Pacific Symposium on Internetware
Towards automatic software lineage inference
SEC'13 Proceedings of the 22nd USENIX conference on Security
MutantX-S: scalable malware clustering based on static features
USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference
LASER: a scalable response prediction platform for online advertising
Proceedings of the 7th ACM international conference on Web search and data mining
Proceedings of the 7th ACM international conference on Web search and data mining
Sparser Johnson-Lindenstrauss Transforms
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bounds for feature hashing and show that the interaction between random subspaces is negligible with high probability. We demonstrate the feasibility of this approach with experimental results for a new use case --- multitask learning with hundreds of thousands of tasks.