TY - JFULL AU - Doru Anastasiu Popescu and Dan Rădulescu PY - 2016/7/ TI - Approximately Similarity Measurement of Web Sites Using Genetic Algorithms and Binary Trees T2 - International Journal of Computer and Information Engineering SP - 1139 EP - 1143 VL - 10 SN - 1307-6892 UR - https://publications.waset.org/pdf/10004699 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 114, 2016 N2 - In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language. ER -