Github user mengxr commented on the pull request:
https://github.com/apache/spark/pull/1671#issuecomment-51375372
Thanks for explaining different approaches. What should be the best for
`HashingTF`? Adding the counts or with random signs and bounded by 0? I know
with random signs, we can preserve the structure. But I'm not sure whether this
is a standard practice for NLP.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
