PARTCAT: A Subspace Clustering Algorithm for High Dimensional Categorical Data

@article{Gan2006PARTCATAS,
  title={PARTCAT: A Subspace Clustering Algorithm for High Dimensional Categorical Data},
  author={Guojun Gan and Jianhong Wu and Zijiang Yang},
  journal={The 2006 IEEE International Joint Conference on Neural Network Proceedings},
  year={2006},
  pages={4406-4412}
}
A new subspace clustering algorithm, PARTCAT, is proposed to cluster high dimensional categorical data. The architecture of PARTCAT is based on the recently developed neural network architecture PART, and a major modification is provided in order to deal with categorical attributes. PARTCAT requires less number of parameters than PART, and in particular, PARTCAT does not need the distance parameter that is needed in PART and is intimately related to the similarity in each fixed dimension. Some… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-7 of 7 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values

Data Mining and Knowledge Discovery • 1998
View 3 Excerpts
Highly Influenced

Neural networks for clustering: Theory, architecture, algorithms and neural dynamics

Y. Cao
Ph.D. dissertation, Department of Mathematics and Statistics, York University, Toronto, ON, Canada, October 2002. • 2002
View 2 Excerpts

Similar Papers

Loading similar papers…