基于数据抽取器的知识发现处理模型

提出了基于数据抽取器的知识发现模型。在模型中,将知识发现过程分成数据预处理、数据抽取、数据挖掘和结果分析四个阶段。该模型利用标准的SQL语言构造数据抽取器,为不同的学习算法准备数据,减少数据挖掘算法对数据库直接调用的次数,避免了直接对大型数据库的数据进行调用,使得对大型数据库进行快速数据挖掘成为可能。可以加快知识发现过程,提高数据挖掘效率,实现对于大型数据库的知识发现。最后设计了SQL-C4．5算法,该算法实现了利用数据抽取器为决策树算法C4．5抽取必要的统计数据,实现了C4．5决策树的构建。     

旅游信息数据挖掘中数量型数据的转化和分析研究

数据挖掘就是从大量数据中,抽取隐含的、但又是潜在有用的关联信息和知识的发现过程。其中关联规则(AssociationRules)的挖掘是一个重要的问题,是大量数据中项集之间有趣的关联或相关联系。本文论述了如何改进关联规则算法,使之可以挖掘数量型数据,并利用改进的关联规则算法对游客数据进行数据挖掘,从而得到一些对旅游经营有用的知识。     

利用MLC++实现数据挖掘

数据挖掘是从大量原始数据中抽取隐藏知识的过程。大部分数据挖掘工具采用规则发现和决策树分类技术来发现数据模式和规则,其核心是归纳算法。与传统统计方法相比,基于机器学习技术得到的分类结果具有较好的可解释性。在针对特定的数据集进行数据挖掘时,如果缺乏相应的领域知识,用户或决策者就很难确定选择何种归纳算法。因此,需要尝试各种算法。借助MLC＋＋,决策者能够轻而易举地比较不同分类算法对特定数据集的有效性,从而选择合适的分类算法。同时,系统开发人员也可以利用MLC＋＋设计各种混合算法。     

数据挖掘在水文相似年查找中的应用研究

研究探索了包括目标理解、准备数据、数据预处理、建立模型、评估解释、知识应用等水文数据挖掘的六个过程。并采用公共的数据处理和挖掘算法,实现各过程之间数据无缝连接,形成了松散耦合的水文数据挖掘系统体系框架。在实施水文数据挖掘过程中,将数据挖掘的一些数据处理方式应用到了水文领域,同时也采用了水文领域中的一些数据处理技术,实现了数据挖掘领域与专业领域的数据处理和评价方式融合。通过选取江苏省国家水文数据库中的两个不同代表性区域的水文资料,严格按照水文数据挖掘的过程控制,以水文相似年查找为突破口,实施数据挖掘。在全方位地对结果分析、对比和评价后发现,以数据挖掘的方法,采用聚类分析中分层聚类的凝聚算法,进行水文相似年查找所发现的结果与水文领域专家知识基本相符。     

过程监控中数据挖掘与知识发现理论及应用

过程监控中数据挖掘和知识发现是近几年发展起来的新技术，目前仍处于起步阶段，显示了极大的应用前景。本文简要叙述了一般数据挖掘和知识发现的发展、现状及一般过程；从数据挖掘和知识发现方法、应用和理论技术三个方面概括了工业过程监控中的数据挖掘和知识发现；结合工业过程数据特点指出了过程监控数据挖掘和知识发现面临的挑战及今后的研究趋势。     

可视化驱动的交互式数据挖掘方法综述

数据挖掘是一种从大量数据中发现信息的过程,其大量依赖自动算法的特质,使得用户难以对数据和算法过程本身直观地进行理解、探索和优化.近年来,随着可视化领域的蓬勃发展,有很多工作开始探究如何使用可视化方法辅助数据挖掘过程,使用户更加直观地理解数据,并对数据和算法和进行探索.文中首先对数据挖掘和可视化在知识提取流程进行比较分析,并从可视化增强的通用数据挖掘方法和面向应用场景的方法 2个方面对近年相关技术进行梳理总结,并依托一些相关主题的国际会议内容指出需要进一步探索的方向.     

数据库中知识发现的处理过程模型的研究

1 前言数据库中的知识发现KDD(Knowledge Discov-ery in Database)是近年来随着数据库和人工智能技术的发展而出现的,它是从大量数据中提取出可信的、新颖的、有效的并能被人理解的模式的高级处理过程。它主要采用机器学习算法或统计方法进行知识学习,一般将KDD中进行知识学习的阶段称为数据挖掘(Data Mining)。数据挖掘是KDD中的一个非常重要的处理步骤。人们往往不加区分地使用两者。一般来说,在工程应用领域多称数据挖掘,而在研究领域人们则多称为数据库中的知识发现。人们进行的关于KDD的研究是为了将知识发现的研究成果应用于实际数据处理中,为科学的决策提供支持。正是因为这样,目前所进行的关于     

