XML Document Clustering Technique by K-means algorithm through PCA 


Vol. 18,  No. 5, pp. 339-342, Oct.  2011
10.3745/KIPSTD.2011.18.5.339


PDF
  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
  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.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals