[jira] [Commented] (MATH-1171) clustering implementations have unnecessary overhead

["Thomas Neidhart (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/MATH-1171?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14605247#comment-14605247 ] 

Thomas Neidhart commented on MATH-1171:
---------------------------------------

Supporting this would require a complete re-design of the clustering interface.
I am wondering if it is worth doing the effort, as the clustering support in commons-math is not really sophisticated (its only useful for small and simple problems and intended to get quick results) and for more complex use-cases other libraries might be a better choice.

> clustering implementations have unnecessary overhead
> ----------------------------------------------------
>
>                 Key: MATH-1171
>                 URL: https://issues.apache.org/jira/browse/MATH-1171
>             Project: Commons Math
>          Issue Type: Bug
>            Reporter: Mark
>
> I want to apply clustering algorithms like KMeansPlusPlusClusterer to pictures. And creating a point instance for each pixel is not a good idea.
> Therefore the interface should not be based on Collections, but on some interface that provides sort of "get(index)" accessors to data that is potentially stored in a pixel array etc.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)