Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Books Books 1 - 10 of 25 on S. Guha. R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large....  
" S. Guha. R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. "
Data Mining: Concepts and Techniques
by Jiawei Han - 2001 - 550 pages
No preview available - About this book

Principles of Data Mining and Knowledge Discovery: Third European Conference ...

Jan Zytkow, Jan Rauch - Business & Economics - 1999 - 593 pages
...of 24th International Conference on Very Large Data Bases, pages 428-439. Morgan Kaufmann, 1998. 6. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), pages 73-84....
Limited preview - About this book

Methodologies for Knowledge Discovery and Data Mining: Third Pacific-Asia ...

Ning Zhong, Lizhu Zhou - Business & Economics - 1999 - 533 pages
...SIGMOD Conf. on Management of Data, pages 103-114, Montreal, Quebec, June 1996. 5. S. Guha, R. Ratogi, and K. Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proc. of the A CM SIGMOD Conf. on Management of Data, pages 73-84, Seattle, Washington, June 1998. 6. M....
Limited preview - About this book

Principles of Data Mining and Knowledge Discovery: 5th European ..., Volume 5

Luc de Raedt, Arno Siebes - Business & Economics - 2001 - 510 pages
...Discovery and Data Mining (KDD-96), Aug. 1996. 4. B. Everitt. Cluster analysis, Halsted Press, 1980. 5. S. Guha, R. Rastogi. and K. Shim. Cure: An efficient...In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data(SIGMOD'98), pages 73-84, Seattle, WA, June 1998. 6. S. Guha, R. Rastogi, and S. Kyuseok. ROCK:...
Limited preview - About this book

Data Mining for Association Rules and Sequential Patterns: Sequential and ...

Jean-Marc Adamo - Computers - 2001 - 254 pages
...méthode exploratoire de données, Applications à la didactique, La Pensée Sauvage, Editions, 1996. [GRS98] S. Guha, R. Rastogi, and K. Shim, CURE: An...efficient clustering algorithm for large databases, Proc. ACM SIGMOD/PODS Conference, Seattle, 1998. [GRS99] S. Guha, R. Rastogi, and K. Shim, ROCK: A...
Limited preview - About this book

Data Warehousing and Knowledge Discovery: Third International ..., Volume 3

Yahiko Kambayashi, Werner Winiwarter, Masatoshi Arikawa - Business & Economics - 2001 - 359 pages
...Collaborative Filtering with Personal Agents for Better Recommendations, In AAAI-99, July 1999 . [6] S. Guha, R. Rastogi, and K. Shim, CURE: An Efficient Clustering Algorithm for Large Databases, In SIGMOD'9), pp. 73-84, Seattle, WA, June 1998. [7] J. Han, S. Chee, and JY Chiang, Issues for On-Line...
Limited preview - About this book

Data Mining for Scientific and Engineering Applications

R.L. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, R. Namburu - Computers - 2001 - 605 pages
...application to boosting. Journal of Computer and System Sciences, 55(1):97-119, August 1997. [GRS01] S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. SIGMOD Rec. (USA), 27(2):73-84, 2001. [Hec98] D. Heckerman. A tutorial on learning with Bayesian networks....
Limited preview - About this book

Machine Learning: ECML 2001: 12th European Conference on Machine Learning ...

Luc de Raedt, Peter Flach - Computers - 2001 - 618 pages
...Ramakrishnan, and WY Loh. Boat—Optimistic Decision Tree Construction. In Proceedings of ACM SIGMOD' 1999. [7] S. Guha, R. Rastogi, and K. Shim. CURE: An Efficient Clustering Algorithm for Large [8] D. Haussler, M. Kearns, and R. Schapire. Bounds on the Sample Complexity of Bayesian Learning Using...
Limited preview - About this book

Engineering of Intelligent Systems: 14th International Conference on ...

Laszlo Monostori, Jozsef Vancza, Moonis Ali - Computers - 2001 - 951 pages
...the ACM SIGMOD Int'l Conference on Management of Data, Washington DC, May 1993, pp. 207-2 16. 5. 5. Guha, R. Rastogi, and K. Shim, “CURE: An Efficient Clustering Algorithm for Large Databases,” SIGMOD 1998. 6. H. Toivonen, “Sampling Large Databases for Association Rules,” VLDB 1996, pp. 134145....
Limited preview - About this book

Advances in Databases: 19th British National Conference on Databases, BNCOD ...

Barry Eaglestone, Siobhan North, Alexandra Poulovassilis - Computers - 2002 - 198 pages
...clustering using the concept of mutual nearest neighbourhood. Pattern Recognition, 10(2): 105-112, 1978. 8. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), volume 27,2...
Limited preview - About this book

Software Product-Family Engineering: 4th International Workshop, PFE 2001 ...

Frank van der Linden - Business & Economics - 2002 - 416 pages
...Collaborative Filtering with Personal Agents for Better Recommendations, In AAAl-99, July 1999 . [6] S. Guha, R. Rastogi, and K. Shim, CURE: An Efficient Clustering Algorithm for Large Databases, In SIGMOD'9), pp. 73-84, Seattle, WA, June 1998. [7] J. Han, S. Chee, and JY Chiang, Issues for On-Line...
Limited preview - About this book




  1. My library
  2. Help
  3. Advanced Book Search