Abstract
We have proposed a semi-structured data mining method when there is a huge number of data items and a large amount of semi-structured data, in particular, a labeled ordered tree. Our approach is to compress data structure into a bit vector and then mine the compressed data structure using fast low-level bit operations. The experimental results showed that our approach is more effective than conventional methods when there is a large amount of semi-structured data.
