Zuwa gabaJagora na gaba
Ƙimar Layi na Layi da Daskararrun Ƙimar Siffar
Na fasaha
Jagorar Fasaha
The Feature Hashing Trick
The feature hashing trick converts categorical or text features, potentially from a huge or unbounded vocabulary, into a fixed-size numeric vector by applying a hash function to each feature name and using the result as an index, instead of building and storing an explicit dictionary mapping every unique value to a column.
A wannan shafi4 min karatu
Dubawa
It matters because it lets models handle very large or streaming vocabularies, like every word or every user ID, with constant, predictable memory, at the cost of occasional hash collisions.
Zurfafa nutsewa
The feature hashing trick solves a practical problem with categorical and text features: their vocabulary can be enormous or open-ended, such as every possible word or every user ID, and building an explicit one-hot encoding requires a dictionary that maps each unique value to a fixed position, which grows without bound and must be updated whenever a new value appears. Feature hashing sidesteps this by applying a hash function, such as MurmurHash, directly to each feature's string representation and taking the result modulo a fixed number of buckets, say 2^18 or 2^20, to get its index in the feature vector. There is no dictionary to build, store, or synchronize between training and inference; the same hash function always maps the same input string to the same bucket. The unavoidable cost is hash collisions: two different feature values can hash to the same bucket, merging their signal so the model can no longer fully distinguish their individual contributions. In practice, this cost is usually modest when the number of buckets is large relative to the number of genuinely important distinct features, since collisions between two rare, unrelated features rarely hurt overall accuracy much, especially with high-dimensional linear models. A refinement, sometimes called the signed hashing trick, also hashes each feature to a random sign, +1 or -1, added along with the value, which makes collisions partially cancel out on average rather than always adding constructively, reducing bias in the resulting feature values. A common misconception is that feature hashing is a form of dimensionality reduction like PCA; it is not, since it doesn't try to preserve variance or structure, only to give a fixed-size representation of an unbounded feature space at the cost of some collision noise.
Dabarun Tasiri
Kudin da kasafin kuɗi
Hukunce-hukuncen gine-gine suna haifar da aiki da tsadar aiki na shekaru.
Shawarwari masu haske
Ilimin fasaha yana taimaka wa ƙungiyoyi su zaɓi tari mai kyau, ba kawai sabon abu ba.
Kula da inganci
Zaɓuɓɓukan injiniya mafi kyau suna rage abin dogaro a cikin samarwa.
The Future of The Feature Hashing Trick
Feature hashing remains a standard technique for large-scale linear models and gradient-boosted trees operating on high-cardinality categorical data, particularly in advertising, search, and recommendation systems where vocabularies are enormous and constantly changing. In deep learning, learned embedding tables have become a more common alternative for representing categorical features, though hashing is still used as a memory-bounded fallback or combined with embeddings to cap table size for extremely large vocabularies such as billions of user or item IDs. The core method itself is simple and mathematically settled, so future developments are more likely to focus on hybrid hashing-plus-embedding architectures than on changing the hashing mechanism.
Aiwatar da Gaskiyar Duniya
An email spam classifier hashes every word in a message into one of, say, 2^20 buckets, avoiding the need to maintain a dictionary of every word ever seen across a growing training set.
An online advertising system hashes user and ad identifiers, which number in the billions and grow constantly, into a fixed-size feature vector so the model's input dimension never has to change as new users and ads appear.
A recommendation system hashes product SKUs into a fixed number of buckets, allowing new inventory to be represented immediately without retraining a vocabulary-dependent encoder.
Two rare, unrelated words happen to hash into the same bucket in a text classifier, a collision, causing the model to slightly conflate their signal, a tradeoff accepted in exchange for constant memory use.
Hatsari & Tsare-tsare
Haɓaka ma'auni ɗaya na iya ɓoye manyan raunin tsarin.
Sau da yawa ana raina kayan more rayuwa da kuma kuɗin kulawa.
Tsaro da gibin lura na iya girma yayin da tsarin ke ƙara haɓaka.
Taswirar Hanya
Ƙayyade latency, inganci, da maƙasudin farashi kafin aiwatarwa.
Alamar ma'auni a ƙarƙashin ainihin kaya da yanayin bayanai.
Kula da kayan aiki don kurakurai, ɗigo, da tasirin mai amfani.
Shirya bijirowa da hanyoyin mayar da martani kafin sikeli.
Ci gaba da Bincike
Free newsletter
Get the daily AI briefing
Three verified AI stories every weekday morning, written in plain English. Free forever, no ads.
One email each weekday. Unsubscribe in one click. We never sell or share your address.
Test yourself
Take the The Feature Hashing Trick quiz
Instant feedback on every answer, and a shareable certificate with a verifiable ID once you pass a course.
Support free AI education. AI Understanding is a 501(c)(3) nonprofit — no ads, no paywall, ever. Make a donation
Tambayoyin da ake yawan yi
What is The Feature Hashing Trick?
The feature hashing trick converts categorical or text features, potentially from a huge or unbounded vocabulary, into a fixed-size numeric vector by applying a hash function to each feature name and using the result as an index, instead of building and storing an explicit dictionary mapping every unique value to a column. It matters because it lets models handle very large or streaming vocabularies, like every word or every user ID, with constant, predictable memory, at the cost of occasional hash collisions.
What core problem does the feature hashing trick solve for categorical or text features?
Feature hashing replaces an explicit, ever-growing dictionary of unique values with a direct hash-to-bucket mapping, so the feature space size stays fixed regardless of vocabulary growth.
In a fixed-size FeatureHasher, how does a feature name select its output coordinate?
The bucket index comes from hashing the feature name and taking the result modulo m, the chosen number of buckets, with no dictionary lookup required.
Two unrelated token strings land in the same output bucket. What hashing event has occurred?
A collision happens when two distinct feature values are hashed into the same bucket index, so the model can no longer fully separate their individual contributions.
In signed feature hashing, what determines whether a feature contribution is added or subtracted?
Signed hashing multiplies each feature's contribution by a randomly determined sign from a second hash function, which makes colliding contributions partially cancel rather than always add constructively.
Why is the signed hashing variant generally preferred over unsigned hashing?
Signed hashing can make collision contributions cancel in expectation, but collisions remain possible and hashed names are not recoverable from the vector alone.
Ci gaba da koyo
Jagora masu alaƙa
An zaɓi ƙarin jagora don wannan batu