2017
DOI: 10.1016/j.ejor.2017.02.013
|View full text |Cite
|
Sign up to set email alerts
|

An iterated greedy heuristic for a market segmentation problem with multiple attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
2

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(8 citation statements)
references
References 55 publications
0
6
0
2
Order By: Relevance
“…Obviously, the traditional K-modes clustering algorithm has the following problems [17][18][19][20]:…”
Section: K-modes Clustering Algorithmmentioning
confidence: 99%
“…Obviously, the traditional K-modes clustering algorithm has the following problems [17][18][19][20]:…”
Section: K-modes Clustering Algorithmmentioning
confidence: 99%
“…Next, you need to cluster the factor variables to complete customer segmentation. The commonly used clustering algorithm is the K-means algorithm, which randomly selects a set of initial clustering centers and continuously updates iteratively until the clustering results no longer change [14]. However, the determination of the K value in the K-means algorithm is difficult to estimate.…”
Section: Factor Analysis Stepsmentioning
confidence: 99%
“…The development of market segmentation theory largely depends on the acquisition of marketing data, the advances in analytical techniques and the progress of segmentation methodology (Wedel and Kamakura, 2012). We refer readers to two recent papers (Huerta-Muñoz et al , 2017; Liu et al , 2019) that provide detailed reviews for quantitative study on various market segmentation approaches and solution methods for different scenarios. Besides the B2C markets, the segmentation is also challenging in B2B markets (Freytag and Clarke, 2001).…”
Section: Literature Review and Theoretical Backgroundmentioning
confidence: 99%