应用模糊本体的广义关联规则挖掘算法

模糊集与本体结合的数据挖掘方法得到了广泛的关注。为了丰富数据挖掘效果以及数据挖掘得出的规则的完整性,本文在模糊本体的挖掘算法基础上,提出了模糊本体中叶子结点的相似度定义以及不同语义层次所含项目集的数目定义多重最小支持度,提出了基于模糊本体的广义关联规则算法。对比实验证明,基于模糊本体的广义关联规则算法的挖掘具有更强的可读性,获得的语义关联规则更加丰富,促进了在广义关联规则挖掘过程中使概念泛化更加合理,提高了算法效率。     

基于前缀广义链表的快速关联规则挖掘算法

挖掘关联规别是数据挖掘研究的一个重要方面，而如何快速有效地挖掘出关联规则是当前研究的热点．本文提出了一种前缀广义链表，并应用此结构进行关联规则的挖掘，得到了一种快速的关联规则发现算法、该算法不仅方便、效率高，而且避免了产生组合爆炸问题．     

基于关联规则挖掘的weka数据挖掘应用

关联规则挖掘作为数据挖掘的一个重要方法,在许多数据挖掘领域得到应用。本文阐述了关联规则挖掘以及其关键算法,并针对具体的实例,描述了数据挖掘工具weka挖掘关联规则的过程。     

几种典型关联规则算法的分析与比较

数据挖掘是目前比较热门的一个研究领域,而关联规则的挖掘又是数据挖掘的一个重要课题。首先介绍关联规则的基本概念和它的挖掘过程,然后就几种典型的关联规则算法进行概括并对它们进行分析和性能的比较,对关联规则挖掘应用的现状进行总结。     

几种典型关联规则算法的分析与比较

数据挖掘是目前比较热门的一个研究领域,而关联规则的挖掘又是数据挖掘的一个重要课题。首先介绍关联规则的基本概念和它的挖掘过程,然后就几种典型的关联规则算法进行概括并对它们进行分析和性能的比较．对关联规则挖掘应用的现状进行总结。     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

关联规则挖掘方法研究

关联规则是数据挖掘研究的一个重要分支。阐述了关联规则的基本概念、关联规则挖掘的基本模型;详细分析了关联规则挖掘的经典算法-Apriori算法,Apriori算法核心思想、性能分析及其改进技术。     

关联规则挖掘算法在高校专业课设置中的应用

关联规则是一个应用广泛的数据挖掘算法,本文介绍了关联规则算法的工作原理,如何配置关联规则算法的参数及建立挖掘模型.结合一个高职院校的实例,对关联规则挖掘算法在专业课设置中的应用进行了研究,并对挖掘得到的结果进行了具体分析.     

关系数据库中的模糊关联规则挖掘算法研究

关联是数据挖掘领域的一个重要研究课题。对模糊关联规则挖掘进行了研究,针对普通关联规则不能精确表达数据库中模糊信息关联性的问题,提出了一种新的模糊关联规则挖掘算法FARM_New,结果表明算法是有效的,提高了模糊挖掘的速度。     

Visual data mining modeling techniques for the visualization of mining outcomes

The visual senses for humans have a unique status, offering a very broadband channel for information flow. Visual approaches to analysis and mining attempt to take advantage of our abilities to perceive pattern and structure in visual form and to make sense of, or interpret, what we see. Visual Data Mining techniques have proven to be of high value in exploratory data analysis and they also have a high potential for mining large databases. In this work, we try to investigate and expand the area of visual data mining by proposing new visual data mining techniques for the visualization of mining outcomes.     

Applications of association rule mining in health informatics: a survey

Association rule mining is an effective data mining technique which has been used widely in health informatics research right from its introduction. Since health informatics has received a lot of attention from researchers in last decade, and it has developed various sub-domains, so it is interesting as well as essential to review state of the art health informatics research. As knowledge discovery researchers and practitioners have applied an array of data mining techniques for knowledge extraction from health data, so the application of association rule mining techniques to health informatics domain has been focused and studied in detail in this survey. Through critical analysis of applications of association rule mining literature for health informatics from 2005 to 2014, it has been explored that, instead of the more efficient alternative approaches, the Apriori algorithm is still a widely used frequent itemset generation technique for application of association rule mining for health informatics. Moreover, other limitations related to applications of association rule mining for health informatics have also been identified and recommendations have been made to mitigate those limitations. Furthermore, the algorithms and tools utilized for application of association rule mining have also been identified, conclusions have been drawn from the literature surveyed, and future research directions have been presented.     

一种基于Web Service技术的数据挖掘系统

开放式的数据挖掘系统是当前挖掘系统发展的方向之一。提出了一种基于Web Services的数据挖掘系统,在对该系统进行详细分析的基础上给出了一个应用实例,由于Web Services具有较强的封装性,且接口简单,使得数据挖掘系统的集成更加灵活,大大提升了挖掘系统的性能。     

Efficient prime-based method for interactive mining of frequent patterns

