Database Reference
In-Depth Information
32. D. Gondek and T. Hofmann. Non-redundant data clustering. In
4th IEEE International
Conference on Data Mining (ICDM), Brighton, UK
, pages 75-82, 2004.
33. D. Gondek and T. Hofmann. Non-redundant clustering with conditional ensembles. In
11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD),
Chicago, IL
, pages 70-77, 2005.
34. S. Günnemann, E. Müller, I. Färber, and T. Seidl. Detection of orthogonal concepts in sub-
spaces of high dimensional data. In
18th ACM Conference on Information and Knowledge
Management (CIKM), Hong Kong, China
, pages 1317-1326, 2009.
35. S. Günnemann, I. Färber, E. Müller, and T. Seidl. ASCLU: alternative subspace clustering.
In
MultiClust: 1st International Workshop on Discovering, Summarizing and Using Multiple
Clusterings Held in Conjunction with KDD 2010, Washington, DC
, 2010.
36. S. Günnemann, I. Färber, E. Müller, I. Assent, and T. Seidl. External evaluation measures for
subspace clustering. In
20th ACM Conference on Information and Knowledge Management
(CIKM), Glasgow, UK
, pages 1363-1372, 2011.
37. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation.
ACM
SIGMOD Record
, 29(2):1-12, 2000.
38. J. Han, M. Kamber, and J. Pei.
Data Mining: Concepts and Techniques
. Morgan Kaufmann,
3rd edition, 2011.
39. J. A. Hartigan.
Clustering Algorithms
. John Wiley & Sons, New York, London, Sydney,
Toronto, 1975.
40. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases
with noise. In
4th ACM International Conference on Knowledge Discovery and Data Mining
(KDD), New York City, NY
, pages 58-65, 1998.
41. A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the nearest neighbor in high dimen-
sional spaces? In
26th International Conference on Very Large Data Bases (VLDB), Cairo,
Egypt
, pages 506-515, 2000.
42. M. E. Houle, H.-P. Kriegel, P. Kröger, E. Schubert, and A. Zimek. Can shared-neighbor
distances defeat the curse of dimensionality? In
22nd International Conference on Scientific
and Statistical Database Management (SSDBM), Heidelberg, Germany
, pages 482-500, 2010.
43. A. K. Jain. Data clustering: 50 years beyond k-means.
Pattern Recognition Letters
, 31(8):651-
666, 2010.
44. A. K. Jain and R. C. Dubes.
Algorithms for Clustering Data
. Prentice Hall, Englewood Cliffs,
1988.
45. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review.
ACM Computing Surveys
,
31(3):264-323, 1999.
46. P. Jain, R. Meka, and I. S. Dhillon. Simultaneous unsupervised learning of disparate clusterings.
Statistical Analysis and Data Mining
, 1(3):195-210, 2008.
47. K. Kailing, H.-P. Kriegel, P. Kröger, and S. Wanka. Ranking interesting subspaces for clustering
high dimensional data. In
7th European Conference on Principles and Practice of Knowledge
Discovery in Databases (PKDD), Cavtat-Dubrovnik, Croatia
, pages 241-252, 2003.
48. K. Kailing, H.-P. Kriegel, and P. Kröger. Density-connected subspace clustering for high-
dimensional data. In
4th SIAM International Conference on Data Mining (SDM), Lake Buena
Vista, FL
, pages 246-257, 2004.
49. L. Kaufman and P. J. Rousseeuw.
Finding Groups in Data: An Introduction to Cluster Analyis
.
John Wiley & Sons, 1990.
50. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high dimensional data: A survey on sub-
space clustering, pattern-based clustering, and correlation clustering.
ACM Transactions on
Knowledge Discovery from Data (TKDD)
, 3(1):1-58, 2009.
51. H.-P. Kriegel, P. Kröger, J. Sander, and A. Zimek. Density-based clustering.
Wiley
Interdisciplinary Reviews: Data Mining and Knowledge Discovery
, 1(3):231-240, 2011.
52. H.-P. Kriegel, P. Kröger, and A. Zimek. Subspace clustering.
Wiley Interdisciplinary Reviews:
Data Mining and Knowledge Discovery
, 2(4):351-364, 2012.
53. P. Kröger and A. Zimek. Subspace clustering techniques. In L. Liu and M. T. Ozsu, editors,
Encyclopedia of Database Systems
, pages 2873-2875. Springer, 2009.
