Skip to main content

The Research on Large Scale Data Set Clustering Algorithm Based on Tag Set

  • Conference paper
  • First Online:
Book cover Computational Intelligence and Intelligent Systems (ISICA 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 575))

  • 1623 Accesses

Abstract

This paper proposes a set of SSLOKmeans algorithm that helps to guide the clustering before using tag memory resident, this algorithm can further improve the large-scale data sets clustering efficiency and clustering results of quality.

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 EPUB and 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

References

  1. Kantabutra, S., Couch, A.L.: Parallel K-means clustering algorithm on NOWs. Tech. J. 1(6), 243–248 (2000)

    Google Scholar 

  2. Alsabti, K., Ranka, S., Singh, V.: An efficient K-means clustering algorithm. In: Proceedings of IPPS/SPDP Workshop on High Performance Data Mining, 1998, pp. 1–6. ACM, New York, NY (2011)

    Google Scholar 

  3. Chang, H., Yeung, D.Y.: Locally linear metric adaptation with application to semi-supervised clustering and image retrieval. Pattern Recogn. 39(7), 1253–1264 (2006)

    Article  MATH  Google Scholar 

  4. Wagstaff, K., Cardie, C., Rogers, S., et al.: Constrained K-means clustering with background knowledge. In: Proceedings of the 18th International Conference on Machine Learning, pp. 577–584. Morgan Kaufmann, San Francisco, CA (2001)

    Google Scholar 

  5. Basu, S., Banerjee, A., Mooney. R.: Semi-supervised clustering by seeding. In: Proceedings of the 19th International Conference on Machine Learning, pp. 27–34. Morgan Kaufmann, San Francisco, CA (2002)

    Google Scholar 

  6. Basu, S., Bilenko, M., Mooney R.J.: A probabilistic framework for semi-supervised clustering. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 59–68. ACM, New York, NY (2004)

    Google Scholar 

  7. Lu, Z., Leen, T.K.: Semi-supervised clustering with pair wise constraints: a discriminative approach. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, AISTATS 2007, pp. 299–306. Microtome Publishing, USA (2007)

    Google Scholar 

  8. Bradley, P.S., Fayyad, U., Reina, C.: Scaling clustering algorithms to large databases. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD 1998), pp. 9–15. AAAI Press, New York, USA (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiang Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Chen, Q. (2016). The Research on Large Scale Data Set Clustering Algorithm Based on Tag Set. In: Li, K., Li, J., Liu, Y., Castiglione, A. (eds) Computational Intelligence and Intelligent Systems. ISICA 2015. Communications in Computer and Information Science, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-10-0356-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0356-1_38

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0355-4

  • Online ISBN: 978-981-10-0356-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics