Segmenting Port Customer Based on Convolution Kernels and K-Aggregate Clustering

摘要：

With the aggravation of port economic competition,Port enterprise managers pay special attention on port Customer Relationship Management(CRM).Customer segmentation as a basis of CRM has important research meanings.In this paper,according to the characteristics of port customer data,a tree structure of data organization was obtained,reorganized the port data in 219 customer trees,introduced the concept of convolution kernels,a convolution tree kernel was defined; soon afterwards designed kernel k-aggregate clustering algorithm that suitable for tree structure data,combined the actual situation of port,segmented the customers of port into five groups;at last gained a good segmentation result verified by MATLAB data process tool.

关键词： Port customer segmentation Tree structure Convolution kernels CRM Port enterprise

作者: Yan Xu Yu Wang

作者单位: School of Management Dalian Univ.of TechnologyDalian ,P.R.China School of Management Dalian Univ.of Technology Dalian ,P.R.China

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）