class_docstr: The Group Average Agglomerative starts with each of the N vectors as singleton
  clusters. It then iteratively merges pairs of clusters which have the
  closest centroids.  This continues until there is only one cluster. The
  order of merges gives rise to a dendrogram: a tree with the earlier merges
  lower than later merges. The membership of a given number of clusters c, 1
  <= c <= N, can be found by cutting the dendrogram at depth c.
  
  This clusterer uses the cosine similarity metric only, which allows for
  efficient speed-up in the clustering process.
class_docstr_tok: ["The","Group","Average","Agglomerative","starts","with","each","of","the","N","vectors","as","singleton","clusters",".","It","then","iteratively","merges","pairs","of","clusters","which","have","the","closest","centroids",".","This","continues","until","there","is","only","one","cluster",".","The","order","of","merges","gives","rise","to","a","dendrogram",":","a","tree","with","the","earlier","merges","lower","than","later","merges",".","The","membership","of","a","given","number","of","clusters","c",",","1","<","=","c","<","=","N",",","can","be","found","by","cutting","the","dendrogram","at","depth","c.","This","clusterer","uses","the","cosine","similarity","metric","only",",","which","allows","for","efficient","speed-up","in","the","clustering","process","."]
docstr: :return: The dendrogram representing the current clustering
  :rtype:  Dendrogram
docstr_tok: [":","return",":","The","dendrogram","representing","the","current","clustering",":","rtype",":","Dendrogram"]
code: def dendrogram(self):
      """
      :return: The dendrogram representing the current clustering
      :rtype:  Dendrogram
      """
      return self._dendrogram
  
file_path: nltk/nltk/cluster/gaac.py
imports: from nltk.cluster.util import Dendrogram, VectorSpaceClusterer, cosine_distance
label_desc: Use image node_id 7 for calling the GAAClusterer obj's underlying member method code with example usage: obj.dendrogram() and returns: self