Over the past decade, an increasing number of efficient algorithms have been proposed to mine frequent patterns by satisfying the minimum support threshold. Generally, determining an appropriate value for minimum support threshold is extremely difficult. This is because the appropriate value depends on the type of application and expectation of the user. Moreover, in some real-time applications such as web mining and e-business, finding new correlations between patterns by changing the minimum support threshold is needed. Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. Recently, a few efficient interactive mining algorithms have been proposed, which are able to capture the content of transaction database to eliminate possibility of the database rescanning. In this paper, we propose a new method based on prime number and its characteristics mainly for interactive mining of frequent patterns. Our method isolates the mining model from the mining process such that once the mining model is constructed; it can be frequently used by mining process with various minimum support thresholds. During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. The experimental results verify the efficiency of our method for interactive mining of frequent patterns.     

一种挖掘压缩序列模式的有效算法

从序列数据库中挖掘频繁序列模式是数据挖掘领域的一个中心研究主题,而且该领域已经提出和研究了各种有效的序列模式挖掘算法.由于在挖掘过程中会产生大量的频繁序列模式,最近许多研究者已经不再聚焦于序列模式挖掘算法的效率,而更关注于如何让用户更容易地理解序列模式的结果集.受压缩频繁项集思想的启发,提出了一种CFSP(compressing frequent sequential patterns)算法,其可挖掘出少量有代表性的序列模式来表达全部频繁序列模式的信息,并且清除了大量的冗余序列模式.CFSP是一种two-steps的算法:在第1步,其获得了全部闭序列模式作为有代表性序列模式的候选集,与此同时还得到大多数的有代表性模式;在第2步,该算法只花费了少量的时间去发现剩余的有代表性序列模式.一个采用真实数据集与模拟数据集的实验研究也证明了CFSP算法具有高效性.     

数据挖掘的应用和发展趋势叶磊

由于数据挖掘在各行业中的广泛应用,因而该技术引起了人们的普遍关注,近年来该技术在金融、电信、零售、医疗、科研等行业领域内发挥了巨大的作用。网站的数据挖掘(Websitedatamining)即Web挖掘、生物信息或基因的数据挖掘以及空间数据挖掘成为数据挖掘领域新的研究热点。     

WinRAR使用技巧四则

WinRAR是Windows上常用的压缩解压缩工具。由于它支持包括ZIP在内的多种压缩格式．且压缩速度较快压缩率较高，故现在已成为Windows上非常流行的压缩软件。下面是笔者在使用中总结的一些经验．在这里共享出来．希望能对你使用这个软件有所帮助。     

神经网络在数据挖掘中的应用研究

针对神经网络在社保数据挖掘项目中对数据预处理的具体应用,讨论了神经网络在数据挖掘中的作用。尽管神经网络具有结构复杂、网络训练时间长、结果表示不容易理解等不利之处,但其错误率低的优点是其它方法所不及的,并在数据挖掘采用的方法中具有其优势。     

Sliding window based weighted maximal frequent pattern mining over data streams

As data have been accumulated more quickly in recent years, corresponding databases have also become huger, and thus, general frequent pattern mining methods have been faced with limitations that do not appropriately respond to the massive data. To overcome this problem, data mining researchers have studied methods which can conduct more efficient and immediate mining tasks by scanning databases only once. Thereafter, the sliding window model, which can perform mining operations focusing on recently accumulated parts over data streams, was proposed, and a variety of mining approaches related to this have been suggested. However, it is hard to mine all of the frequent patterns in the data stream environment since generated patterns are remarkably increased as data streams are continuously extended. Thus, methods for efficiently compressing generated patterns are needed in order to solve that problem. In addition, since not only support conditions but also weight constraints expressing items’ importance are one of the important factors in the pattern mining, we need to consider them in mining process. Motivated by these issues, we propose a novel algorithm, weighted maximal frequent pattern mining over data streams based on sliding window model (WMFP-SW) to obtain weighted maximal frequent patterns reflecting recent information over data streams. Performance experiments report that MWFP-SW outperforms previous algorithms in terms of runtime, memory usage, and scalability.     

From sequential pattern mining to structured pattern mining: A pattern-growth approach

Sequential pattern mining is an important data mining problem with broad applications. However,it is also a challenging problem since the mining may have to generate or examine a combinatorially explosivenumber of intermediate subsequences. Recent studies have developed two major classes of sequential patternmining methods: (1) a candidate generation-and-test approach, represented by (i) GSP, a horizontal format-basedsequential pattern mining method, and (ii) SPADE, a vertical format-based method; and (2) a pattern-growthmethod, represented by PrefixSpan and its further extensions, such as gSpan for mining structured patterns. In this study, we perform a systematic introduction and presentation of the pattern-growth methodologyand study its principles and extensions. We first introduce two interesting pattern-growth algorithms, FreeSpanand PrefixSpan, for efficient sequential pattern mining. Then we introduce gSpan for mining structured patternsusing the same methodology. Their relative performance in l