Segmenting customers by transaction data with concept hierarchy

The segmentation of customers is crucial for an organization wishing to develop appropriate promotion strategies for different clusters. Clustering customers provides an in-depth understanding of their behavior. However, previous studies have paid little attention to the similarity of different items in transaction. Lack of categories and concept levels of items, results from item-based segmentation methods are not as good as expected. Through employing a concept hierarchy of items, this study proposes a segmentation methodology to identify similarities between customers. First, the dissimilarity between transaction sequences is defined. Second, we adopt hierarchical clustering method to segment customers by their transaction data with concept hierarchy of consumed items. After segmentation, three cluster validation indices are used for optimizing the number of clusters of customers. Through the compassion of normalized index, the segmentation method proposed by this study rendered better results than other traditional methods.     

SA-BFSN:一种自适应基于密度聚类的算法

针对BFSN算法需要人工输入参数r和λ的缺陷,提出了一种自适应确定r和λ的SA-BFSN聚类方法。该方法通过Inverse Gaussian拟合判断r参数,通过分析噪声点数量的分布特征选择合适的λ值。算法测试表明,使用SA-BFSN无需人工输入参数,能够实现聚类过程的全自动化,能够有效处理任意形状、大小和密度的簇。     

一种基于模糊评判的水平叠加方法

以信号的模式识别为基础,应用模糊评判的方法,通过道集叠加得到标准道,对道集内的各道进行模糊评判,剔除评判结果最差的道,再次进行叠加、评判、剔除,直到达到要求的评判结果或规定的最大剔除道数.模拟试验表明,通过模糊评判方法得到的叠加记录的效果明显优于直接叠加.     

γ辐射降解法制备小分子水溶性壳聚糖

用γ辐射降解法成功制备了一系列小分子水溶性壳聚糖。研究了不同条件下γ射线对壳聚糖的降解效应以及吸收剂量对产物分子量和水溶性产物得率的影响,分析了不同预处理条件对辐射降解产额(Gd值)的影响,并对壳聚糖辐射降解的机理进行了初步探讨。所得产物用凝胶渗透色谱(Gel permeation chromatography, GPC)、傅立叶变换红外光谱(Fourier transform infrared spectrometer,FT-IR)、紫外-可见光谱(Ultraviolet-Visible spectrophotometry,UV-VIS)等手段进行了表征分析。结果表明,壳聚糖在降解过程中不但分子量显著减少, 而且化学结构发生了明显变化,·OH自由基在壳聚糖辐射降解过程中起着至关重要的作用。     

改进分块支持向量聚类在入侵检测中的应用

支持向量聚类(SVC)是在支持向量机的思想上发展而来一种聚类方法,针对其处理大规模数据集速度缓慢的缺点,提出了一种改进的分块支持向量聚类算法。改进的算法分为三个阶段:前期的预处理,中期的分块算法,后期的改进标类算法。提出的方法显著加快了SVC的速度,在保持原来SVC算法的优点的基础上,对大规模数据集以及非均匀分布数据集等具有良好的效果。将其应用到网络入侵检测,实验结果表明改进的算法行之有效。     

Adherence Across Behavioral Domains in Treatment Promoting Smoking Cessation Plus Weight Control.

The authors tested whether adherence to simultaneous health behavior changes was unitary or domain specific among 76 women who modified smoking, eating, and physical activity to accomplish smoking cessation plus weight control. Random-effects regression analyses showed that adherence to both smoking and diet plans declined linearly and covaried positively; their association tended to grow stronger over time. In contrast, physical activity plan adherence did not change over time and was unrelated to other domains. At the end of treatment, 65%, 30.5%, and 25% adhered well or excellently to smoking, diet, and activity treatments, respectively. Findings support both unitary and domain-specific aspects of adherence and suggest that among smokers, smoking and eating behaviors may have similarities unshared by physical activity. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

双晶单色器晶体间位置关系及尺寸的确定方法

介绍了双晶单色器出射光与入射光T型固定出口机构的工作原理，分析了双晶之间位置关系及尺寸确定所需遵循的原则，并根据这些原则提出一种基于T型固定出口机构的双晶单色器晶体间位置关系及尺寸的确定方法。该方法不仅能够满足双晶单色器的固定出口的工作要求，而且还优化了双晶的长度尺寸、消除了第二晶体微调的位置误差。最后举例论证了该方法的有效性。     

亚麻针织产品的酶整理工艺探讨

为改善亚麻针织物的舒适性能，探讨用生物酶整理工艺来提高其柔软性。选取酶剂浓度、pH值、温度和时间4个因素作为正交实验的因子，进行了四因素四水平的正交实验。通过对实验结果的分析，确定了合理的生物酶整理工艺条件。工艺参数分别为：酶整理温度为50℃，整理液pH值为5，酶剂浓度为2%，整理时间为60min,亚麻针织坯布经过这种优化的酶整理后柔软性改善效果十分显著。     

基于VB6．0的灰色建模系统开发及其应用

灰色系统理论是应用广泛的、用于不确定问题建模和不确定信息系统数据挖掘的一门新兴横断学科。基于VB6.0的灰色建模系统的开发填补了灰色系统理论及其应用的空白。文中阐述了该系统的开发思想、应用流程及几个关键技术,并以2002～2005年上海市上网户数预测为例,介绍了其子程序GM(1,1)的用法。该建模系统的开发有利于广大学者应用灰色系统进行建模和数据分析,促进其在应用领域的发展。     

Robust matrix 𝒟U‐stability analysis

In this paper, the problem of robust matrix root‐clustering is addressed. The studied matrices are subject to both polytopic and unstructured uncertainties. An original point is the large choice of clustering regions enabled by the proposed approach since these regions can be unions of possibly disjoint and non‐symmetric subregions of the complex plane. The precise purpose is, considering a specified polytope, to determine the greatest robustness bound on the unstructured uncertainty such that robust matrix root‐clustering is ensured. To reduce conservatism in the derivation of the bound, the reasoning relies on a framework based upon parameter‐dependent Lyapunov functions. The bound value is computed by solving an ?? ?? ? problem. Copyright © 2003 John Wiley & Sons, Ltd.