Web数据挖掘与挖掘算法探讨

本文介绍了Web数据挖掘的概念及其分类,并对Web数据挖掘技术的研究进行概述。利用Apriori算法发现频繁集,找到页面间的关联规则。针对网页超链接结构的特点：一条超链接只能建立在两个网页上,发现频繁集只要找出所有2-项集即可,从而提出网页超链接挖掘的NApriori算法。NApriori算法显著提高了Apriori算法的效率。     

一种适用于Web日志挖掘的关联规则发现算法

Apriori算法是一种经典的关联规则发现算法。针对Web日志挖掘的特点,在Apriori算法基础上给出一种适用于动态事务数据库挖掘的关联规则发现算法,并对比该算法与Apriori算法的区别。将该算法应用到网站的日志挖掘中,实验证明该算法的性能较原算法有一定的提高。     

基于关联规则的Web日志数据分析系统

本文旨在研究基于Web环境下利用关联规则对Web日志挖掘的数据分析系统。把关联规则的概念引入到Web日志挖掘中,将用户的访问路径以关联规则的形式表现出来,其目的在于从用户访问超文本系统的行为中发现用户的访问模式。然后在Apriori挖掘算法思想的基础上,对其改造,给出了适合挖掘用户访问频繁路径的类Apriori算法。最后设计开发了一个Web日志数据分析系统。此系统主要包含三个功能模块:数据预处理模块、智能分析模块和基本分析模块     

一种提高Apriori算法效率的方法

Apriori算法是关联规则挖掘中的经典算法。在Apriori算法中，需要大量进行两个操作：判断两个k-项集是否前k-1项相同且最后一项不同；判断一个项集是否为另一个项集的子集。利用Apriori算法中项集之间都是有序的这一特点可以减少以上两个操作的执行次数，从而达到对Apriori算法进行优化的目的。实验结果表明，经过优化了的Apriori算法在运行效率上有一定的提高。     

基于关联规则的Web日志数据分析系统

本文旨在研究基于Web环境下利用关联规则对Web日志挖掘的数据分析系统。把关联规则的概念引入到web日志挖掘中,将用户的访问路径以关联规则的形式表现出来,其目的在于从用户访问超文本系统的行为中发现用户的访问模式。然后在砷riori挖掘算法思想的基础上,对其改造,给出了适合挖掘用户访问频繁路径的类Apriori算法。最后设计开发了一个Web日志数据分析系统。此系统主要包含三个功能模块：数据预处理模块、智能分析模块和基本分析模块     

挖掘关联规则中Apriori算法的改进

本文基于对挖掘关联规则中Apriori算法的研究，给出两种改进的算法。     

数据挖掘技术及其在旅游线路规划系统的应用

研究了旅游线路规划的现状,介绍了在旅游线路规划中使用的方法,引入了关联规则挖掘的基本概念,以及分析了其主要过程.并通过分析关联规则挖掘中的Apriori算法及其改进算法的基础上,提出了一种将Apriori改进算法与旅游线路规划挖掘结合的概念,通过与Apriori算法相比较,提高了系统的效率,并给出了一种典型应用,获得了较理想的应用效果.最后结合当前的旅游网站特点,充分应用网站的信息,设计了一个旅游线路规划的挖掘系统.     

基于VC 的Apriori规则算法的优化实现

关联规则算法是数据挖掘的核心。本文首先介绍了关联规则的定义,接着在现有Apriori算法的基础上分析了存在的不足,并提出了一个关联规则算法的改进模式,从而提高Apriori算法的效率。     

数据挖掘技术及其在旅游线路规划系统的应用

研究了旅游线路规划的现状．介绍了在旅游线路规划中使用的方法,引入了关联规则挖掘的基本概念,以及分析了其主要过程。并通过分析关联规则挖掘中的Apriori算法及其改进算法的基础上,提出了一种将Apriori改进算法与旅游线路规划挖掘结合的概念,通过与Apriori算法相比较,提高了系统的效率,并给出了一种典型应用,获得了较理想的应用效果。最后结合当前的旅游网站特点,充分应用网站的信息,设计了一个旅游线路规划的挖掘系统。     

