Finding Generalized Projected Clusters In High Dimensional Spaces

@inproceedings{Aggarwal2000FindingGP,
  title={Finding Generalized Projected Clusters In High Dimensional Spaces},
  author={Charu C. Aggarwal and Philip S. Yu},
  booktitle={SIGMOD Conference},
  year={2000}
}
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimensional data, even the concept of proximity or clustering may not be meaningful. We discuss very general techniques for projected clustering which are able to construct clusters in arbitrarily aligned subspaces of lower dimensionality. The subspaces are specific to the clusters themselves. This definition is substantially… CONTINUE READING
Highly Influential
This paper has highly influenced 63 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 629 citations. REVIEW CITATIONS
390 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 390 extracted citations

630 Citations

0204060'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 630 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Fast algorithms for projected clustering

  • C. C. Aggarwal et. al
  • ACM SIGMOD Conference,
  • 1999
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…