C. Carpineto and G. Romano. A lattice conceptual clustering system and its application to browsing retrieval . Cluster analysis is a very important and useful technique. As a consequence, hundreds of clustering algorithms have been proposed in the literature and new clustering algorithms continue to appear. As a consequence, hundreds of clustering algorithms have been proposed in the literature and new clustering algorithms continue to appear.
Results indicate that lattice complexity can be polynomial according to the number of objects.
C. Carpineto and G. Romano. A Lattice Conceptual Clustering System and its Application to Browsing Retrieval . When constructing the lattice L, Bordat proceeds by a top down specialization, beginning with the most general node. For each node, the algorithm computes all its sub nodes. C. Carpineto and G. Romano.