TREE DATASET EXTRACTION USING HAC BASED ALGORITHM

The main objective of this project is to formulate a trouble - free ways of fetching data using TREE SET data structures and finding appropriate values and here we are using unproblematic apparent concepts of data mining which is an analytical process designed to explore enormous amounts of data typically business or market related. The project concludes by compar ing the proposed quantifiers to a more traditional approach minimum spanning tree which is proficient to find the nodes within the best case. So there will be no need of long traverse and also Hierarchical Archimedean Copulas (HAC) helps to cluster and emb ed the nodes in different categories