Clustering Homogeneous XML Documents Using Weighted Similarities on XML Attributes

3/22/2012 Abin George 110913025 J Sarath Chandra Bhargav 110913026 MTECH CSE.

Abstract In our project we addressed the problem of clustering homogeneous collection XML documents. Clustering is a process of creating groups of similar objects. We want to implement a weighted similarity measurement approach for detecting similarities between homogeneous XML documents using open source technology Java. Given a collection XML documents, distance between documents is calculated and stored in Java Collections, and then these distances are used to cluster XML documents.

Defnition 2: Let T1 and T2 be rooted ordered labeled trees. Assuming a cost model to assign costs for every tree edit operation, the tree edit distance between T1 and T2 is the minimum cost between the costs of all possible tree edit sequences that transform T1 to T2.

II. RELATED WORK The various papers we have seen including their brief Description

I. INTRODUCTION

He eXtensible Markup Language (XML) [1] is becoming the standard data exchange format among Web applications, providing interoperability and enabling automatic processing of Web resources. An XML document is a hierarchically structured and self-describing piece of information, and consists of atomic elements or complex elements (elements with nested sub elements). An XML document incorporates structure and data in one entity. To this extend, XML data is semi structured data. There are two types of XML documents Homogeneous and Heterogeneous. If all the xml documents are created based one common DTD (Document Type Definition) then they are said to be as homogeneous XML documents otherwise they are heterogeneous XML documents. An XML document consists of number of attributes like document data, structure and style sheet etc. Clustering is method of creating groups of similar objects. A weighted similarity measurement approach for detecting the similarity between the homogeneous xml documents is suggested. Using this similarity measurement a new clustering technique is also proposed. The method of calculating similarity of document's structure and styling is given by number of researchers, mostly which are based on tree edit distances. And for calculating the distance between document's contents there are number of text and other similarity techniques like cosine, jaccord, tf-idf etc. Both of the similarity techniques are combined to propose a new distance measurement technique for calculating the distance between a pair of homogeneous XML documents Tree Edit Distances: A rooted ordered labeled tree T[1] is a set of (k + 1) nodes fr; nig with i = 1 : : : k. The children of each node are ordered. A label is associated with every node. The root of T is r and the remaining nodes n 1, nk are partitioned into m sets T1..Tm, each of which is a tree. The tree edit sequence and the tree edit distance between two rooted ordered labelled trees that represent two XML documents are defned as follows: Defnition 1: Let T1 and T2 be rooted ordered labeled trees. A tree edit sequence is a sequence of tree edit operations that transforms T1 to T2.

1. Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, Timos Sellis [2] have proposed a Framework for clustering XML documents by structure. They suggested the usage of structural summaries for trees to improve the performance of the distance calculation. 2. Xiaoling Xia, Yongming Guo, Jiajin Le[3] have proposed a paper for Measuring Similarities between XML Documents based on Content and Structure. This paper develops a novel similarity measure model which is based on Extended Vector Space Model. This model can effectively measure similarities between XML documents by combining content, structure and links. In order to evaluate this similarity measure model, k-means algorithm is used to cluster XML documents. 3. Jin-sha Yuan, Xin-ye Li1, Li-na Ma [4]specified the following method in their paper An Improved XML Document Clustering Using Path Feature. They extract all paths of length less than or equal to L from all XML documents, where L is a user-specified parameter value. 4. Chong Zhou, Yansheng Lu in their paper Clustering XML Documents based on Data Type [5] addressed the problem in semantic XML documents clustering algorithm which uses Synonymous word library to calculate similarities between XML documents. when people create their own XML documents, they name the element randomly and often use lots of abbreviations. Many tags are not real words at all. The XML documents created by different people may appear very different from each other even if they describe the same object. The traditional methods do not work well in such case. To address the problem, we proposed a novel similarity measure standard based on data-type tree, a model integrating data types and tags of XML documents. A clustering algorithm DT2Kmeans is also proposed to cluster XML documents. 5. Andrea Tagarelli, Sergio Greco [6] have proposed a technique based on lexical ontology for semantic XML clustering [7]. They proposed a framework for clustering semantically cohesive XML structures based on a transactional representation model. Patrick Lay, Stefan Luttringhaus- Kappel have suggested a technique for Transforming XML Schemas into Java Swing GUIs. They

presented a method for generating the GUIs automatically from the XML Schema instances. Panagiotis Antonellis Christos Makris Nikos Tsirakis have suggested a technique called XEdge for Clustering Homogeneous and Heterogeneous XML Documents Using Edge Summaries. They Proposed a unified clustering algorithm for both homogeneous and heterogeneous XML documents. They suggested a dymanic distance metric based on the structural characteristics of homogeneous and heterogeneous XML documents for clustering.

III. DURATION OF THE PROJECT The proposed project can be done as follows. 1. The XML documents from the repositories are retreived.
Week Step 1,2,3 Date 29/3/12 TABLE I
PROJECT COMPLETION PLAN

2. Parsing of the retrieved documents is done in second step. 3. After parsing all the required information are kept in the java collections API (Application Programming Interface). 4. similarity algorithms are applied over the java collection to measure the structure and style-sheet similarity. 5. For content similarity the text and other similarity algorithms are applied 6. The weights are assigned for calculated similarity values for different similarities. And 7. finally the overall similarity is calculated, which depict the similarity between a pair of XML documents.
Week 5 7 26/4/12 Week 1

Week 2

5/3/12

Week 3

12/4/12

Week 4

19/4/12

REFERENCES
[1]
[2]

W3C: http://www.w3c.org.

Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, Timos Sellis, A Methodology for Clustering XML Documents by
Structure . Xiaoling Xia, Yongming Guo, Jiajin Le, Measuring Similarities between XML Documents based on Content and Structure 2009 IEEE AsiaPacific Conference on Information Processing Jin-sha Yuan, Xin-ye Li1, Li-na Ma, An Improved XML Document Clustering Using Path Feature 2008 IEEE Fifth International Conference on Fuzzy Systems and Knowledge Discovery. Chong Zhou, Yansheng , Clustering XML Documents based on Data Type, IEEE 2008 International Conference on Computational Intelligence and Security
Andrea Tagarelli, Sergio Greco, "Toward Semantic XML Clustering", Proceedings of the 2006 Conference on Data Mining, 2006. Patrick Lay, Stefan Luttringhaus-Kappel, "Transforming xml Schemas into Java Swing GUIs", Pages: 271-276, Informatik 2004, Tbilisi International Centre of Mathematics and Informatics (TICMI). Volume-50. September Ludovic Denoyer, Patrick Gallinari , "The Wikipedia XML Corpus",

[3]

[4]

[5]

[6]

[7]
[8]

http://www-connex.lip6.fr/~denoyer/wikipediaXML/