Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 56))

Abstract

This investigation presents a clustering algorithm that incorporates neighbor searching into the density-based IDBSCAN algorithm. The rooted algorithm performs fewer searches than standard IDBSCAN. Experimental results indicate that the proposed MIDBSCAN algorithm has a lower execution time cost than DBSCAN, IDBSCAN or KIDBSCAN. MIDBSCAN has a maximum deviation in clustering correctness rate of 0.1%, and a maximum deviation in noise data filtering rate of 0.3%.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Borah, B., Bhattacharyya, D.K.: An Improved Sampling-Based DBSCAN for Large Spatial Databases. In: Proceedings of International Conference on Intelligent Sensing and Information, pp. 92–96 (2004)

    Google Scholar 

  2. Ester, M., Kriegel, H., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226–231 (1996)

    Google Scholar 

  3. Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Data Bases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, vol. 27(2), pp. 73–84 (1998)

    Google Scholar 

  4. Karypis, G., Han, E.H., Kumar, V.: CHAMELEON: Hierarchical Clustering Using Dynamic Modeling. IEEE Computers 32(8), 68–75 (1999)

    Google Scholar 

  5. McQueen, J.B.: Some Methods of Classification and Analysis of Multivariate Observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)

    Google Scholar 

  6. Tsai, C.F., Chen, Z.C., Tsai, C.W.: MSGKA: An Efficient Clustering Algorithm for Large Databases. In: IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 6–13 (2002)

    Google Scholar 

  7. Tsai, C.F., Lee, J.C.: DK-Means: A Robust New Clustering Technique in Data Mining for Databases. Electronic Commerce Studies 5(4), 419–438 (2007)

    Google Scholar 

  8. Tsai, C.F., Liu, C.W.: KIDBSCAN: A New Efficient Data Clustering Algorithm for Data Mining in Large Databases. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS(LNAI), vol. 4029, pp. 702–711. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Tsai, C.F., Shih, D.C., Liu, C.W.: FICA: A New Data Clustering Technique Based on Partitional Approach for Data Mining. In: IEEE International Conference on Machine Learning and Cybernetics, Hong Kong, vol. 2, pp. 739–744 (2007)

    Google Scholar 

  10. Tsai, C.F., Tsai, C.W., Wu, H.C., Yang, T.: ACODF: A Novel Data Clustering Approach for Data Mining in Large Databases. Journal of Systems and Software 73, 133–145 (2004)

    Article  Google Scholar 

  11. Tsai, C.F., Wu, H.C., Tsai, C.W.: A New Data Clustering Approach for Data Mining in Large Databases. In: The 6th IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, Manila, Philippine, pp. 278–283 (2006)

    Google Scholar 

  12. Tsai, C.F., Yang, T.: An Intuitional Data Clustering Algorithm for Data Mining in Large Databases. In: IEEE International Conference on Informatics, Cybernetics and Systems, Taiwan, pp. 1487–1492 (2003)

    Google Scholar 

  13. Tsai, C.F., Yen, C.C.: ANGEL: A New Effective and Efficient Hybrid Clustering Technique for Large Databases. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS(LNAI), vol. 4426, pp. 817–824. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Tsai, C.F., Yen, C.C.: G-TREACLE: A New Grid-Based and Tree-Alike Pattern Clustering Technique for Large Databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS, vol. 5012, pp. 739–748. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Tsai, C.F., Yen, C.C.: Unsupervised Anomaly Detection Using HDG-Clustering Algorithm. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds.) ICONIP 2007, Part II. LNCS, vol. 4985, pp. 356–365. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Wang, W., Yang, J., Muntz, R.: STING: A Statistical Information Grid Approach to Spatial Data Mining. In: Proceedings of 23rd International Conference on Very Large Data Bases, pp. 186–195 (1997)

    Google Scholar 

  17. Xu, R., Wunsch, D.: Survey of Clustering Algorithm. Proceedings of IEEE Transactions on Neural Networks 16(3), 645–678 (2005)

    Google Scholar 

  18. Vancouver 2010 XXI Olympic Winter Games, International Olympic Committee, http://www.olympic.org/uk/games/vancouver/index_uk.asp

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tsai, CF., Sung, CY. (2009). MIDBSCAN: An Efficient Density-Based Clustering Algorithm. In: Wang, H., Shen, Y., Huang, T., Zeng, Z. (eds) The Sixth International Symposium on Neural Networks (ISNN 2009). Advances in Intelligent and Soft Computing, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01216-7_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01216-7_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01215-0

  • Online ISBN: 978-3-642-01216-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics