This paper studies the problem of categorical DatA clustering,
especially for transactional DatA characterized by high
dimensionality and large volume. Starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is very fast and
scalable, while being quite effective. We demonstrate the
performance of our algorithm on two real world
標簽：
DatA
transactional
categorical
clustering
上傳時間：
2015-10-24
上傳用戶：evil
