共查询到20条相似文献,搜索用时 15 毫秒
1.
为了在事务数据库中发现关联规则,在现实挖掘应用中,经常采用不同的标准去判断不同项目的重要性,管理项目之间的分类关系和处理定量数据集这3个方法去处理问题,因此提出一个在定量事务数据库中采用多最小支持度,在项目集中获取隐含知识的多层模糊关联规则挖掘算法。该挖掘算法使用两种支持度约束和至上而下逐步细化的方法推导出频繁项集,同时可以发现交叉层次的模糊关联规则。通过实例证明了该挖掘算法在多最小支持度约束下推导出的多层模糊关联规则是易于理解和有意义的,具有很好的效率和伸缩性。 相似文献
2.
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific
purposes. Mining association rules from transaction data is most commonly seen among the mining techniques. Most of the previous
mining approaches set a single minimum support threshold for all the items and identify the relationships among transactions
using binary values. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting both association rules
and membership functions from quantitative transactions under a single minimum support. In real applications, different items
may have different criteria to judge their importance. In this paper, we thus propose an algorithm which combines clustering,
fuzzy and genetic concepts for extracting reasonable multiple minimum support values, membership functions and fuzzy association
rules from quantitative transactions. It first uses the k-means clustering approach to gather similar items into groups. All items in the same cluster are considered to have similar
characteristics and are assigned similar values for initializing a better population. Each chromosome is then evaluated by
the criteria of requirement satisfaction and suitability of membership functions to estimate its fitness value. Experimental
results also show the effectiveness and the efficiency of the proposed approach. 相似文献
3.
针对数据集中交易记录和数据项的重要性不同问题,提出了一种多最小支持度的加权关联规则挖掘算法,允许用户设定多个最小支持度,给出交易记录不同的权重,从而发现有价值的关联规则。该算法按项目的最小支持度升序对交易记录进行分类,按类别依次求出每一类别内的加权频繁集。在挖掘过程中由于剔除了冗余项目并对相同项集累加计数,且不需多次重复扫描数据库,从而提高了挖掘效率。实验结果表明,新算法能有效地从数据集中挖掘出加权关联规则。 相似文献
4.
某些情况下提取关联规则挖掘时需要根据项目的特点设置不同的最小支持度,针对此问题进行了多重最小支持度的频繁项集挖掘算法研究。在FP-growth的基础上提出了多重最小支持度树(MS-tree)的新方法,并设计了MS-growth算法对MS-tree进行频繁模式集的挖掘。该算法只需扫描一次数据库,克服了MSapriori算法在生成关联规则时需要重新扫描数据库的缺点。实验表明,新算法的性能可以和FP-growth算法相比,而且可以处理多重最小支持度的问题。 相似文献
5.
Fuzzy mining approaches have recently been discussed for deriving fuzzy knowledge. Since items may have their own characteristics, different minimum supports and membership functions may be specified for different items. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting minimum supports and membership functions for items from quantitative transactions. In that paper, minimum supports and membership functions of all items are encoded in a chromosome such that it may be not easy to converge. In this paper, an enhanced approach is proposed, which processes the items in a divide-and-conquer strategy. The approach is called divide-and-conquer genetic-fuzzy mining algorithm for items with Multiple Minimum Supports ( DGFMMS), and is designed for finding minimum supports, membership functions, and fuzzy association rules. Possible solutions are evaluated by their requirement satisfaction divided by their suitability of derived membership functions. The proposed GA framework maintains multiple populations, each for one item’s minimum support and membership functions. The final best minimum supports and membership functions in all the populations are then gathered together to be used for mining fuzzy association rules. Experimental results also show the effectiveness of the proposed approach. 相似文献
6.
Periodic patterns and cyclic patterns have been used to discover recurring patterns in sequence databases. Toroslu (2003) proposed cyclically repeated pattern (CRP) mining, in which a new parameter called repetition support is considered in the mining process. In a data sequence, the occurrence of a subsequence must satisfy a single user-specified minimum repetition support. However, in real-life applications, items may occur at various frequencies in a database. The rare item problem may occur when all items are set to a single minimum repetition support. To solve this problem, we included the concept of multiple minimum supports to enable users to specify the multiple minimum item repetition support (MIR) according to the natures of items. In this paper, we first redefined CRPs based on the MIR and original form of the sequence minimum support. A new algorithm, rep-PrefixSpan, was developed for discovering a complete set of CRPs in sequence databases. The experimental results indicate that the proposed approach exhibits performance superior to that of conventional CRP mining. The proposed method can be applied in many application domains including customer purchase behavior, web logging, and stock analyses. 相似文献
7.
The temporal and spatial characteristics of users are involved in most Internet of Things (IoT) applications. The spatial and temporal movement patterns of users are the most direct manifestation of the temporal and spatial characteristics. The user’s interests, activities, experience and other characteristics are reflected by mobile mode. In view of the low clustering efficiency of moving objects in convergent pattern mining in the IoT, a spatiotemporal feature mining algorithm based on multiple minimum supports of pattern growth is proposed. Based on the temporal characteristics of user trajectories, frequent and asynchronous periodic spatiotemporal movement patterns are mined. Firstly, the location sequence is modeled, and the time information is added to the model. Then, a mining algorithm of asynchronous periodic sequential pattern is adopted. The algorithm is based on multiple minimum supports of pattern growth. According to multiple minimum supports, the sequential pattern of asynchronous period is mined deeply and recursively. Finally, the proposed method is validated and evaluated by Gowalla dataset, in which the user characteristics are truly reflected. It is shown by the experimental results that the average pointwise mutual information (PWI) of the proposed algorithm reaches 0.93. And the algorithm is proved to be effective and accurate. 相似文献
8.
在多支持度关联规则挖掘算法中,针对最小支持度的选取问题,提出一种基于分段函数的多支持度关联规则挖掘算法.在多支持度算法中挖掘频繁集的时候,最小支持度由项集最小项支持度的最小值、最大值和给定的参考值所决定,这样避免了采用最小值作为最小支持度算法的时间复杂度高和存在无效规则的问题,以及采用最大值致使剪枝程度过大而造成规则遗漏的问题.通过实验结果表明了该算法的有效性. 相似文献
9.
空间关联规则挖掘可应用于发现空间数据库中大量空间谓词与非空间谓词之间的特定空间关系。论文针对区县道路交通数据提出了一种基于多最小支持度的空间关联规则挖掘算法,并给出了在GIS中进行空间关联规则挖掘的一般方法和流程。该挖掘算法可以从城市道路地理信息数据库中发现用户感兴趣的空间关联规则,经实际应用于城市道路规划管理系统,证明该算法是有效、可行的。 相似文献
10.
关联规则是数据挖掘的重要任务之一,传统关联规则算法只有一个最小支持度,假设项出现的频率大致相同,而在谮实际中并非如此,由此产生了多支持度关联规则问题.该问题针对每个项给定不同的支持度,而在实际应用中项可以划分成若干个组,每组有一个支持度.由此提出了分组多支持度关联规则问题,针对该问题给出了基于多支持度性质对项进行分组的方法.该方法可以降低2-项候选集的数目.在此基础上,进一步给出了相应的多支持度关联规则发现算法,并通过实验证明了算法的有效性. 相似文献
11.
Researchers realized the importance of integrating fuzziness into association rules mining in databases with binary and quantitative
attributes. However, most of the earlier algorithms proposed for fuzzy association rules mining either assume that fuzzy sets
are given or employ a clustering algorithm, like CURE, to decide on fuzzy sets; for both cases the number of fuzzy sets is
pre-specified. In this paper, we propose an automated method to decide on the number of fuzzy sets and for the autonomous
mining of both fuzzy sets and fuzzy association rules. We achieve this by developing an automated clustering method based
on multi-objective Genetic Algorithms (GA); the aim of the proposed approach is to automatically cluster values of a quantitative
attribute in order to obtain large number of large itemsets in less time. We compare the proposed multi-objective GA based
approach with two other approaches, namely: 1) CURE-based approach, which is known as one of the most efficient clustering
algorithms; 2) Chien et al. clustering approach, which is an automatic interval partition method based on variation of density.
Experimental results on 100 K transactions extracted from the adult data of USA census in year 2000 showed that the proposed
automated clustering method exhibits good performance over both CURE-based approach and Chien et al.’s work in terms of runtime,
number of large itemsets and number of association rules. 相似文献
12.
针对谱聚类融合模糊 C-means(FCM)聚类的蛋白质相互作用(PPI)网络功能模块挖掘方法准确率不高、执行效率较低和易受假阳性影响的问题,提出一种基于模糊谱聚类的不确定PPI网络功能模块挖掘(FSC-FM)方法。首先,构建一个不确定PPI网络模型,使用边聚集系数给每一条蛋白质交互作用赋予一个存在概率测度,克服假阳性对实验结果的影响;第二,利用基于边聚集系数流行距离(FEC)策略改进谱聚类中的相似度计算,解决谱聚类算法对尺度参数敏感的问题,进而利用谱聚类算法对不确定PPI网络数据进行预处理,降低数据的维数,提高聚类的准确率;第三,设计基于密度的概率中心选取策略(DPCS)解决模糊 C-means算法对初始聚类中心和聚类数目敏感的问题,并对预处理后的PPI数据进行FCM聚类,提高聚类的执行效率以及灵敏度;最后,采用改进的边期望稠密度(EED)对挖掘出的蛋白质功能模块进行过滤。在酵母菌DIP数据集上运行各个算法可知,FSC-FM与基于不确定图模型的检测蛋白质复合物(DCU)算法相比,F-measure值提高了27.92%,执行效率提高了27.92%;与在动态蛋白质相互作用网络中识别复合物的方法(CDUN)、演化算法(EA)、医学基因或蛋白质预测算法(MGPPA)相比也有更高的F-measure值和执行效率。实验结果表明,在不确定PPI网络中,FSC-FM适合用于功能模块的挖掘。 相似文献
13.
提出了一种新的动态模糊自组织神经网络模型(TGFCM),并将其用于文本聚类中。针对传统模糊自组织神经网络需要预先确定聚类数的问题,TGFCM采用了可自动确定聚类数的动态自组织神经网络(TGSOM)的结构,在TGSOM网络结构中提出新的学习率计算式,并以模糊聚类中心作为TGFCM网络中对应的神经元的权值,从而提高了聚类的精度,并可提高收敛速度。 相似文献
14.
针对模糊c-均值(FCM)聚类算法受初始聚类中心影响,易陷入局部最优,以及算法对孤立点数据敏感的问题,提出了解决方案:采用快速减法聚类算法初始化聚类中心,为每个样本点赋予一个定量的权值,用来区分不同的样本点对最终的聚类结果的不同作用,为提高聚类速度采用修正隶属度矩阵的方法,并将算法与传统的FCM相比.实验结果表明,该算法较好地解决了初值问题,与随机初始化方法相比,迭代次数少、收敛速度快、具有较好的聚类结果. 相似文献
15.
提出一种新的基于模糊聚类的组合分类器算法,该算法利用模糊聚类技术产生训练样本的分布特征,据此为每一个样本赋予一个权值,来确定它们被采样的概率,利用采样样本训练的分类器调整训练集的采样概率,依次生成新的分类器直至达到一定的精度。该组合分类器算法在UCI的多个标准数据集上进行了测试,并与Bagging和AdaBoost算法进行了比较,实验结果表明新的算法具有更好的健壮性和更高的分类精度。 相似文献
16.
针对局部空间信息的模糊C-均值算法(WFLICM)中空间影响因子容易受到噪声影响出现错误标识的问题,提出一种融合局部和非局部空间信息的模糊C-均值聚类图像分割算法(NLWFLICM),在WFLICM算法的模糊影响因子中引入非局部空间信息,根据噪声程度自适应地设置局部和非局部信息权重,并重新标记中心点的模糊影响因子。实验结果表明,NLWFLICM算法具有比WFLICM算法更强的鲁棒性和自适应性,并在一定程度上提高了WFLICM算法对含有大量噪声图像进行分割的鲁棒性,同时保留了图像的纹理。为了提高算法的聚类性能和收敛速度,结合Canopy算法能够快速对数据进行粗聚类的优点,提出基于Canopy聚类与非局部空间信息的FCM图像分割改进算法(Canopy-NLWFLICM),可以在NLWFLICM算法聚类前,对聚类中心进行预处理,从而提高收敛速度和图像分割精度。 相似文献
17.
为了从具有运动物体前景的公路监控视频中提取出初始背景,提出一种基于模糊聚类识别的背景建模算法。利用模糊聚类识别方法从时间轴上总体呈多相似值分布的像素点中提取出背景子类,实现背景初始化。结果表明,该方法具有良好的适应性,能有效地对背景进行初始化,可以显著降低目前动态背景建模方法的计算量和内存需求量,易于在实时嵌入式系统上实现。 相似文献
18.
与传统的硬划分聚类相比,模糊聚类算法(以FCM为例)对数据的比例变化具有鲁棒性,能够更准确地反映数据点与类中心的实际关系,目前已得到广泛应用.然而对于时序基因表达数据来说,传统的聚类算法往往不能充分利用到数据中时间上的动态关联信息.因此可以在模糊聚类算法的基础上引入自回归(AR)模型,将时序基因表达数据作为一组时间序列进行动态的聚类分析.这样不仅可以充分利用到时序基因表达数据的内部自相关性,并且可以进一步利用隶属度函数对AR模型的预测过程进行模糊化调整,从而得到更为理想的聚类结果. 相似文献
19.
为解决在互联网文本信息爆炸性增长的前提下,在大规模文本数据中如何发现隐含的、有价值的潜在知识的问题,提出基于多层次文本聚类的文本知识挖掘方法,针对不同规模的文本数据进行不同粒度的聚类,实现不同层次知识的挖掘。针对最广义层次的文本知识挖掘可实现各主题事务划分,针对子级分类数据的文本知识挖掘可发现下一层次主题分类,针对自定义层次的文本知识挖掘可发现该事件中存在的具体细节。对诉求实际数据的分析结果表明,该方法可在所有诉求数据中挖掘出各种诉求主题,精确挖掘出其中的细节问题,为管理者提供数据和决策支持,提高服务效率。 相似文献
20.
提出了一种新的低信噪比红外序列图像多目标检测跟踪算法,该算法有机地结合了TBD检测算法与模糊聚类粒子滤波跟踪算法。首先通过多帧TBD处理后,检测出运动目标的初始位置、运动速度,然后在跟踪阶段采用粒子滤波算法估计目标运动状态,并在估计位置开一个跟踪窗进行检测、模糊聚类概率融合。对真实红外图像序列进行实验仿真,仿真结果验证了该算法具有良好的实时性与很高的精确性。 相似文献
|