Finding Generalized Projected Clusters In High Dimensional Spaces.

@inproceedings{DBLP:conf/sigmod/AggarwalY00,
  author    = {Charu C. Aggarwal and
               Philip S. Yu},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Finding Generalized Projected Clusters In High Dimensional Spaces},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {70-81},
  ee        = {http://doi.acm.org/10.1145/342009.335383, db/conf/sigmod/AggarwalY00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

Charu C. Aggarwal, Cecilia Magdalena Procopiuc, Joel L. Wolf, Philip S. Yu, Jong Soo Park: Fast Algorithms for Projected Clustering. SIGMOD Conference 1999: 61-72 BibTeX

[2]

Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998: 94-105 BibTeX

[3]

Kevin S. Beyer, Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft: When Is ''Nearest Neighbor'' Meaningful? ICDT 1999: 217-235 BibTeX

[4]

Chun Hung Cheng, Ada Wai-Chee Fu, Yi Zhang: Entropy-based Subspace Clustering for Mining Numerical Data. KDD 1999: 84-93 BibTeX

[5]

Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. KDD 1996: 226-231 BibTeX

[6]

Christos Faloutsos, King-Ip Lin: FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. SIGMOD Conference 1995: 163-174 BibTeX

[7]

Aristides Gionis, Piotr Indyk, Rajeev Motwani: Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529 BibTeX

[8]

Sudipto Guha, Rajeev Rastogi, Kyuseok Shim: CURE: An Efficient Clustering Algorithm for Large Databases. SIGMOD Conference 1998: 73-84 BibTeX

[9]

Alexander Hinneburg, Daniel A. Keim: Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering. VLDB 1999: 506-517 BibTeX

[10]

Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613 BibTeX

[11]

Anil K. Jain, Richard C. Dubes: Algorithms for Clustering Data. Prentice-Hall 1988
BibTeX

[12]

...

[13]

Jon M. Kleinberg: Two Algorithms for Nearest-Neighbor Search in High Dimensions. STOC 1997: 599-608 BibTeX

[14]

Ron Kohavi, Dan Sommerfield: Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology. KDD 1995: 192-197 BibTeX

[15]

Raymond T. Ng, Jiawei Han: Efficient and Effective Clustering Methods for Spatial Data Mining. VLDB 1994: 144-155 BibTeX

[16]

Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Ambuj K. Singh: Dimensionality Reduction for Similarity Searching in Dynamic Databases. SIGMOD Conference 1998: 166-176 BibTeX

[17]

Xiaowei Xu, Martin Ester, Hans-Peter Kriegel, Jörg Sander: A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases. ICDE 1998: 324-331 BibTeX

[18]

Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD Conference 1996: 103-114 BibTeX