XML clustering by bit vector

Authors:
Woosaeng Kim
Affiliations:
Department of Computer Science, Kwangwoon University, Seoul, Korea
Venue:
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Year:
2010

Citing 4
Cited 0

Clustering transactions using large items

Proceedings of the eighth international conference on Information and knowledge management
BitCube: A Three-Dimensional Bitmap Indexing for XML Documents

Journal of Intelligent Information Systems
A Grammar Based Model for XML Schema Integration

BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
XML Clustering by Principal Component Analysis

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML is increasingly important in data exchange and information management. A large amount of efforts have been spent in developing efficient techniques for accessing, querying, and storing XML documents. In this paper, we propose a new method to cluster XML documents efficiently. A bit vector which represents a XML document is proposed to cluster the XML documents. The similarity between two XML documents is measured by a bit-wise AND operation between two corresponding bit vectors. The experiment shows that the clusters are formed well and efficiently when a bit vector is used for the feature of a XML document.