基于粗糙集信息等价矩阵的关联规则挖掘

利用粗糙集理论,从矩阵分析的角度来挖掘决策表蕴含的信息,引入粗糙集信息等价关系的同构映射——等价矩阵,等价矩阵可看作是等价关系在信息表内的知识表达。给出了等价矩阵的求取算法以及等价矩阵意义下的属性重要度和核的概念。设计了基于等价矩阵的决策信息表的最小属性约简算法。从等价矩阵本身相关操作运算来挖掘客观知识之间的关联模式,提出了基于信息等价矩阵的关联规则提取的算法。实例证明提出的算法有效,为进一步研究决策信息系统的规则提取和决策算法提供了可行的计算方法。     

基于概念格的关联规则算法

对经典Apriori算法的优、缺点进行了剖析,在实际应用项目中,提出了一种基于概念格的关联规则算法ACL(AprioriAlgorithmBasedOnConceptLattices)。在该算法中,引入了概念格和等价关系等概念,利用粗糙集相关方面的理论,计算得到频繁2-项集L2。实验表明,ACL算法是一种有效的快速的关联规则挖掘算法。     

基于粗糙集的关联规则挖掘方法

对粗糙集进行了相关研究,并提出一种以粗糙集理论为基础的关联规则挖掘方法,该方法首先利用粗糙集的特征属性约简算法进行属性约简,然后在构建约简决策表的基础上应用改进的Apriori算法进行关联规则挖掘。该方法的优势在于消除了不重要的属性,减少了属性数目和候选项集数量,同时只需一次扫描决策表就可产生决策规则。应用实例及实验结果分析表明该方法是一种有效而且快速的关联规则挖掘方法。     

基于粗糙集和Apriori算法的中医病证关联研究

本文提出一种基于粗糙集理论和Apriori算法的关联规则挖掘方法并将其应用于中医病证关联分析。该方法通过属性约简抽取特征症状,然后在约简后的决策表上应用改进的Apriori算法进行关联规则挖掘,提高了中医病证关联规则挖掘的效率。     

基于粗糙集理论的ORD关联规则挖掘算法

关联规则挖掘是数据挖掘的重要领域之一,利用粗糙集理论来挖掘关联规则的方法已经得到广泛关注.针对不完备信息系统,提出了基于粗糙集理论的快速ORD关联规则挖掘算法.该算法首先采用基于粗糙集理论的属性约简算法进行属性约简,然后采用快速、高效的冗余项集和冗余规则修剪算法--ORD算法获取关联规则.将该算法与其它同类流行的算法在4个UCI数据集上进行实验比较,结果表明该算法性能良好.     

基于粗糙集理论的关联规则挖掘模型

提出了一个基于粗糙集理论的关联规则挖掘模型。介绍了该规则挖掘模型的主要步骤，模型中应用了属性约简和规则约简技术，并给出了该两个技术的算法。     

信息系统数据清洗、规则提取的矩阵算法

本文在等价矩阵概念的基础上，分析了粗糙集知识系统中等价划分与等价矩阵的关系，采用等价矩阵来表示粗糙集的等价关系，提出了一种对数据库知识系统进行数据清洗、从中提取决策规则的矩阵算法，并分析了该算法的计算复杂性．该算法具有规则提取的工程实用性，主要优点在于能够获得信息系统中所有有价值的决策规则．文中通过实例表明了这种算法的有效性．     

基于粗糙集理论的智能销售系统设计

智能销售系统通过挖掘分析系统中客户购买行为数据得出商品销售规则,为企业获取最大利润。引入粗糙集理论,在详细描述粗糙集约简算法及其应用实例基础上,介绍了智能销售系统的设计过程。     

一种基于关联规则挖掘的粗糙集约简算法

针对粗糙集理论中的约简这个重要问题进行了研究,引入关联规则挖掘中的支持度和置信度概念,提出一种基于关联规则挖掘算法思想的约简算法,从而得到更有效的约简。     

基于关联模式挖掘的决策规则提取方法

在数据挖掘领域,关联规则的挖掘和基于粗糙集理论抽取决策规则是两种截然不同的方法,但在统计意义下两种方法产生的规则基本相同。结合关联规则挖掘方法和粗糙集方法的优点,基于Apriori算法提出一种优化算法,获取具有一定支持度和可信度阈值且不产生冗余的决策规则,以提高粗糙集属性值约简算法的性能。     

关联规则算法在邮政商函客户关系中的应用

数据挖掘是当前数据库和信息决策领域的最前沿研究方向之一,在信息化技术发展的今天其重要作用十分明显。基于全新的信息技术的管理理念——客户关系管理受到中国邮政的青睐。数据挖掘技术在邮政商函CRM系统中起着核心作用,关联规则算法是数据挖掘的核心技术,在数据挖掘中是关键应用技术。文中在对关联规则算法和邮政商函客户关系分析研究的基础上,通过把关联规则算法运用在实例中,证明了关联规则算法在邮政商函客户关系管理起到一定的作用,有很好的应用前景。     

一种关联规则挖掘方法在客户分析中的应用

数据挖掘(DataMining)是数据库系统和数据库应用的一个繁荣的学科前沿.Apriori算法作为数据挖掘中关联规则挖掘的算法之一,是一种最有影响的挖掘布尔关联规则频繁项集的算法.本文主要探讨Apriori算法的实现细节及其结合在电信业中的实现过程,并通过对实际数据的分析提出提高电信业务量的建议.     

Product portfolio identification based on association rule mining

It has been well recognized that product portfolio planning has far-reaching impact on the company's business success in competition. In general, product portfolio planning involves two main stages, namely portfolio identification and portfolio evaluation and selection. The former aims to capture and understand customer needs effectively and accordingly to transform them into specifications of product offerings. The latter concerns how to determine an optimal configuration of these identified offerings with the objective of achieving best profit performance. Current research and industrial practice have mainly focused on the economic justification of a given product portfolio, whereas the portfolio identification issue has been received only limited attention. This article intends to develop explicit decision support to improve product portfolio identification by efficient knowledge discovery from past sales and product records. As one of the important applications of data mining, association rule mining lends itself to the discovery of useful patterns associated with requirement analysis enacted among customers, marketing folks, and designers. An association rule mining system (ARMS) is proposed for effective product portfolio identification. Based on a scrutiny into the product definition process, the article studies the fundamental issues underlying product portfolio identification. The ARMS differentiates the customer needs from functional requirements involved in the respective customer and functional domains. Product portfolio identification entails the identification of functional requirement clusters in conjunction with the mappings from customer needs to these clusters. While clusters of functional requirements are identified based on fuzzy clustering analysis, the mapping mechanism between the customer and functional domains is incarnated in association rules. The ARMS architecture and implementation issues are discussed in detail. An application of the proposed methodology and system in a consumer electronics company to generate a vibration motor portfolio for mobile phones is also presented.     

基于属性位复用的约束性关联规则挖掘算法

在提取满足用户特定需求的关联规则时,由于现有约束性关联规则挖掘算法存在大量的冗余候选项和重复计算,故提出一种基于属性位复用的约束性关联规则挖掘算法,其适合挖掘任何长度且满足用户特定需求的关联规则。该算法通过属性位的权值组合,将交易事务转换成整数,用属性位复用技术构建候选区间,并利用其端点值双向变化,构建索引候选频繁项,同时也用布尔运算计算其支持数。实验证明其比现有算法更快速,将其应用到客户关系管理系统中分析客户关联信息,可以有效地提高系统效率。     

A combined mining-based framework for predicting telecommunications customer payment behaviors

Most existing data mining algorithms apply data-driven data mining technologies. The major disadvantage of this method is that expert analysis is required before the derived information can be used. In this paper, we thus adopt a domain-driven data mining strategy and utilize association rules, clustering, and decision trees to analyze the data from fixed-line users for establishing a late payment prediction system, namely the Combined Mining-based Customer Payment Behavior Predication System (CM-CoP). The CM-CoP could indicate potential users who may not pay the fee on time. In the implementation of the proposed system, first association rules were used to analyze customer payment behavior and the results of analysis were used to generate derivative attributes. Next, the clustering algorithm was used for customer segmentation. The cluster of customers who paid their bills was found and was then deleted to reduce data imbalances. Finally, a decision tree was utilized to predict and analyze the rest of the data using the derivative attributes and the attributes provided by the telecom providers. In the evaluation results, the average accuracy of the CM-CoP model was 78.53% under an average recall of 88.13% and an average gain of 11.2% after a six-month validation. Since the prediction accuracy of the existing method used by telecom providers was 65.60%, the prediction accuracy of the proposed model was 13% greater. In other words, the results indicate that the CM-CoP model is effective, and is better than that of the existing approach used in the telecom providers.     

基于客户细分的客户流失预测研究

分析了电信行业客户关系管理系统的数据独有特点,提出基于客户细分的客户流失预测模型.首先,采用模糊核C-均值聚类算法用于客户细分并对细分结果进行分析,发现高价值客户的群体特征.再利用企业历史数据建立基于SAS数据挖掘技术的客户流失预测模型.最后,把高价值客户作为预测目标数据应用于该模型当中预测出有流失倾向的客户.实验结果表明,该方法有效可行,可以为企业提供准确、有流失倾向的客户名单.     

数据挖掘技术在电信CRM中的应用

随着CRM（客户关系管理系统）的不断发展和应用，使用数据挖掘技术进行客户分析变得越来越重要，尤其像电信这种以客户为中心的行业。本文在分析近年来CRM信领域的应用现状的基础上，介绍了数据挖掘技术和客户关系管理概念，并着重阐述了将数据挖掘技术应用到CRM的步骤和流程。     

基于数据挖掘技术的营销模式

该文运用聚类分析、关联规则和决策树等数据挖掘技术,力图创新出以消费者为导向,以交叉销售为特征的一种新的营销模式。新的营销模式分运用聚类分析建立客户细分数据库、运用关联规则提取交叉规则和运用决策树技术识别目标客户三个步骤来实施。     

Segmentation of telecom customers based on customer value by decision tree model

The more the telecom services marketing paradigm evolves, the more important it becomes to retain high value customers. Traditional customer segmentation methods based on experience or ARPU (Average Revenue per User) consider neither customers’ future revenue nor the cost of servicing customers of different types. Therefore, it is very difficult to effectively identify high-value customers. In this paper, we propose a novel customer segmentation method based on customer lifecycle, which includes five decision models, i.e. current value, historic value, prediction of long-term value, credit and loyalty. Due to the difficulty of quantitative computation of long-term value, credit and loyalty, a decision tree method is used to extract important parameters related to long-term value, credit and loyalty. Then a judgments matrix formulated on the basis of characteristics of data and the experience of business experts is presented. Finally a simple and practical customer value evaluation system is built. This model is applied to telecom operators in a province in China and good accuracy is achieved.     

基于聚类分析的客户细分研究

本文应用数据挖掘技术中的聚类分析,进行对客户细分的研究。介绍了K平均算法和K平均算法在客户细分中的应用,并提出了客户价值、消费特征和人口特征三个维度应是客户细分的主要内容。