Abstract
With the increase of XML data over the Internet, managing and analyzing huge amount of XML documents has played an important role for information management. This paper addresses the problem of clustering XML documents. Borrowing the idea of semi-clustering, it proposes a robust clustering method through a combination of single partitional and hierarchical clustering algorithms, which can eliminate the defects of single clustering algorithms. Experiments on real XML documents collection show that our method can group large collection of XML documents into appropriate clusters efficiently without fixed number of clusters. Moreover, our method is less sensitive to noises than single clustering algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
