Skip to main content

A Search Space Reduction Methodology for Large Databases: A Case Study

  • Conference paper
Book cover Advances in Data Mining. Theoretical Aspects and Applications (ICDM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4597))

Included in the following conference series:

Abstract

Given the present need for Customer Relationship and the increased growth of the size of databases, many new approaches to large database clustering and processing have been attempted. In this work we propose a methodology based on the idea that statistically proven search space reduction is possible in practice. Two clustering models are generated: one corresponding to the full data set and another pertaining to the sampled data set. The resulting empirical distributions were mathematically tested to verify a tight non-linear significant approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Palpanas, T.: Knowledge Discovery in Data Warehouses. ACM SIGMOD record. 29(3), 88–100 (2000)

    Article  Google Scholar 

  2. Jain, K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)

    Article  Google Scholar 

  3. Berkhin, P.: Survey of Clustering Data Mining Techniques. Accrue Software (2002)

    Google Scholar 

  4. Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation Problems. Journal of the ACM 51(2), 263–280 (2004)

    Article  Google Scholar 

  5. Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for Large Databases. In: ACM SIGMOD Proceedings, pp. 73–84. ACM Press, New York (1998)

    Chapter  Google Scholar 

  6. Peter, W., Chiochetti, J., Giardina, C.: New unsupervised clustering algorithm for large datasets. In: ACM SIGKDD Proceedings, pp. 643–648. ACM Press, New York (2003)

    Google Scholar 

  7. Raymong, T.N., Jiawei, H.: Efficient and Effective Clustering Methods for Spatial Data Mining. In: 20th International Conference on Very Large Data Bases, pp. 144–155 (1994)

    Google Scholar 

  8. Cheng, D., Kannan, R., Vempala, S., Wang, G.: A Divide-and-Merge Methodology for Clustering. In: ACM SIGMOD Proceedings, pp. 196–205. ACM Press, New York (2005)

    Google Scholar 

  9. Jagadish, H.V., Lakshmanan, L.V., Srivastava, D.: Snakes and Sandwiches: Optimal Clustering Strategies for a Data Warehouse. In: ACM SIGMOD Proceedings, pp. 37–48. ACM Press, New York (1999)

    Google Scholar 

  10. Palmer, C.R., Faloutsos, C.: Density Biased Sampling: An Improved Method for Data Mining and Clustering. In: ACM SIGMOD Record, pp. 82–92. ACM Press, New York (2000)

    Google Scholar 

  11. Liu, H., Motoda, H.: On Issues of Instance Selection. Data Mining and Knowledge Discovery, vol. 6(2), pp. 115–130. Springer, Heidelberg (2002)

    Google Scholar 

  12. Zhu, X., Wu, X.: Scalable Representative Instance Selection and Ranking. In: Proceedings of the 18th IEEE international conference on pattern recognition, pp. 352–355. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  13. Brighton, H., Mellish, C.: Advances in Instance Selection for Instance-Based Learning Algorithms. Data Mining and Knowledge Discovery 6, 153–172 (2002)

    Article  MATH  Google Scholar 

  14. Vu, K., Hua, K.A., Cheng, H., Lang, S.: A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases. In: ACM SIGMOD Proceedings, pp. 527–538. ACM Press, New York (2006)

    Google Scholar 

  15. Zhang, D., Zhou, Z., Chen, S.: Semi-Supervised Dimensionality Reduction. In: Proceedings of the SIAM International Conference on Data Mining (2007)

    Google Scholar 

  16. Fodor, I.K.: A survey of dimension reduction techniques. U.S. Department of Energy, Lawrence Livermore National Laboratory (2002)

    Google Scholar 

  17. Hair, J.F., Anderson, R.E., Tatham, R.L., Black, W.C.: Análisis Multivariante, 5th edn., pp. 11–15. Pearson Prentice Hall, Madrid (1999)

    Google Scholar 

  18. Delmater, R., Hancock, M.: Data Mining Explained: A Manager’s Guide to Customer-Centric Business Intelligence (Chapter 6). Digital press (2001)

    Google Scholar 

  19. Bezdek, J.C.: Cluster Validity with Fuzzy Sets. Journal of Cybernetics 3, 58–72 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Petra Perner

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuri-Morales, A., Rodríguez, F. (2007). A Search Space Reduction Methodology for Large Databases: A Case Study. In: Perner, P. (eds) Advances in Data Mining. Theoretical Aspects and Applications. ICDM 2007. Lecture Notes in Computer Science(), vol 4597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73435-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73435-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73434-5

  • Online ISBN: 978-3-540-73435-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics