Is there efficient way clustering text documents? I thought about K-Means but it seems to be too time consuming. Can somebody provide me with an efficient method?
            Asked
            
        
        
            Active
            
        
            Viewed 1,473 times
        
    2 Answers
1
            
            
        clustering algorithm depends on your dataset , do you want to write a algorithm in java to cluster your documents ? , you can use weka instead of reinvent the wheel and to try another clustering algorithm on your dataset .
 
    
    
        Radi
        
- 6,548
- 18
- 63
- 91
1
            If K-Means actually does the job, and simply seems to be slow, then why not try to make it faster? The method I use is random-pausing.
It's usually the case that there is lots of room for speedup, in code you wouldn't have thought to be a problem, without changing the basic algorithm. Here's an example.
 
    
    
        Community
        
- 1
- 1
 
    
    
        Mike Dunlavey
        
- 40,059
- 14
- 91
- 135
