Applying Improved Clustering Algorithm into EC Environment Data Mining

With the rising growth of electronic commerce (EC) customers, EC service providers are keen to analyze the on-line browsing behavior of the customers in their web site and learn their specific features. Clustering is a popular non-directed learning data mining technique for partitioning a dataset in...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 596; no. Mechatronics and Industrial Informatics II; pp. 951 - 959
Main Authors Jiang, Tong Hai, Ma, Bo, Ma, Yu Peng
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 01.07.2014
Subjects
Online AccessGet full text
ISBN9783038351764
3038351768
ISSN1660-9336
1662-7482
1662-7482
DOI10.4028/www.scientific.net/AMM.596.951

Cover

More Information
Summary:With the rising growth of electronic commerce (EC) customers, EC service providers are keen to analyze the on-line browsing behavior of the customers in their web site and learn their specific features. Clustering is a popular non-directed learning data mining technique for partitioning a dataset into a set of clusters. Although there are many clustering algorithms, none is superior for the task of customer segmentation. This suggests that a proper clustering algorithm should be generated for EC environment. In this paper we are concerned with the situation and proposed an improved k-means algorithm, which is effective to exclude the noisy data and improve the clustering accuracy. The experimental results performed on real EC environment are provided to demonstrate the effectiveness and feasibility of the proposed approach.
Bibliography:Selected, peer reviewed papers from the 2014 2nd International Conference on Mechatronics and Industrial Informatics (ICMII 2014), May 30-31, 2014, Guangzhou, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISBN:9783038351764
3038351768
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.596.951