mahout-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF GitHub Bot (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (MAHOUT-1991) Implement naive DBSCAN Algorithm - O(n^2) complexity
Date Wed, 30 Aug 2017 16:58:00 GMT

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

ASF GitHub Bot commented on MAHOUT-1991:
----------------------------------------

Github user rawkintrevo commented on the issue:

    https://github.com/apache/mahout/pull/334
  
    @AdityaAS @andrewpalumbo @dlyubimov 
    
    Afaik, the R-Tree/Rect portion of this is solid- I could really use those for something
else I'm working on- (ML/AI on Flink for upcoming talks).  
    
    As RTrees area  core component for many hierarchical clustering algorithms, does anyone
have any opinions to refactoring this JIRA into multiple- the first of which being "Add R-Tree
implementation" (and then additional for DBSCAN/ etc.) 
    
    Still proposing feature branch for most of this- just splitting the R-Trees which are
done off into their own JIRA ticket/PR and merging. 
    
    Thoughts?
    



> Implement naive DBSCAN Algorithm - O(n^2) complexity
> ----------------------------------------------------
>
>                 Key: MAHOUT-1991
>                 URL: https://issues.apache.org/jira/browse/MAHOUT-1991
>             Project: Mahout
>          Issue Type: New Feature
>          Components: Algorithms
>            Reporter: Aditya AS
>            Assignee: Aditya AS
>
> Implement the naive DBSCAN algorithm in Mahout Samsara, as part of the Algorithms Framework.



--
This message was sent by Atlassian JIRA
(v6.4.14#64029)

Mime
View raw message