International Journal of Computer Science and Business Informatics
As eXtensible Markup Language (XML) documents are now widely used in the Web world, improving the speed and accuracy of search engines based on these documents is important. Clustering is a way that can be effective in improving the speed of the search engine. Clustering of XML documents can be divided into pair wise and incremental algorithms. The main challenge in the class of incremental algorithms such as XCLS, XCLS+ and XCLS++ is that the order of input XML documents influences the clustering. In this paper, the sensitivity of incremental XML clustering algorithms is introduced by a representative algorithm i.e. XCLS+.