User-class based service acceptance policy using cluster analysis

Hea Sook Park, W. Yan-Ha, Soon Mi Lee, Young Whan Park, Doo Kwon Baik

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. For the realization of a new service policy, this paper analyzes the level of contribution vis-à-vis the clients' service and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. In addition, to evaluate the efficiency of CRFS within the Client/Server environment, the acceptance rate per class was determined. The results of the experiment showed that the application of CRFS led to the growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.

Original languageEnglish
Pages (from-to)237-242
Number of pages6
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3347
Publication statusPublished - 2004 Dec 1
Externally publishedYes

Fingerprint

Cluster analysis
Cluster Analysis
Profit
Profitability
Policy Making
Marketing
Servers
Client/server
K-means
Growth
Industry
Server
Resources
Class
Policy
Evaluate
Experiment
Experiments

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

User-class based service acceptance policy using cluster analysis. / Park, Hea Sook; Yan-Ha, W.; Lee, Soon Mi; Park, Young Whan; Baik, Doo Kwon.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3347, 01.12.2004, p. 237-242.

Research output: Contribution to journalArticle

@article{8c0d5d085d5d404ba8d916b5ee002bd3,
title = "User-class based service acceptance policy using cluster analysis",
abstract = "This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. For the realization of a new service policy, this paper analyzes the level of contribution vis-{\`a}-vis the clients' service and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. In addition, to evaluate the efficiency of CRFS within the Client/Server environment, the acceptance rate per class was determined. The results of the experiment showed that the application of CRFS led to the growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.",
author = "Park, {Hea Sook} and W. Yan-Ha and Lee, {Soon Mi} and Park, {Young Whan} and Baik, {Doo Kwon}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3347",
pages = "237--242",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - User-class based service acceptance policy using cluster analysis

AU - Park, Hea Sook

AU - Yan-Ha, W.

AU - Lee, Soon Mi

AU - Park, Young Whan

AU - Baik, Doo Kwon

PY - 2004/12/1

Y1 - 2004/12/1

N2 - This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. For the realization of a new service policy, this paper analyzes the level of contribution vis-à-vis the clients' service and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. In addition, to evaluate the efficiency of CRFS within the Client/Server environment, the acceptance rate per class was determined. The results of the experiment showed that the application of CRFS led to the growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.

AB - This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. For the realization of a new service policy, this paper analyzes the level of contribution vis-à-vis the clients' service and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. In addition, to evaluate the efficiency of CRFS within the Client/Server environment, the acceptance rate per class was determined. The results of the experiment showed that the application of CRFS led to the growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.

UR - http://www.scopus.com/inward/record.url?scp=35048813047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048813047&partnerID=8YFLogxK

M3 - Article

VL - 3347

SP - 237

EP - 242

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -