入侵检测中的模糊数据挖掘技术

本文论述了模糊数据挖掘技术在入侵检测中的应用，详细描述了利用审计数据挖掘模糊相联规则的算法，给出了相联规则集合相似度的函数，最后给出了利用它进行异常检测的简单的试验结果，结果表明利用模糊数据挖掘可以识别系统的异常行为。     

基于数据挖掘的煤矿安全信息管理模型的研究

基于对数据挖掘技术、粗糙集理论、模糊逻辑与神经网络算法的分析,文章提出了一种基于数据挖掘的煤矿安全信息管理模型的设计方案。该模型应用Web服务器注册技术和XML数据合成技术形成终端数据库,采用数据挖掘技术中的粗糙集理论和模糊逻辑与神经网络算法形成终端数据仓库,并对终端数据仓库进行统一分析、管理和维护,有效地提高了煤矿安全信息管理的效率。     

模糊数据挖掘

本文在数据库中知识发现（KDD）和数据挖掘（DM）技术的基础上,提出了模糊数据库中知识发现（KDFD）和模糊数据挖掘（FDM）的概念与技术,并给出FDM的算法,它能有效地挖掘出模糊数据库中潜在的有价值的知识。本文具体讨论了模糊关联规则及模糊数据依赖的挖掘。     

数据挖掘技术在民航CRM中的应用

进行客户关系管理系统建设,是当今各大航空公司争取竞争优势的重要手段。数据挖掘技术在CRM的实施中起着关键的作用。文章分别介绍了数据挖掘技术和CRM技术,具体介绍了在民航CRM建设中用到的决策树方法和模糊聚类方法这两种数据挖掘方法,并作了实验分析。最后对数据挖掘技术在民航中的应用作了展望。     

基于模糊聚类的水文元数据挖掘算法研究

本文提出面向动态库容演算系统海量数据的基于模糊聚类的水文数据挖掘算法。通过基于模糊K聚类（FCM）的元数据挖掘技术,有效的完成了海量水文数据规范化后的语义学的归并和整合问题,为元数据的进一步利用奠定了基础。     

数据挖掘在Web日志分析中的应用

首先对Web日志数据挖掘技术进行了详细的叙述,然后深入研究了数据挖掘中的模糊FCM算法,基于其缺点提出了一种改进的模糊均值聚类算法.并验证改进的FCM算法是有效并且是高效的.最后运用改进的FCM算法进行Web日志挖掘分析.     

基于数据挖掘的CRM分析

进行客户关系管理系统建设,是企业争取竞争优势的重要手段,数据挖掘技术在CRM的实施中起着关键的作用。文章介绍了数据挖掘技术和CRM技术,具体介绍了在酒店CRM建设中用到的决策树和模糊聚类这两种数据挖掘的实现方法,并做出了实验分析。     

数据挖掘技术在入侵检测中的应用

数据挖掘技术已在误用检测和异常检测中得到应用。论文介绍了数据挖掘在入侵检测系统研究中的一些关键的技术问题,包括规则挖掘算法、属性集的选择和精简、模糊数据挖掘等。最后深入讨论了入侵检测系统的自适应问题,并提出了相应的解决方法。     

基于模糊数据挖掘和遗传算法的网络入侵检测技术

文章通过开发一套新的网络入侵检测系统来证实应用模糊逻辑和遗传算法的数据挖掘技术的有效性;这个系统联合了基于模糊数据挖掘技术的异常检测和基于专家系统的滥用检测,在开发异常检测的部分时,利用模糊数据挖掘技术来从正常的行为存储模式中寻找差异,遗传算法用来调整模糊隶属函数和选择一个合适的特征集合,滥用检测部分用于寻找先前行为描述模式,这种模式很可能预示着入侵,网络的通信量和系统的审计数据被用做两个元件的输入;此系统的系统结构既支持异常检测又支持滥用检测、既适用于个人工作站又可以适用于复杂网络。     

浅析数据挖掘的主要方法和研究方向

随着大型数据库的不断涌现,如何从浩如烟海的数据中发现隐藏的有用知识,成为一个迫切需要研究的课题.因此,知识发现和数据挖掘应运而生.该文提出了数据挖掘的基本概念,数据挖掘是数据库技术、人工智能、机器学习、统计分析、模糊逻辑、模式识别和人工神经网络等多个学科相结合的产物,然后分析了数据挖掘一般算法的结构,并且对数据挖掘技术进行了详细分类,主要包括决策树技术、神经网络技术、粗集以及模糊集等十多项挖掘技术.最后讨论了数据挖掘在人工智能、电子商务应用和移动通信计算等方面的研究方向.     

模糊关联规则的数据挖掘

1 引言关联规则是指包含了一组对象间特定关联关系的规则。由于关联规则的挖掘有着广阔的应用背景,因此,人们对关联规则的挖掘算法作了大量的研究。从离散的布尔型变量、枚举型变量分析到连续的数值型变量分析;从平面的单事务项内部关系的分析到立体N维的多事务项之间关系的分析;从集中式的整体的静     

模糊数据挖掘和遗传算法在入侵检测中的应用

