XML Document Clustering Technique by K-means algorithm through PCA


The KIPS Transactions:PartD, Vol. 18, No. 5, pp. 339-342, Oct. 2011
10.3745/KIPSTD.2011.18.5.339,   PDF Download:

Abstract

Recently, researches are studied in developing efficient techniques for accessing, querying, and storing XML documents which are frequently used in the Internet. In this paper, we propose a new method to cluster XML documents efficiently. We use a K-means algorithm with a Principal Component Analysis(PCA) to cluster XML documents after they are represented by vectors in the feature vector space by transferring them as names and levels of the elements of the corresponding trees. The experiment shows that our proposed method has a good result.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
W. S. Kim, "XML Document Clustering Technique by K-means algorithm through PCA," The KIPS Transactions:PartD, vol. 18, no. 5, pp. 339-342, 2011. DOI: 10.3745/KIPSTD.2011.18.5.339.

[ACM Style]
Woo Saeng Kim. 2011. XML Document Clustering Technique by K-means algorithm through PCA. The KIPS Transactions:PartD, 18, 5, (2011), 339-342. DOI: 10.3745/KIPSTD.2011.18.5.339.