Detection of Expenditure Trends in the Telecommunication Sector
Keywords:
Retailing, Telecommunication Sector, Hierarchical Clustering, Distance-Based ClusteringAbstract
In the telecommunication sector, particularly in the cellular phone service area, customer expenditures have been in the areas of voice, short messages, and internet usage, leading to a pattern of more or less regular monthly bills. Recently, telecommunication companies started to associate retail stores to their billed commercial activities, resulting in unusual variations in the monthly payment sequences of their customers. In the present work we propose a method for detecting retail expenditure in monthly bills. We then code the information of the discretized version into a binary hierarchical tree and we classify them as positive or negative with respect to complaint potential.
References
T.-Y. Ou, W.-L. Tsai, Y.-C. Lee, T.-H. Chang, S.-H. Lee, and F.-F. Huang. “A recommendation model for selling rules in the Telecom Retail Industry,” Axioms, vol. 11, no. 6, p. 265, 2022.
A. K. Jain and R. C. Dubes. “Algorithms for clustering data.” Englewood Cliffs, NJ: Prentice Hall, 1988.
S. Guha, R. Rastogi, and K. Shim. “Cure,” ACM SIGMOD Record, vol. 27, no. 2, pp. 73–84, 1998.
Y. Zhao and G. Karypis. “Empirical and theoretical comparisons of selected criterion functions for document clustering,” Machine Learning, vol. 55, no. 3, pp. 311–331, 2004.
S. P. H. A. and R. R. Sokal. “Numerical taxonomy: The principles and practice of numerical classification.” San Francisco: Freeman, 1973.
B. King. “Step-wise clustering procedures,” Journal of the American Statistical Association, vol. 62, no. 317, pp. 86–101, 1967.
G. Karypis, Eui-Hong Han, and V. Kumar. “Chameleon: Hierarchical clustering using dynamic modeling,” Computer, vol. 32, no. 8, pp. 68–75, 1999.
MacQueen, J. "Classification and analysis of multivariate observations." 5th Berkeley Symp. Math. Statist. Probability. 1967.
Cheeseman, Peter C., and John C. Stutz. "Bayesian classification (AutoClass): theory and results." Advances in knowledge discovery and data mining 180 (1996): 153-180.
Zahn, Charles T. "Graph-theoretical methods for detecting and describing gestalt clusters." IEEE Transactions on computers 100.1 (1971): 68-86.
Strehl, Alexander, and Joydeep Ghosh. "A scalable approach to balanced, high-dimensional clustering of market-baskets." International Conference on High-Performance Computing. Springer, Berlin, Heidelberg, 2000.
Boley, Daniel. "Principal direction divisive partitioning." Data mining and knowledge discovery 2.4 (1998): 325-344.
Cutting, Douglass R., et al. “Scatter/Gather: A Cluster-Based Approach to Browsing Large Document Collections.” SIGIR Forum (ACM Special Interest Group on Information Retrieval), Jan. 1992, pp. 318-329–329. EBSCOhost, https://icproxy.khas.edu.tr:2071/10.1145/133160.133214.
Larsen, Bjornar, and Chinatsu Aone. "Fast and effective text mining using linear-time document clustering." Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. 1999.
Aggarwal, Charu C., Stephen C. Gates, and Philip S. Yu. "On the merits of building categorization systems by supervised clustering." Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. 1999.
Karypis, Michael Steinbach George, Vipin Kumar, and Michael Steinbach. "A comparison of document clustering techniques." TextMining Workshop at KDD2000 (May 2000). 2000.
Graham, Ronald L., and Pavol Hell. "On the history of the minimum spanning tree problem." Annals of the History of Computing 7.1 (1985): 43-57.
De, Rham, and C. De Rham. "La Classification Hierarchique Ascendante Selon La Methode Des Voisins Reciproques." (1980).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 American Academic Scientific Research Journal for Engineering, Technology, and Sciences

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors who submit papers with this journal agree to the following terms.