Skip to main content

Competent K-means for Smart and Effective E-commerce

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 668))

Abstract

The paper compares various clustering algorithms with k-means algorithm used in e-commerce. It gives a brief introduction to the e-commerce system. K-means algorithm is largely used for the clustering, so it investigates the k-means algorithm and factors out the advantages and the drawbacks of the traditional k-means approaches. For the drawbacks of the traditional approaches, the paper tries to refine the traditional algorithm. The new algorithm is expected to increase the effectiveness and the cluster quality. Paper also proposes a unique collaborative recommendation pool approach based on k-means clustering algorithm. We adopt the modified cosine similarity to figure out the similarity between users in the same clusters. Then, we produce recommendation results for the target users. By mathematical analysis, we prove that our clustering algorithm surpasses traditional k-means algorithm.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. P. Baumann, D.S. Hochbaum, Y.T. Yang, A comparative study of leading machine learning techniques and two new algorithms submitted (2015). [online] Available at: https://scholar.google.ch/citations?user=v52HA-QAAAAJ&hl=en. Accessed 4 Jan 2017

  2. R. Agrawal, R. Srikant, Fast algorithm for mining association rules in large databases, in Proceedings of the 20th International Conference Very Large Databases, San Francisco: Morgan Kaufmann Publishers Inc. pp. 487–499

    Google Scholar 

  3. M. Emre Celebi, H.A. Kingraci, P.A. Vela, A comparative study of efficient initialization methods for the K-means clustering algorithm. Expert Syst. Appl. 40, 200–210 (2013)

    Article  Google Scholar 

  4. E. Tkacz, A. Kapczynski, Internet—Technical Development and Applications (Springer, Berlin 2009), p. 255, ISBN 978-3-642-05018-3, 2011

    Google Scholar 

  5. Survey.nasscom.in. India to be $100bn e-commerce industry by 2020| NASSCOM. [online] Available at: http://survey.nasscom.in/india-be-100bn-ecommerce-industry-2020. Accessed 4 Jan 2017

  6. J.S. Breese, D. Heckerman, C. Kadie, Empirical Analysis of Predictive Algorithms for Collaborative Filtering, UAI’98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence (1998), pp. 43–52

    Google Scholar 

  7. L.-R. Wang, Z.-F. Wu, Implementation on E-commerce Network Marketing Based on WEB Mining Technology, Seventh international conference on measuring technology and mechatronics automation (2015), pp. 556–560

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Akash Gujarathi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gujarathi, A., Kawathe, S., Swain, D., Tyagi, S., Shirsat, N. (2018). Competent K-means for Smart and Effective E-commerce. In: Dash, S., Naidu, P., Bayindir, R., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 668. Springer, Singapore. https://doi.org/10.1007/978-981-10-7868-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7868-2_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7867-5

  • Online ISBN: 978-981-10-7868-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics