实现BCBimax算法,根据客户市场和行为来确定客户细分

A. Amna, A. Hermanto
{"title":"实现BCBimax算法,根据客户市场和行为来确定客户细分","authors":"A. Amna, A. Hermanto","doi":"10.1109/CAIPT.2017.8320694","DOIUrl":null,"url":null,"abstract":"Customer loyalty and long term profitability are organizational goals to maintain their existence in uncertain business environment. In order to achieve the goal, knowing and understanding customers play a crucial part in the phase of product arrangement and development. By appropriately segmenting markets as well as applying different relationship management strategies, business organization can manage potential value of each identified segments. This research aims to cluster customer based on product beneficial expectancy using biclustering method named BCBimax algorithm. While hierarchical clustering and k-means clustering can only cope with one data source and demand similar data behavior over all phase of experiment, Bimax algorithm offers a new approach in processing both internal and external data source associated as united rows and columns. The approach does not require to reduce variables, instead it creates matrix and divide the matrix into sub-matrices. As a result, customer characteristics with high number of matched criteria are effectively obtained.","PeriodicalId":351075,"journal":{"name":"2017 4th International Conference on Computer Applications and Information Processing Technology (CAIPT)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Implementation of BCBimax algorithm to determine customer segmentation based on customer market and behavior\",\"authors\":\"A. Amna, A. Hermanto\",\"doi\":\"10.1109/CAIPT.2017.8320694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Customer loyalty and long term profitability are organizational goals to maintain their existence in uncertain business environment. In order to achieve the goal, knowing and understanding customers play a crucial part in the phase of product arrangement and development. By appropriately segmenting markets as well as applying different relationship management strategies, business organization can manage potential value of each identified segments. This research aims to cluster customer based on product beneficial expectancy using biclustering method named BCBimax algorithm. While hierarchical clustering and k-means clustering can only cope with one data source and demand similar data behavior over all phase of experiment, Bimax algorithm offers a new approach in processing both internal and external data source associated as united rows and columns. The approach does not require to reduce variables, instead it creates matrix and divide the matrix into sub-matrices. As a result, customer characteristics with high number of matched criteria are effectively obtained.\",\"PeriodicalId\":351075,\"journal\":{\"name\":\"2017 4th International Conference on Computer Applications and Information Processing Technology (CAIPT)\",\"volume\":\"195 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 4th International Conference on Computer Applications and Information Processing Technology (CAIPT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIPT.2017.8320694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Computer Applications and Information Processing Technology (CAIPT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIPT.2017.8320694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

顾客忠诚度和长期盈利能力是组织在不确定的商业环境中维持生存的目标。为了实现这一目标,了解和理解客户在产品安排和开发阶段起着至关重要的作用。通过适当地细分市场以及应用不同的关系管理策略,企业组织可以管理每个确定的细分市场的潜在价值。本研究的目的是利用bcbmax算法对基于产品受益期望的客户进行聚类。虽然分层聚类和k-means聚类只能处理一个数据源,并且在实验的所有阶段都需要相似的数据行为,但maxima算法提供了一种处理内部和外部数据源的新方法。该方法不需要减少变量,而是创建矩阵并将矩阵划分为子矩阵。从而有效地获得了具有大量匹配准则的顾客特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Implementation of BCBimax algorithm to determine customer segmentation based on customer market and behavior
Customer loyalty and long term profitability are organizational goals to maintain their existence in uncertain business environment. In order to achieve the goal, knowing and understanding customers play a crucial part in the phase of product arrangement and development. By appropriately segmenting markets as well as applying different relationship management strategies, business organization can manage potential value of each identified segments. This research aims to cluster customer based on product beneficial expectancy using biclustering method named BCBimax algorithm. While hierarchical clustering and k-means clustering can only cope with one data source and demand similar data behavior over all phase of experiment, Bimax algorithm offers a new approach in processing both internal and external data source associated as united rows and columns. The approach does not require to reduce variables, instead it creates matrix and divide the matrix into sub-matrices. As a result, customer characteristics with high number of matched criteria are effectively obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信