论述了数据挖掘和遗传算法在入侵检测中的应用，详细描述了模糊关联规则和模糊频繁序列挖掘，并进一步介绍了如何采用遗传算法优化模糊集合隶属函数，从而达到改善入侵检测系统性能的目的。     

Fuzzy utility mining with upper-bound measure

Fuzzy utility mining has been an emerging research issue because of its simplicity and comprehensibility. Different from traditional fuzzy data mining, fuzzy utility mining considers not only quantities of items in transactions but also their profits for deriving high fuzzy utility itemsets. In this paper, we introduce a new fuzzy utility measure with the fuzzy minimum operator to evaluate the fuzzy utilities of itemsets. Besides, an effective fuzzy utility upper-bound model based on the proposed measure is designed to provide the downward-closure property in fuzzy sets, thus reducing the search space of finding high fuzzy utility itemsets. A two-phase fuzzy utility mining algorithm, named TPFU, is also proposed and described for solving the problem of fuzzy utility mining. At last, the experimental results on both synthetic and real datasets show that the proposed algorithm has good performance.     

Online mining of fuzzy multidimensional weighted association rules

This paper addresses the integration of fuzziness with On-Line Analytical Processing (OLAP) based association rules mining. It contributes to the ongoing research on multidimensional online association rules mining by proposing a general architecture that utilizes a fuzzy data cube for knowledge discovery. A data cube is mainly constructed to provide users with the flexibility to view data from different perspectives as some dimensions of the cube contain multiple levels of abstraction. The first step of the process described in this paper involves introducing fuzzy data cube as a remedy to the problem of handling quantitative values of dimensional attributes in a cube. This facilitates the online mining of fuzzy association rules at different levels within the constructed fuzzy data cube. Then, we investigate combining the concepts of weight and multiple-level to mine fuzzy weighted multi-cross-level association rules from the constructed fuzzy data cube. For this purpose, three different methods are introduced for single dimension, multidimensional and hybrid (integrates the other two methods) fuzzy weighted association rules mining. Each of the three methods utilizes a fuzzy data cube constructed to suite the particular method. To the best of our knowledge, this is the first effort in this direction. We compared the proposed approach to an existing approach that does not utilize fuzziness. Experimental results obtained for each of the three methods on a synthetic dataset and on the adult data of the United States census in year 2000 demonstrate the effectiveness and applicability of the proposed fuzzy OLAP based mining approach. OLAP is one of the most popular tools for on-line, fast and effective multidimensional data analysis. In the OLAP framework, data is mainly stored in data hypercubes (simply called cubes).     

基于线性链表的模糊关联规则挖掘

为改进现有模糊关联规则挖掘算法的不足,提出了一种基于线性链表的模糊关联规则挖掘算法。算法利用线性链表只存储有用的事务数据库信息,并不断利用前期的运算结果对之进行简化,减少了数据的存储开销及扫描时间,降低了算法的时间复杂度,提高了算法的效率。比较分析以及实验表明,该算法对于挖掘模糊关联规则是快速而有效的。     

Mining fuzzy association rules from questionnaire data

Association rule mining is one of most popular data analysis methods that can discover associations within data. Association rule mining algorithms have been applied to various datasets, due to their practical usefulness. Little attention has been paid, however, on how to apply the association mining techniques to analyze questionnaire data. Therefore, this paper first identifies the various data types that may appear in a questionnaire. Then, we introduce the questionnaire data mining problem and define the rule patterns that can be mined from questionnaire data. A unified approach is developed based on fuzzy techniques so that all different data types can be handled in a uniform manner. After that, an algorithm is developed to discover fuzzy association rules from the questionnaire dataset. Finally, we evaluate the performance of the proposed algorithm, and the results indicate that our method is capable of finding interesting association rules that would have never been found by previous mining algorithms.     

模糊空间的colocation模式挖掘研究

近年来空间colocation模式挖掘由传统数据扩展到了不确定数据、模糊数据领域,但在模糊数据层面上,只有少量关于对象模糊的研究,而对于模糊空间这一论域的研究还是空白。基于经典的colocation模式挖掘的理论,针对性地提出了面向模糊空间的colocation模式挖掘及相关定义,增加了模糊数据领域内研究的深度和广度,并根据模糊数学理论结合空间colocation挖掘的特点,在模糊距离隶属度函数未知的情况下建立了具有较好适用性的FS基本算法。该算法一改以往在经典数据集上需要验证”团实例”的复杂做法,大大提高了算法性能。在已知模糊距离隶属度函数时,给出一个同时适用于经典数据以及模糊数据的增加数据完整性的通用方法;引进模糊方位,给出完全有别于以往的FS补充算法,增加了数据的完整性,并能实现模糊数据空间向经典数据空间的转换。     

Application of self-organising maps for data mining with incomplete data sets

Self-organising maps (SOM) have become a commonly-used cluster analysis technique in data mining. However, SOM are not able to process incomplete data. To build more capability of data mining for SOM, this study proposes an SOM-based fuzzy map model for data mining with incomplete data sets. Using this model, incomplete data are translated into fuzzy data, and are used to generate fuzzy observations. These fuzzy observations, along with observations without missing values, are then used to train the SOM to generate fuzzy maps. Compared with the standard SOM approach, fuzzy maps generated by the proposed method can provide more information for knowledge discovery.