[
https://issues.apache.org/jira/browse/MAHOUT-66?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12611769#action_12611769
]
Karl Wettin commented on MAHOUT-66:
-----------------------------------
bq. It does work in that the correct result is returned. But the distance
computation does not exploit the sparseness of the SparseVector.
Aha! Proceed with your business :)
I saw a bunch of instanceof-clauses in the patch. I suspect that there will be
more Vector implementations in the future. How about gathering the per class
strategies in a VectorVisitor instead. It could, if nothing else, save a few
CPU cycles. Perhaps it's all overkill.
> EuclideanDistanceMeasure and ManhattanDistanceMeasure classes does not
> compute distance for Sparse Vectors
> ----------------------------------------------------------------------------------------------------------
>
> Key: MAHOUT-66
> URL: https://issues.apache.org/jira/browse/MAHOUT-66
> Project: Mahout
> Issue Type: Bug
> Components: Clustering
> Reporter: Pallavi Palleti
> Priority: Minor
> Attachments: MAHOUT-66.patch, MAHOUT-66.patch
>
>
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
