{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:26:25Z","timestamp":1754155585836,"version":"3.41.2"},"reference-count":37,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T00:00:00Z","timestamp":1398729600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,29]]},"abstract":"<jats:sec>\n               <jats:title content-type=\"abstract-heading\">Purpose<\/jats:title>\n               <jats:p> \u2013 Churn prediction is a very important task for successful customer relationship management. In general, churn prediction can be achieved by many data mining techniques. However, during data mining, dimensionality reduction (or feature selection) and data reduction are the two important data preprocessing steps. In particular, the aims of feature selection and data reduction are to filter out irrelevant features and noisy data samples, respectively. The purpose of this paper, performing these data preprocessing tasks, is to make the mining algorithm produce good quality mining results. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title>\n               <jats:p> \u2013 Based on a real telecom customer churn data set, seven different preprocessed data sets based on performing feature selection and data reduction by different priorities are used to train the artificial neural network as the churn prediction model. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Findings<\/jats:title>\n               <jats:p> \u2013 The results show that performing data reduction first by self-organizing maps and feature selection second by principal component analysis can allow the prediction model to provide the highest prediction accuracy. In addition, this priority allows the prediction model for more efficient learning since 66 and 62 percent of the original features and data samples are reduced, respectively. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title>\n               <jats:p> \u2013 The contribution of this paper is to understand the better procedure of performing the two important data preprocessing steps for telecom churn prediction.<\/jats:p>\n            <\/jats:sec>","DOI":"10.1108\/k-03-2013-0045","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T12:25:43Z","timestamp":1401366343000},"page":"737-749","source":"Crossref","is-referenced-by-count":12,"title":["Dimensionality and data reduction in telecom churn prediction"],"prefix":"10.1108","volume":"43","author":[{"given":"Wei-Chao","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Fong","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Wen","family":"Ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2021010120485944300_b1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.\n                and \n                  Yu, P.S.\n                (2001), \u201cOutlier detection for high dimensional data\u201d, Proceedings of the ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, pp. 37-46.","DOI":"10.1145\/376284.375668"},{"key":"key2021010120485944300_b2","doi-asserted-by":"crossref","unstructured":"Agrawal, R.\n               , \n                  Imielinski, T.\n                and \n                  Swami, A.\n                (1993), \u201cMining association rules between sets of items in large databases\u201d, Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, pp. 207-216.","DOI":"10.1145\/170036.170072"},{"key":"key2021010120485944300_b3","unstructured":"Barnett, V.\n                and \n                  Lewis, T.\n                (1994), Outliers in Statistical Data, John Wiley & Son, New York, NY."},{"key":"key2021010120485944300_b4","unstructured":"Berry, M.J.A.\n                and \n                  Linoff, G.\n                (2004), Data Mining Techniques: for Marketing, Sales, and Customer Support, John Wiley & Sons."},{"key":"key2021010120485944300_b5","doi-asserted-by":"crossref","unstructured":"Bose, I.\n                and \n                  Mahapatra, R.K.\n                (2001), \u201cBusiness data mining \u2013 a machine learning perspective\u201d, Information & Management, Vol. 39 No. 3, pp. 221-225.","DOI":"10.1016\/S0378-7206(01)00091-X"},{"key":"key2021010120485944300_b6","unstructured":"Breiman, L.\n               , \n                  Friedman, J.H.\n               , \n                  Olshen, R.A.\n                and \n                  Stone, P.J.\n                (1984), Classification and Regressing Trees, Wadsworth International Group."},{"key":"key2021010120485944300_b7","unstructured":"Fayyad, U.\n               , \n                  Piatetsky, S.G.\n                and \n                  Smyth, P.\n                (1996), Advances in Knowledge Discovery and Data Mining, The MIT Press."},{"key":"key2021010120485944300_b8","doi-asserted-by":"crossref","unstructured":"Feng, D.\n               , \n                  Chen, F.\n                and \n                  Xu, W.\n                (2014), \u201cSupervised feature subset selection with ordinal optimization\u201d, Knowledge-Based Systems, Vol. 56, pp. 123-140.","DOI":"10.1016\/j.knosys.2013.11.004"},{"key":"key2021010120485944300_b9","doi-asserted-by":"crossref","unstructured":"Ghosting, A.\n               , \n                  Parthasarathy, S.\n                and \n                  Otey, M.E.\n                (2008), \u201cFast mining of distance-based outliers in high-dimensional datasets\u201d, Data Mining and Knowledge Discovery, Vol. 16, pp. 349-364.","DOI":"10.1007\/s10618-008-0093-2"},{"key":"key2021010120485944300_b10","doi-asserted-by":"crossref","unstructured":"Gunal, S.\n                and \n                  Edizkan, R.\n                (2008), \u201cSubspace based feature selection for pattern recognition\u201d, Information Sciences, Vol. 178, pp. 3716-3726.","DOI":"10.1016\/j.ins.2008.06.001"},{"key":"key2021010120485944300_b11","unstructured":"Guyon, I.\n                and \n                  Elisseeff, A.\n                (2003), \u201cAn introduction to variable and feature selection\u201d, Journal of Machine Learning Research, Vol. 3, pp. 1157-1182."},{"key":"key2021010120485944300_b12","unstructured":"Han, J.\n                and \n                  Kamber, M.\n                (2000), Data Mining: Concepts and Techniques, Morgan Kaufmann."},{"key":"key2021010120485944300_b13","unstructured":"Haykin, S.\n                (1999), Neural Networks: A Comprehensive Foundation, 2nd ed., Prentice Hall."},{"key":"key2021010120485944300_b14","doi-asserted-by":"crossref","unstructured":"Hosmer, D.W.\n                and \n                  Lemeshow, S.\n                (2000), Applied Logistic Regression, 2nd ed., Wiley.","DOI":"10.1002\/0471722146"},{"key":"key2021010120485944300_b15","doi-asserted-by":"crossref","unstructured":"Jolliffe, I.T.\n                (1986), Principal Component Analysis, Springer Verlag.","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"key2021010120485944300_b16","unstructured":"Kantardzic, M.\n                (2003), Data mining \u2013 Concepts, Models, Methods, and Algorithms, John Wiley & Sons."},{"key":"key2021010120485944300_b17","doi-asserted-by":"crossref","unstructured":"Kim, M.\n               , \n                  Park, M.\n                and \n                  Jeong, D.\n                (2004), \u201cThe effects of customer satisfaction and switching barrier on customer loyalty in Korean mobile telecommunications services\u201d, Telecommunications Policy, Vol. 28, pp. 145-159.","DOI":"10.1016\/j.telpol.2003.12.003"},{"key":"key2021010120485944300_b18","doi-asserted-by":"crossref","unstructured":"Kittler, J.\n               , \n                  Hatef, M.\n               , \n                  Duin, R.P.W.\n                and \n                  Matas, J.\n                (1998), \u201cOn combining classifiers\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20 No. 3, pp. 226-239.","DOI":"10.1109\/34.667881"},{"key":"key2021010120485944300_b19","doi-asserted-by":"crossref","unstructured":"Kohonen, T.\n                (1987), \u201cAdaptive, associative, and self-organizing functions in neural computing\u201d, Applied Optics, Vol. 26, pp. 4910-4918.","DOI":"10.1364\/AO.26.004910"},{"key":"key2021010120485944300_b20","doi-asserted-by":"crossref","unstructured":"Lenar, M.J.\n               , \n                  Madey, G.R.\n                and \n                  Alam, P.\n                (1998), \u201cThe design and validation of a hybrid information systems\u201d, Journal of Management Information Systems, Vol. 14 No. 4, pp. 219-237.","DOI":"10.1080\/07421222.1998.11518192"},{"key":"key2021010120485944300_b21","doi-asserted-by":"crossref","unstructured":"Leyva, E.\n               , \n                  Caises, Y.\n               , \n                  Gonzalez, A.\n                and \n                  Perez, R.\n                (2014), \u201cOn the use of meta-learning for instance selection: an architecture and an experimental study\u201d, Information Sciences, Vol. 266, pp. 16-30.","DOI":"10.1016\/j.ins.2014.01.007"},{"key":"key2021010120485944300_b22","doi-asserted-by":"crossref","unstructured":"Ngai, E.W.T.\n               , \n                  Xiu, L.\n                and \n                  Chau, D.C.K.\n                (2009), \u201cApplication of data mining techniques in customer relationship management: a literature review and classification\u201d, Expert Systems with Applications, Vol. 36, pp. 2592-2602.","DOI":"10.1016\/j.eswa.2008.02.021"},{"key":"key2021010120485944300_b23","doi-asserted-by":"crossref","unstructured":"Orsenigo, C.\n                and \n                  Vercellis, C.\n                (2013), \u201cLinear versus nonlinear dimensionality reduction for banks\u2019 credit rating prediction\u201d, Knowledge-Based Systems, Vol. 47, pp. 14-22.","DOI":"10.1016\/j.knosys.2013.03.001"},{"key":"key2021010120485944300_b24","doi-asserted-by":"crossref","unstructured":"Pendharkar, P.C.\n                (2002), \u201cA computational study on the performance of ANNs under changing structural design and data distributions\u201d, European Journal of Operational Research, Vol. 138, pp. 155-177.","DOI":"10.1016\/S0377-2217(01)00085-6"},{"key":"key2021010120485944300_b25","doi-asserted-by":"crossref","unstructured":"Piramuthu, S.\n                (2004), \u201cEvaluating feature selection methods for learning in data mining applications\u201d, European Journal of Operational Research, Vol. 156, pp. 483-494.","DOI":"10.1016\/S0377-2217(02)00911-6"},{"key":"key2021010120485944300_b26","doi-asserted-by":"crossref","unstructured":"Powell, W.B.\n                (2007), Approximate Dynamic Programming: Solving the Curses of Dimensionality, Wiley-Interscience.","DOI":"10.1002\/9780470182963"},{"key":"key2021010120485944300_b27","doi-asserted-by":"crossref","unstructured":"Reinartz, T.\n                (2002), \u201cA unifying view on instance selection\u201d, Data Mining and Knowledge Discovery, Vol. 6 No. 2, pp. 191-210.","DOI":"10.1023\/A:1014047731786"},{"key":"key2021010120485944300_b28","doi-asserted-by":"crossref","unstructured":"Smith, K.A.\n                and \n                  Gupta, J.N.D.\n                (2000), \u201cNeural networks in business: techniques and applications for the operations researcher\u201d, Computers & Operations Research, Vol. 27, pp. 1023-1044.","DOI":"10.1016\/S0305-0548(99)00141-0"},{"key":"key2021010120485944300_b29","doi-asserted-by":"crossref","unstructured":"Tsai, C.-F.\n                (2009), \u201cFeature selection in bankruptcy prediction\u201d, Knowledge-Based Systems, Vol. 22 No. 2, pp. 120-127.","DOI":"10.1016\/j.knosys.2008.08.002"},{"key":"key2021010120485944300_b31","doi-asserted-by":"crossref","unstructured":"Tsai, C.-F.\n                and \n                  Chang, C.-W.\n                (2013), \u201cSVOIS: support vector oriented instance selection for text classification\u201d, Information Systems, Vol. 38 No. 8, pp. 1070-1083.","DOI":"10.1016\/j.is.2013.05.001"},{"key":"key2021010120485944300_b32","doi-asserted-by":"crossref","unstructured":"Tsai, C.-F.\n                and \n                  Chen, M.-Y.\n                (2010), \u201cVariable selection by association rules for customer churn prediction of multimedia on demand\u201d, Expert Systems with Applications, Vol. 37 No. 3, pp. 2006-2015.","DOI":"10.1016\/j.eswa.2009.06.076"},{"key":"key2021010120485944300_b33","doi-asserted-by":"crossref","unstructured":"Tsai, C.-F.\n                and \n                  Lu, Y.-H.\n                (2009), \u201cCustomer churn prediction by hybrid neural networks\u201d, Expert Systems with Applications, Vol. 36 No. 10, pp. 12547-12553.","DOI":"10.1016\/j.eswa.2009.05.032"},{"key":"key2021010120485944300_b34","unstructured":"Tsai, C.-F.\n                and \n                  Lu, Y.-H.\n                (2010), \u201cData mining techniques in customer churn prediction\u201d, Recent Patents on Computer Science, Vol. 3 No. 1, pp. 28-32."},{"key":"key2021010120485944300_b30","doi-asserted-by":"crossref","unstructured":"Tsai, C.-F.\n               , \n                  Lin, Y.-C.\n               , \n                  Yen, D.C.\n                and \n                  Chen, Y.-M.\n                (2011), \u201cPredicting stock returns by classifier ensembles\u201d, Applied Soft Computing, Vol. 11 No. 2, pp. 2452-2459.","DOI":"10.1016\/j.asoc.2010.10.001"},{"key":"key2021010120485944300_b35","doi-asserted-by":"crossref","unstructured":"Wang, J.-S.\n                and \n                  Chiang, J.-C.\n                (2008), \u201cA cluster validity measure with outlier detection for support vector clustering\u201d, IEEE Transactions on Systems, Man, and Cybernetics \u2013 Part B: Cybernetics, Vol. 38 No. 1, pp. 78-89.","DOI":"10.1109\/TSMCB.2007.908862"},{"key":"key2021010120485944300_b36","doi-asserted-by":"crossref","unstructured":"Wilson, D.R.\n                and \n                  Martinez, T.R.\n                (2000), \u201cReduction techniques for instance-based learning algorithms\u201d, Machine Learning, Vol. 38 No. 3, pp. 257-286.","DOI":"10.1023\/A:1007626913721"},{"key":"key2021010120485944300_b37","doi-asserted-by":"crossref","unstructured":"Yang, J.\n                and \n                  Olafsson, S.\n                (2006), \u201cOptimization-based feature selection with adaptive instance sampling\u201d, Computers & Operations Research, Vol. 33 No. 11, pp. 3088-3106.","DOI":"10.1016\/j.cor.2005.01.021"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/K-03-2013-0045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-03-2013-0045\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-03-2013-0045\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:47:09Z","timestamp":1753393629000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/43\/5\/737-749\/272681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,29]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,4,29]]}},"alternative-id":["10.1108\/K-03-2013-0045"],"URL":"https:\/\/doi.org\/10.1108\/k-03-2013-0045","relation":{},"ISSN":["0368-492X"],"issn-type":[{"type":"print","value":"0368-492X"}],"subject":[],"published":{"date-parts":[[2014,4,29]]}}}