隐私保护数据挖掘*

隐私保护数据挖掘的目标是寻找一种数据集变换方法,使得敏感数据或敏感知识在实施数据挖掘的过程中不被发现。近年出现了大量相关算法,按照隐私保持技术可将它们分为基于启发式技术、基于安全多方技术和基于重构技术三种。结合目前研究的热点对关联规则和分类规则的隐私保护数据挖掘进行介绍,并给出算法的评估方法,最后提出了关联规则隐私保护数据挖掘未来研究工作的方向。     

大型事务数据库中的一种快速的规则挖掘算法

1 引言数据挖掘(Data Mining),也称为数据库中知识发现KDD,是指发掘隐藏在堆积如山的数据中的真知灼见,这基本上正在变成一种商业上非做不可的事情。关联规则(As-sociation Rules)是数据挖掘的重要研究内容,目前的绝大部分关联规则挖掘算法一般都分为两个阶段:①频繁项目集的发现;②规则的产生。算法的计算工作量主要集中在第一阶段上,因此,如何快速确定频繁项目集是算法效率的关键,在这方面已有许多工作与成果。但总的来讲,许多研究都是在Apriori算法或其派生算法的基础上进行的。这些算法或多或少存在如下两个问题:①算法必须耗费大量的时间处理规模巨大的候选项目集;②算法必须多次重复机械地扫描     

基于领域本体的数据挖掘服务发现算法

随着数据库的广泛应用,数据挖掘技术面临数据的海量化、分布化问题。采用面向服务的架构构造数据挖掘系统是解决该问题的方法之一。提出一种基于领域本体的数据挖掘服务发现算法,通过引入领域知识,定义数据挖掘本体,有效地解决了数据挖掘服务发现问题。首先给出了结合领域知识的数据挖掘服务发现框架,提出了数据挖掘方法本体和质量本体的定义,并给出了根据领域知识及用户需求进行数据挖掘服务发现的算法,为数据挖掘服务选择提供了较为完善的方案。     

Toward intelligent assistance for a data mining process: an ontology-based approach for cost-sensitive classification

A data mining (DM) process involves multiple stages. A simple, but typical, process might include preprocessing data, applying a data mining algorithm, and postprocessing the mining results. There are many possible choices for each stage, and only some combinations are valid. Because of the large space and nontrivial interactions, both novices and data mining specialists need assistance in composing and selecting DM processes. Extending notions developed for statistical expert systems we present a prototype intelligent discovery assistant (IDA), which provides users with 1) systematic enumerations of valid DM processes, in order that important, potentially fruitful options are not overlooked, and 2) effective rankings of these valid processes by different criteria, to facilitate the choice of DM processes to execute. We use the prototype to show that an IDA can indeed provide useful enumerations and effective rankings in the context of simple classification processes. We discuss how an IDA could be an important tool for knowledge sharing among a team of data miners. Finally, we illustrate the claims with a demonstration of cost-sensitive classification using a more complicated process and data from the 1998 KDDCUP competition.     

基于Agent技术的数据挖掘模型研究

传统的数据挖掘方法存在效率低和非智能化等不足,难以满足网络环境下对海量数据的挖掘需要。文中从数据挖掘技术与Agent技术的特征出发,论述了两者结合的优势,将Agent技术应用到数据挖掘中,提出了基于Agent的数据挖掘模型,并阐述了该模型的组织结构。该模型能够降低问题的复杂性,减少人工的参与,在很大程度上提高了数据挖掘的智能性和高效性。     

基于Agent技术的数据挖掘模型研究

传统的数据挖掘方法存在效率低和非智能化等不足,难以满足网络环境下对海量数据的挖掘需要。文中从数据挖掘技术与Agent技术的特征出发,论述了两者结合的优势,将Agent技术应用到数据挖掘中,提出了基于Agent的数据挖掘模型,并阐述了该模型的组织结构。该模型能够降低问题的复杂性,减少人工的参与,在很大程度上提高了数据挖掘的智能性和高效性。     

采用限制与多维技术的数据采掘

针对当今数据采掘中效率不够高的问题，提出了采用限制与多维技术来进行数据采掘，讨论了哪些种类的限制能运用到采掘过程中，设计了一个数据采掘系统结构。     