挖掘关联规则中的一种优化的Apriori算法

对文献[1]中给出的算法以及Apriori算法的思想和性能进行了分析，提出一种优化的Apriori算法。该算法较文献[1]的算法更优.     

Effective solution of certain problems of theory of schedulings of nets

Cybernetics and Systems Analysis -     

Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities

The paper presents a general approach to the evaluation of the complexity of classes of algorithms, so-called pVCD-method. To develop this method, all the examined families of models of empiric generalization were restricted to classes implementable on computers and, wider, by examining their partially recursive representations. Within the framework of the algorithmic approach, the concept of Kolmogorov’ complexity of algorithms for the recognition of properties or the extraction of regularities is proposed. The method proposed to evaluate the nonrandomness of the extraction of empirical regularities is based on this concept.     

Analysis of microdensitometric data in terms of probability of cleavage of DNA

Computer-aided analysis of autoradiographic films of DNA fragments is presented. The Powell least-squares procedure is used for optimization of parameters for components of complex densitometric curves. Since each densitometric spectrum may be divided for several non-overlapped blocks of bands, there is no upper limit on the number of parameters which must be optimized. Eight shapes for the component bands are utilized: symmetric and asymmetric Gauss and Cauchy functions, direct, symmetric and asymmetric product of Gauss function and inverse of Cauchy function, and log-normal function. The probability of DNA cleavage is calculated with correction for multiple cuts. The methods presented was applied to detailed analysis of densitometric spectra of a 21-bp DNA restriction fragment and allowed for direct correlation between structural microheterogeneity of DNA and the resulting cutting pattern. This method should facilitate the analysis of densitometric data from antibiotic-induced cleavage of DNA and footprinting experiments.     

联合收割机脱粒滚筒恒速智能控制器设计

研究了轴流式联合收割机的控制问题,给出了联合收割机脱粒滚筒的数学模型,介绍了基于模式识别的智能控制原理,建立了联合收割机脱粒滚筒恒速控制模型,设计了基于模式识别的智能恒速控制器.应用Matlab/Simulink进行了控制器仿真,其结果表明,将基于模式识别的智能控制应用于联合收割机脱粒滚筒的恒速控制,其过渡过程平稳、响应速度快、无超调、无振荡并且无稳态误差.     

An estimate of numbers of terms of semicycles of delay difference equations

In this paper, we study the semicycles of oscillatory solutions of the delay difference equation y_n+1 − y_n + p_ny_n-k = 0, where p_n is a sequence of nonnegative real numbers and k is a positive integer. Upper bound of numbers of terms of semicycles are determined in the case when

Our results improve and complement known results in literature.     

Complexity of approximation of 3-edge-coloring of graphs

The problem to find a 4-edge-coloring of a 3-regular graph is solvable in polynomial time but an analogous problem for 3-edge-coloring is NP-hard. To make the gap more precise, we study complexity of approximation algorithms for invariants measuring how far is a 3-regular graph from having a 3-edge-coloring. We show that it is an NP-hard problem to approximate such invariants with an error O(n1−ε), where n denotes the order of the graph and 0<ε<1 is a constant.     

Modifications of the method of variation of parameters

In spite of being a classical method for solving differential equations, the method of variation of parameters continues having a great interest in theoretical and practical applications, as in astrodynamics. In this paper we analyse this method providing some modifications and generalised theoretical results. Finally, we present an application to the determination of the ephemeris of an artificial satellite, showing the benefits of the method of variation of parameters for this kind of problems.     

计算机辅助课表编排技术的研究

讨论了几种实用的计算机辅助课表编排技术及在实际编排中的应用。应用分析表明，采用分批与或图搜索和分批优化的匈牙利算法相结合的方法，在计算机辅助课表编排中是行之有效的。