Venkatesh Ganti
Johannes Gehrke
- AGGR98.Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, and Prabhakar Raghavan. Automatic subspace clustering of high dimensional data for data mining, in Proceedings of the ACM SIGMOD Conference on Management of Data, 1998. Google Scholar
Digital Library
- AMS+96.Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast Discovery of Association Rules. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, chapter 12, pages 307-328. AAAI/MIT Press, 1996. Google ScholarDigital Library
- BD76.Peter J. Bickel and Kjell A. Doksum. Mathematical Statistics: Basic Ideas and Selected Topics. Prentice Hall, 1976.Google Scholar
- CBM98.E. Keogh C. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.Google Scholar
- Cou95.Transaction Processing Performance Council, May 1995. http://www, tpc.org.Google Scholar
- CS96.P. Cheeseman and J. Stutz. Bayesian classification (autoclass): Theory and results: In U. Fayyad, G. Piatetsky- Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 153-180. MiT Press, 1996. Google ScholarDigital Library
- DER86.l.S. Duff, A.M. Erisman, and J.K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, 1986. Google ScholarDigital Library
- DLR77.A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, 1977.Google Scholar
- GGR99.Venkatesh Ganti, Johannes Gehrke, and Raghu Ramakrishnan. Cactus-clustering categorical data using summaries, http://www, cs.wisc.edu/vganti/demon/cactusfull.ps, March 1999. Google ScholarDigital Library
- GJ79.M.R. Garey and D. S. Johnson. Computers and intractability -- A guide to the theory of NP- completeness. Freeman; Bell Lab, Murray Hill N J, 1979. Google ScholarDigital Library
- GKR98.David Gibson, Jon Kleinberg, and Prabhakar Raghavan. Clustering categorical data: An approach based on dynamical systems. In Proceedings of the 24th International Conference on Very Large Databases, pages 311- 323, New York City, New York, August 24-27 1998. Google ScholarDigital Library
- GRS99.Sudipto Guha, Rajeev Rastogi, and Kyuseok Shim. Rock: A robust clustering algorithm for categorical attributes. In Proceedings of the IEEE International Conference on Data Engineering, Sydney, March 1999. Google ScholarDigital Library
- Ley.Michael Ley. Computer science bibliography. http://www, informatik.uni-trier, de/ley/db/index.html.Google Scholar
- Ram97.Raghu Ramakrishnan. Database Management Systems. McGraw Hill, 1997. Google ScholarDigital Library
- Sei.J. Seiferas. Bibliography on theory of computer science. http://liinwww, ira. uka.de/bibliography~eory/Sei feras.Google Scholar
- Wie.G. Wiederhold. Bibliography on database systems. http://liinwww, ira.uka.dedbibliography/Database/Wiederhold.Google Scholar
Index Terms
- CACTUS—clustering categorical data using summaries
Recommendations
Many-objective fuzzy centroids clustering algorithm for categorical data
We propose a novel many-objective clustering algorithm for categorical data.Our method can take advantage of different cluster validity indices simultaneously.Two versions of the proposed algorithm are presented with and without cluster number.The ...
On Data Labeling for Clustering Categorical Data
Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels after the normal process. Although there is a straightforward ...
Fuzzy clustering of categorical data using fuzzy centroids
In this paper the conventional fuzzy k-modes algorithm for clustering categorical data is extended by representing the clusters of categorical data with fuzzy centroids instead of the hard-type centroids used in the original algorithm. Use of fuzzy ...
Comments