Database Reference
In-Depth Information
54. G. Liu, J. Li, K. Sim, and L. Wong. Distance based subspace clustering with flexible dimension
partitioning. In 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey ,
pages 1250-1254, 2007.
55. S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory ,
28(2):129-136, 1982.
56. J. MacQueen. Some methods for classification and analysis of multivariate observations. In 5th
Berkeley Symposium on Mathematics, Statistics, and Probabilistics , volume 1, pages 281-297,
1967.
57. M. Mampaey, N. Tatti, and J. Vreeken. Tell me what I need to know: Succinctly summarizing
data with itemsets. In 17th ACM International Conference on Knowledge Discovery and Data
Mining (SIGKDD), San Diego, CA , pages 573-581, 2011.
58. G. Moise, J. Sander, and M. Ester. P3C: A robust projected clustering algorithm. In 6th IEEE
International Conference on Data Mining (ICDM), Hong Kong, China , pages 414-425, 2006.
59. G. Moise, J. Sander, and M. Ester. Robust projected clustering. Knowledge and Information
Systems (KAIS) , 14(3):273-298, 2008.
60. G. Moise, A. Zimek, P. Kröger, H.-P. Kriegel, and J. Sander. Subspace and projected clustering:
Experimental evaluation and analysis. Knowledge and Information Systems (KAIS) , 21(3):299-
326, 2009.
61. E. Müller, I. Assent, S. Günnemann, R. Krieger, and T. Seidl. Relevant subspace clustering:
Mining the most interesting non-redundant concepts in high dimensional data. In 9th IEEE
International Conference on Data Mining (ICDM), Miami, FL , pages 377-386, 2009.
62. E. Müller, I. Assent, R. Krieger, S. Günnemann, and T. Seidl. Dens-Est:density estimation
for data mining in high dimensional spaces. In 9th SIAM International Conference on Data
Mining (SDM), Sparks, NV , pages 173-184, 2009.
63. E. Müller, S. Günnemann, I. Assent, and T. Seidl. Evaluating clustering in subspace projections
of high dimensional data. In 35th International Conference on Very Large Data Bases (VLDB),
Lyon, France , pages 1270-1281, 2009.
64. E. Müller, I. Assent, S. Günnemann, and T. Seidl. Scalable densitybased subspace clustering.
In 20th ACM Conference on Information and Knowledge Management (CIKM), Glasgow, UK ,
pages 1077-1086, 2011.
65. H. S. Nagesh, S. Goil, and A. Choudhary. Adaptive grids for clustering massive data sets. In
1st SIAM International Conference on Data Mining (SDM), Chicago, IL , 2001.
66. H. V. Nguyen, E. Müller, J. Vreeken, F. Keller, and K. Böhm. CMI: an information-
theoretic contrast measure for enhancing subspace cluster and outlier detection. In 13th SIAM
International Conference on Data Mining (SDM), Austin, TX , pages 198-206, 2013.
67. L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: A review.
ACM SIGKDD Explorations , 6(1):90-105, 2004.
68. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for
association rules. In 7th International Conference on Database Theory (ICDT), Jerusalem,
Israel , pages 398-416, 1999.
69. J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. MaPle: A fast algorithm for maximal pattern-
based clustering. In 3rd IEEE International Conference on Data Mining (ICDM), Melbourne,
FL , pages 259-266, 2003.
70. J. M. Phillips, P. Raman, and S. Venkatasubramanian. Generating a diverse set of high-quality
clusterings. In 2nd MultiClust Workshop: Discovering, Summarizing and Using Multiple
Clusterings Held in Conjunction with ECML PKDD 2011, Athens, Greece , pages 80-91,
2011.
71. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast
projective clustering. In ACM International Conference on Management of Data (SIGMOD),
Madison, WI , pages 418-427, 2002.
72. Z. J. Qi and I. Davidson. A principled and flexible framework for finding alternative clusterings.
In 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD),
Paris, France , pages 717-726, 2009.
Search WWH ::




Custom Search