The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2005  
         
  Article:   UNSUPERVISED SINGLE-LINK HIERARCHICAL CLUSTERING.

Authors:  DANA AVRAM LUPŞA.
 
       
         
  Abstract:  There are many clustering techniques presented in the litera- ture. The particularity of single-link clustering is that it rather discovers the clusters as chains. We aim to identify a method to apply the single link clustering technique so that: it discovers the first level clusters and the user doesn''t have to provide any sort of a parameter. We focuses on clusters that are well separated, and so, which have to maximize the intra-cluster similar- ity and minimize the inter-cluster similarity. We evaluate the method on a two dimensional space, that is planar points  
         
     
         
         
      Back to previous page