Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add support for dimentionality reduction of feature vectors. #64

Open
hamishmorgan opened this issue Mar 21, 2012 · 0 comments
Open

Add support for dimentionality reduction of feature vectors. #64

hamishmorgan opened this issue Mar 21, 2012 · 0 comments

Comments

@hamishmorgan
Copy link
Member

Almost definitely the only sensible what to achieve this is using random hashing. Other methods such as PCA require a magnitude of overhead similar the task being performed. E.g it will take as long to calculate the eigenvectors as it will to just run the software without PCA. Hense random hashing.

Still need to investigate the best technique.

This will have a dramatic effect of scalability, since the compute time would not be sensitive to number of features any more. Reducing the asymptotic run time of all-pair down to $O(N^2)$ from $O(N^2M)$

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant