C. Procopiuc, M. Jones, P. Agarwal, and T. Murali. A montecarlo algorithm for fast projective clustering. In SIGMOD Conf, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
SCHISM: A New Approach for Interesting Subspace Mining - Karlton Sequeira And (Correct)
No context found.
C. Procopiuc, M. Jones, P. Agarwal, and T. Murali. A montecarlo algorithm for fast projective clustering. In SIGMOD Conf, 2002.
triCluster: An Effective Algorithm for Mining Coherent Clusters .. - Zhao, Zaki (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. Murali. A monte carlo algorithm for fast projective clustering. In ACM SIGMOD Conference, 2002.
Int. J. of Business Intelligence and Data Mining, Vol. 1, .. - Mining Karlton Sequeira (Correct)
No context found.
C. Procopiuc, M. Jones, P. Agarwal, and T. Murali. A monte-carlo algorithm for fast projective clustering. In ACM SIGMOD Conference, pages 418--427, 2002.
A Partitioned Fuzzy ARTMAP Implementation for Fast.. - Databases On Sequential (Correct)
No context found.
Procopiuc, C. M.; Jones, M.; Agarwal, P. K.; and Murali, T. 2002. A monte carlo algorithm for fast projective clustering.
On Discovery of Extremely Low-Dimensional Clusters Using.. - Yip, Cheung, Ng (2004) (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In ACM SIGMOD International Conference on Management of Data, 2002.
Clustering Gene Expression Data in SQL Using.. - Papadopoulos.. (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proc. ACM SIGMOD, 2002.
CLICK: Clustering Categorical Data Using K-partite Maximal.. - Peters, Zaki (2004) (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Aggarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In SIGMOD, pages 418--427, 2002.
Computing Clusters of Correlation Connected Objects - Boehm, Kailing, Kroeger, Zimek (2004) (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and M. T. M. "(a monte carlo algorithm for fast projective clustering)". In Proceedings of the 2002.
Ranking Interesting Subspaces for Clustering High.. - Kailing, Kriegel.. (2003) (3 citations) (Correct)
No context found.
Procopiuc, C.M., Jones, M., Agarwal, P.K., Murali, T.M.: "A Monte Carlo Algorithm for Fast Projective Clustering". In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Madison, WI. (2002) 418--427
A Highly-usable Projected Clustering Algorithm for Gene.. - Yip, Cheung, Ng (2003) (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In ACM SIGMOD International Conference on Management of Data, 2002.
Clustering Data Streams: Theory and Practice - Guha, Meyerson, Mishra.. (2003) (3 citations) (Correct)
No context found.
C. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. Proc. SIGMOD, 2002.
Clustering Gene Expression Data in SQL Using.. - Papadopoulos.. (2003) (Correct)
No context found.
C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In Proc. ACM SIGMOD, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC