This algorithm constructs first the entire set of formal concepts which are then organised wrt the relation. Lattice Conceptual Clustering System and Its Application to Browsing Retrieval . Each concept visited was presented in a window listing its intent, and the user moved to subsequent elements nodes via selection of additional terms. 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 .