Mining fuzzy sequential patterns from quantitative transactions

Many researchers in database and machine learning fields are primarily interested in data mining because it offers opportunities to discover useful information and important relevant patterns in large databases. Most previous studies have shown how binary valued transaction data may be handled. Transaction data in real-world applications usually consist of quantitative values, so designing a sophisticated data-mining algorithm able to deal with various types of data presents a challenge to workers in this research field. In the past, we proposed a fuzzy data-mining algorithm to find association rules. Since sequential patterns are also very important for real-world applications, this paper thus focuses on finding fuzzy sequential patterns from quantitative data. A new mining algorithm is proposed, which integrates the fuzzy-set concepts and the AprioriAll algorithm. It first transforms quantitative values in transactions into linguistic terms, then filters them to find sequential patterns by modifying the AprioriAll mining algorithm. Each quantitative item uses only the linguistic term with the maximum cardinality in later mining processes, thus making the number of fuzzy regions to be processed the same as the number of the original items. The patterns mined out thus exhibit the sequential quantitative regularity in databases and can be used to provide some suggestions to appropriate supervisors.     

Optimization of Temporal Processes: A Model Predictive Control Approach

A dynamic predictive-control model of a nonlinear and temporal process is considered. Evolutionary computation and data mining algorithms are integrated for solving the model. Data-mining algorithms learn dynamic equations from process data. Evolutionary algorithms are then applied to solve the optimization problem guided by the knowledge extracted by data-mining algorithms. Several properties of the optimization model are shown in detail, in particular, a selection of regressors, time delays, prediction and control horizons, and weights. The concepts proposed in this paper are illustrated with an industrial case study in combustion process.     

Toward databases mining: Pre-processing collected data

This paper presents a new means of selecting quality data for mining multiple data sources. Traditional data-mining strategies obtain necessary data from internal and external data sources and pool all the data into a huge homogeneous dataset for discovery. In contrast, our data-mining strategy identifies quality data from (internal and external) data sources for a mining task. A framework is advocated for generating quality data. Experimental results demonstrate that application of this new data collecting technique can not only identify quality data, but can also efficiently reduce the amount of data that must be considered during mining.     

基于网格的物流资源挖掘模型的研究

分布在因特网上的物流资源具有地理分散和职权自治的特性,资源结构和接口难以统一。该文以网格、Agent和增量挖掘技术为基础,提出了不通过资源整合就能够实现全局信息挖掘的方法。分析了基于Web的物流资源网格系统,将其划分为物流域的集合实施分级管理。提出了新的面向网格的信息挖掘模型并设计了域内动态资源挖掘算法和域间请求式资源挖掘算法。该模型解决了不同物流系统之间的信息挖掘难题,算法中引入的增量挖掘技术提高了域间资源挖掘效率。     

Constraint-based, multidimensional data mining

Although many data-mining methodologies and systems have been developed in recent years, the authors contend that by and large, present mining models lack human involvement, particularly in the form of guidance and user control. They believe that data mining is most effective when the computer does what it does best-like searching large databases or counting-and users do what they do best, like specifying the current mining session's focus. This division of labor is best achieved through constraint-based mining, in which the user provides restraints that guide a search. Mining can also be improved by employing a multidimensional, hierarchical view of the data. Current data warehouse systems have provided a fertile ground for systematic development of this multidimensional mining. Together, constraint-based and multidimensional techniques can provide a more ad hoc, query-driven process that effectively exploits the semantics of data than those supported by current standalone data-mining systems     

Pattern discovery: A progressive visual analytic design to support categorical data analysis

When using data-mining tools to analyze big data, users often need tools to support the understanding of individual data attributes and control the analysis progress. This requires the integration of data-mining algorithms with interactive tools to manipulate data and analytical process. This is where visual analytics can help. More than simple visualization of a dataset or some computation results, visual analytics provides users an environment to iteratively explore different inputs or parameters and see the corresponding results. In this research, we explore a design of progressive visual analytics to support the analysis of categorical data with a data-mining algorithm, Apriori. Our study focuses on executing data mining techniques step-by-step and showing intermediate result at every stage to facilitate sense-making. Our design, called Pattern Discovery Tool, targets for a medical dataset. Starting with visualization of data properties and immediate feedback of users’ inputs or adjustments, Pattern Discovery Tool could help users detect interesting patterns and factors effectively and efficiently. Afterward, further analyses such as statistical methods could be conducted to test those possible theories.