INCE, Hüseyin; IMAMOGLU, Salih Zeki; KESKİN, Halit
December 2013
Journal of the Faculty of Engineering & Architecture of Gazi Uni;Dec2013, Vol. 28 Issue 4, p723
Academic Journal
Due to the increasing competitiveness in shopping environments, profiling consumers becomes critical for retailers and their managers. However, researchers investigated the consumer profiling based on either the shopping motivations, or the shopping values, or the consumers' decision making styles separately mostly by using K-means clustering method in the literature. In this sense, a research investigating the shopping motivations and values, and consumers' decision making styles together with a new clustering method, which overcomes the limitations of the K-means clustering method, is warranted in the literature. In this study, we used an Artificial Intelligence based technique, called Self Organizing Map (SOM), to profile consumers based upon their shopping motivations and values, and decision making styles. Our results also demonstrated that SOM's total within cluster variance is smaller than K-means's, indicating that SOM clustering is better than the K-means when the sample is non-normally distributed. The paper profiles clusters on demographics and ethnic group membership to examine similarities and differences among cluster members.


Related Articles

  • Station Segmentation with an Improved K-Means Algorithm for Hangzhou Public Bicycle System. Haitao Xu; Jing Ying; Fei Lin; Yubo Yuan // Journal of Software (1796217X);Sep2013, Vol. 8 Issue 9, p2289 

    In China, Hangzhou is the first city to establish the Public Bicycle System. Now, the system has been the largest bike- sharing program in the world. The software of Hangzhou Public Bicycle System was developed by our team. There are many and many technology problems in the decision of...

  • Improving K-means Clustering Method in Fault Diagnosis based on SOM Network. Anhua Chen; Yang Pan; Lingli Jiang // Journal of Networks;Mar2013, Vol. 8 Issue 3, p680 

    According to the problem of K value and initial cluster centers selection difficult on K-means clustering algorithm, form essential characteristics of the complex network, the fault samples can be abstracted into network nodes, and the connection between samples can be abstracted into edge, and...

  • A Preference Search System Using an Interactive Genetic Algorithm. Takuma Katanosaka; Haruhiko Sato; Satoshi Oyama; Masahito Kurihara // Proceedings of the International MultiConference of Engineers & ;2013, p1 

    This paper describes the development of a preference search system using an interactive genetic algorithm (iGA). An iGA is an functionalize user preferences. Using the mouse and the keyboard to input large data for prolonged periods induces stress and causes mental fatigue. An aim of this...

  • A Novel Model-Based Approach in Classification Using Extension Distance. Hai-Tao Zhang; Bin-Jun Wang // Applied Mechanics & Materials;2014, Issue 644-650, p2009 

    In order to solve the low efficiency problem of KNN or K-Means like algorithms in classification, a novel extension distance of interval is proposed to measure the similarity between testing data and the class domain. The method constructs representatives for data points in shorter time than...

  • Determination of homogeneous regions for regional reference evapotranspiration estimation using the self-organizing map in western Taiwan. Chen, Ching-Tien; Chang, Yu-Chuan; Wu, Guan-Ting // Paddy & Water Environment;Jan2014, Vol. 12 Issue 1, p173 

    Although, the reference evapotranspiration (ET) had been studied in many places, but when data at a given location are insufficient for a reliable estimation of the quantiles, a regional estimation must be performed to obtain ET in ungauged site. In this process of regional estimation, the sites...

  • Tekstinių dokumentų panaÅ¡umų paieÅ¡ka naudojant saviorganizuojančius neuroninius tinklus ir k vidurkių metodÄ…. Stefanovič, Pavel; Kurasova, Olga // Informacijos Mokslai / Information Sciences;2013, Vol. 65, p24 

    In this paper, we try to find similarities of different text documents by the self-organizing map (SOM) and k-means method. One of the main goals of these methods is to cluster a dataset. Using SOM, the similarities of documents can be observed visually. Both methods can be used only for...

  • Image Clustering Method Based on Density Maps Derived from Self-Organizing Mapping: SOM. Kohei Arai // International Journal of Advanced Computer Science & Application;2012, Vol. 3 Issue 7, p102 

    A new method for image clustering with density maps derived from Self-Organizing Maps (SOM) is proposed together with a clarification of learning processes during a construction of clusters. It is found that the proposed SOM based image clustering method shows much better clustered result for...

  • Extraction of Motif Patterns from Protein Sequences Using SVD with Rough K-Means Algorithm. Elayaraja, E.; Thangavel, K.; Chitralegha, M.; Chandrasekhar, T. // International Journal of Computer Science Issues (IJCSI);Nov2012, Vol. 9 Issue 6, p350 

    Discovering protein sequence motif information is one of the most crucial tasks in bioinformatics research. In this work, we try to obtain protein recurring patterns which are universally conserved across protein family boundaries. In order to generate higher quality protein sequence motif...

  • Improvement of the agricultural effective rainfall for irrigating rice using the optimal clustering model of rainfall station network. Chen, Feng-Wen; Liu, Chen-Wuing; Chang, Fi-John // Paddy & Water Environment;Oct2014, Vol. 12 Issue 4, p393 

    In this study, the clustering method was applied to improve the usage of effective rainfall (ER) for irrigating rice paddy in the region managed by the TaoYuan Irrigation Association (TIA) of Taiwan. A total of 16 rainfall stations and rainfall data from 1981 to 2000 were used. A traditional...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics