Skip to main content
SpringerLink
Log in

Implementation of Two Stages k-Means Algorithm to Apply a Payment System Provider Framework in Banking Systems

  • Conference paper
Artificial Intelligence Perspectives and Applications

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

Abstract

Payment Systems Providers (PSPs) are companies, which provide services of payment for their customers. Recently, according to some changes in Iran central bank rules, providing services of payment are not monitored by banks anymore. This duty is assigned to some organizations called PSPs and becomes one of the most challenging topics for them. Clustering the datasets, assessment and the way of expressing customers’ demands and the provinces of requests should be recognized for improving services to the customers, banks, financial and credit institutes. The proposed framework consists of two stages using k-means algorithm and Euclidean square distances. The k-means algorithm is applied in the first stage for five provinces, which have the highest demands. In the second stage, the mean of centroids obtained from k-means are calculated and repeat clustering according to the minimum Euclidean square distances to the new centroids then comparing the information gained by two stages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Kohonen, T.: Self-organizing maps, vol. 30. Science & Business Media (2001)

    Google Scholar 

  2. Bezdec, J., et al.: Detection and characterization of cluster substructure. SIAM J. Appl. Math. 40, 339–372 (1981)

    Article  MathSciNet  Google Scholar 

  3. Kaufman, L.R., Rousseeuw, P.J.: Finding groups in data: An introduction to cluster analysis. John Wiley & Sons Inc., Hoboken (1990)

    Book  Google Scholar 

  4. Linde, Y., Buzo, A., Gray, R.M.: An algorithm for vector quantizer design. IEEE Transactions on Communications 28(1), 84–95 (1980)

    Article  Google Scholar 

  5. Abdou, H., Pointon, J., El-Masry, A.: Neural nets versus conventional techniques in credit scoring in Egyptian banking. Expert Systems with Applications 35(3), 1275–1292 (2008)

    Article  Google Scholar 

  6. Chen, C.-M., et al.: Breast Lesions on Sonograms: Computer-aided Diagnosis with Nearly Setting-Independent Features and Artificial Neural Networks 1. Radiology 226(2), 504–514 (2003)

    Article  Google Scholar 

  7. Desai, V.S., Crook, J.N., Overstreet, G.A.: A comparison of neural networks and linear scoring models in the credit union environment. European Journal of Operational Research 95(1), 24–37 (1996)

    Article  MATH  Google Scholar 

  8. Lee, T.-S., Chen, I.-F.: A two-stage hybrid credit scoring model using artificial neural networks and multivariate adaptive regression splines. Expert Systems with Applications 28(4), 743–752 (2005)

    Article  Google Scholar 

  9. Lee, T., Jeng, D.S.: Application of artificial neural networks in tide-forecasting. Ocean Engineering 29(9), 1003–1022 (2002)

    Article  Google Scholar 

  10. Malhotra, R., Malhotra, D.: Evaluating consumer loans using neural networks. Omega 31(2), 83–96 (2003)

    Article  Google Scholar 

  11. Šušteršič, M., Mramor, D., Zupan, J.: Consumer credit scoring models with limited data. Expert Systems with Applications 36(3), 4736–4744 (2009)

    Article  Google Scholar 

  12. Tsai, C.-F., Lu, Y.-H.: Customer churn prediction by hybrid neural networks. Expert Systems with Applications 36(10), 12547–12553 (2009)

    Article  MathSciNet  Google Scholar 

  13. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA (1967)

    Google Scholar 

  14. Barbakh, W.A., Wu, Y., Fyfe, C.: Review of clustering algorithms. In: Barbakh, W.A., Wu, Y., Fyfe, C. (eds.) Non-Standard Parameter Adaptation for Exploratory Data Analysis. SCI, vol. 249, pp. 7–28. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Han, J., Kamber, M., Pei, J.: Data mining, southeast asia edition: Concepts and techniques. Morgan Kaufmann (2006)

    Google Scholar 

  16. Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognition Letters 31(8), 651–666 (2010)

    Article  Google Scholar 

  17. Jain, N.C., Indrayan, A., Goel, L.R.: Monte Carlo comparison of six hierarchical clustering methods on random data. Pattern Recognition 19(1), 95–99 (1986)

    Article  Google Scholar 

  18. Jain, A.K., Dubes, R.C.: Algorithms for clustering data, vol. 6. Prentice-Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  19. Frigui, H., Krishnapuram, R.: A robust competitive clustering algorithm with applications in computer vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(5), 450–465 (1999)

    Article  Google Scholar 

  20. Hoover, A., et al.: An experimental comparison of range image segmentation algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(7), 673–689 (1996)

    Article  Google Scholar 

  21. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)

    Article  Google Scholar 

  22. Anderberg, M.R.: Cluster analysis for applications, DTIC Document (1973)

    Google Scholar 

  23. Rasmussen, E.M.: Clustering Algorithms. In: Information Retrieval: Data Structures & Algorithms, pp. 419–442 (1992)

    Google Scholar 

  24. Salton, G., Buckley, C.: Global text matching for information retrieval. Science 253(5023), 1012–1015 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  25. Bhatia, S.K., Deogun, J.S.: Conceptual clustering in information retrieval. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 28(3), 427–436 (1998)

    Article  Google Scholar 

  26. Iwayama, M., Tokunaga, T.: Cluster-based text categorization: a comparison of category search strategies. In: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM Press (1995)

    Google Scholar 

  27. Arabie, P., Wind, Y.: Marketing and social networks, vol. 171, p. 254. SAGE FOCUS EDITIONS (1994)

    Google Scholar 

  28. Oehler, K.L., Gray, R.M.: Combining image compression and classification using vector quantization. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(5), 461–473 (1995)

    Article  Google Scholar 

  29. Ester, M., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (1996)

    Google Scholar 

  30. Hofmann, T.: Probabilistic latent semantic analysis. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers Inc. (1999)

    Google Scholar 

  31. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. The Journal of Machine Learning Research 3, 993–1022 (2003)

    MATH  Google Scholar 

  32. Agrawal, R., et al.: Automatic subspace clustering of high dimensional data for data mining applications, vol. 27. ACM (1998)

    Google Scholar 

  33. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15(6), 1373–1396 (2003)

    Article  MATH  Google Scholar 

  34. Rekik, A., et al.: A k-means clustering algorithm initialization for unsupervised statistical satellite image segmentation. In: 2006 1st IEEE International Conference on E-Learning in Industrial Electronics, pp. 11–16 (2006)

    Google Scholar 

  35. Zhou, X., Shen, Q., Wang, J.: K K-means clustering algorithm based on particle swarm in image classification. Journal of Chinese Computer Systems 29(2), 333–336 (2008)

    Google Scholar 

  36. Steinhaus, H.: Sur la division des corp materiels en parties. Bull. Acad. Polon. Sci. 1, 801–804 (1956)

    Google Scholar 

  37. Lloyd, S.: Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2), 129–137 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  38. Shindler, M., Wong, A., Meyerson, A.W.: Fast and accurate k-means for large datasets. In: Advances in Neural Information Processing Systems 24, NIPS 2011 (2011)

    Google Scholar 

  39. Vidya, V.: A Hs-Hybrid Genetic Improved Fuzzy Weighted Association Rule Mining Using Enhanced Hits Algorithm. Journal of Agricultural & Biological Science 9(6) (2014)

    Google Scholar 

  40. Poikolainen, I., Neri, F., Caraffini, F.: Cluster-Based Population Initialization for differential evolution frameworks. Information Sciences 297, 216–235 (2015)

    Article  Google Scholar 

  41. Elbasiony, R.M., et al.: A hybrid network intrusion detection framework based on random forests and weighted k-means. Ain Shams Engineering Journal 4(4), 753–762 (2013)

    Article  Google Scholar 

  42. Mor, M., Gupta, P., Sharma, P.: A Genetic Algorithm Approach for Clustering. International Journal of Engineering & Computer Science 3(6) (2014)

    Google Scholar 

  43. Yaghini, M., Soltanian, R., Noori, J.: Paper: A Hybrid Clustering Method Using Genetic Algorithm With New Variation Operators. International Journal of Industrial Engineering & Production Management 21(2) (2010)

    Google Scholar 

  44. Durand, D.: Risk elements in consumer instalment financing. NBER Books (1941)

    Google Scholar 

  45. Altman, E.I.: Financial ratios, discriminant analysis and the prediction of corporate bankruptcy. The Journal of Finance 23(4), 589–609 (1968)

    Article  Google Scholar 

  46. Meyer, P.A., Pifer, H.W.: Prediction of bank failures. The Journal of Finance 25(4), 853–868 (1970)

    Article  Google Scholar 

  47. Sinkey, J.F.: A multivariate statistical analysis of the characteristics of problem banks. The Journal of Finance 30(1), 21–36 (1975)

    Article  Google Scholar 

  48. West, R.C.: A factor-analytic approach to bank condition. Journal of Banking & Finance 9(2), 253–266 (1985)

    Article  Google Scholar 

  49. Niyagas, W., Srivihok, A., Kitisin, S.: ECTI Transaction on Computer and Information Technology 2(1) (2006)

    Google Scholar 

  50. Kumar, M.V., Chaitanya, M.V., Madhavan, M.: Segmenting the Banking Market Strategy by Clustering. International Journal of Computer Applications 45 (2012)

    Google Scholar 

  51. Zarandi, S., et al.: Ranking banks using K-Means and Grey relational method. Management Science Letters 4(10), 2319–2324 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Economic Sciences, #242, Somayeh Street, Between Qarani & Vila, Tehran, Iran

    Omid Mahdi Ebadati E.

  2. Department of Knowledge Engineering and Decision Science, University of Economic Sciences, #242, Somayeh Street, Between Qarani & Vila, Tehran, Iran

    Sara Sadat Babaie

Authors
  1. Omid Mahdi Ebadati E.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sara Sadat Babaie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Omid Mahdi Ebadati E. .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in ZlĂ­n, ZlĂ­n, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in ZlĂ­n, ZlĂ­n, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in ZlĂ­n, ZlĂ­n, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in ZlĂ­n, ZlĂ­n, Czech Republic

    Zdenka Prokopova

  5. Faculty of Applied Informatics, Tomas Bata University in ZlĂ­n, ZlĂ­n, Czech Republic

    Petr Silhavy

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

E., O.M.E., Babaie, S.S. (2015). Implementation of Two Stages k-Means Algorithm to Apply a Payment System Provider Framework in Banking Systems. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol 347. Springer, Cham. https://doi.org/10.1007/978-3-319-18476-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18476-0_21

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18475-3

  • Online ISBN: 978-3-319-18476-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation