基于Web数据挖掘的个性化搜索引擎研究综述

Web数据挖掘是将教据挖掘技术和理论应用于对WWW资源进行挖掘的一个新兴的研究领域.论述Web数据挖掘的发展现状、发展趋势以及将来可能的研究方向,并简单介绍个性化搜索引擎的一些情况,论述web教据挖掘在个性化搜索引擎中的应用.     

基于SPRINT分类算法进行医学预后分析的研究与应用

SPRINT算法是一种具有良好扩展性且能实现并行处理的数据分类方法,可以方便地从算法生成的决策树提取规则.在使用海量医学数据库进行预后分析中,它是值得推荐的一种研究方法.对该算法进行了深入研究,并在预后分析中进行了应用,对于类似医学信息处理有启发意义.     

时间序列相似性度量在水文数据挖掘中的应用研究

相似性度量方法是时间序列相似性研究的重要课题,同时也是水文时间序列相似性挖掘的关键问题之一.充分分析目前相似性度量的研究成果,结合水文时间序列相似性挖掘模型,通过实验探索适合水文数据特点的相似性度量方法.     

基于二进制表示的频繁项集挖掘算法

发现频繁项集是关联规则挖掘中最基本、最重要的问题.提出了一种基于二进制表示的频繁项集挖掘算法,并利用二进制的性质快速产生候选项集并计算其支持度.算法总体性能在一定程度上得到了提高.     

基于Web挖掘的高校德育管理决策系统的设计

随着数据挖掘技术的不断发展,Web挖掘技术已经在社会上得到了广泛运用,但将此技术运用到高校德育管理决策中还比较少.基于远程教育技术和传统的德育管理手段,运用Web挖掘技术动态追踪学生历程信息,利用关联规则算法,提出高校德育管理决策系统的结构模型及其解决方案.     

异构电子商务集成平台的本体模型构建

针对电子商务数据异构的特点,研究用本体技术实现异构电子商务的集成平台.通过不同电子商务本体特征的挖掘和抽取,提出异构电子商务集成平台的本体模型构建方法.实现电子商务本体协同的"即插即用"互操作集成模型.     

PPDM中面向k-匿名的MI Loss评估模型

隐私保护数据挖掘（PPDM）利用匿名化等方法使数据所有者在不泄露隐私信息的前提下,安全发布在数据挖掘中有效可用的数据集。k-匿名算法作为PPDM研究使用最广泛的算法之一,具有计算开销低、数据形变小、能抵御链接攻击等优点,但是在一些k-匿名算法研究中使用的数据可用性评估模型的权重设置不合理,导致算法选择的最优匿名数据集在后续的分类问题中分类准确率较低。提出一种使用互信息计算权重的互信息损失（MI Loss）评估模型。互信息反映变量间的关联关系,MI Loss评估模型根据准标识符和标签之间的互信息计算权重,并通过Loss公式得到各个准标识符的信息损失,将加权后的准标识符信息损失的和作为数据集的信息损失,以弥补评估模型的缺陷。实验结果证明,运用MI Loss评估模型指导k-匿名算法能够明显降低匿名数据集在后续分类中的可用性丢失,相较于Loss模型和Entropy Loss模型,该模型分类准确率提升了0.73%~3.00%。     

Reducing control selection errors associated with underground bolting equipment

Selecting the incorrect control during the operation of underground bolting and drilling equipment causes serious injuries. Shape coding and the layout of dual control banks are two aspects of control design which require further examination. The aims of this research were: (i) to determine whether arbitrary shape coding was effective in reducing selection error rates in a virtual analogy of roof-bolting; and (ii) to determine whether any advantages exist for mirror or place layouts for dual control situations in this situation. Two experiments were conducted to address these questions. No benefits of arbitrary shape coding were evident while control location remained constant. When control location was altered, shape coding did provide a significant reduction in selection error rate. No differences between mirror or place arrangements were detected and this question remains open.     

Sleep in a live-in mining operation: The influence of start times and restricted non-work activities

The amount of sleep obtained between shifts is influenced by numerous factors including the length of work and rest periods, the timing of the rest period relative to the endogenous circadian cycle and personal choices about the use of non-work time. The current study utilised a real-world live-in mining environment to examine the amount of sleep obtained when access to normal domestic, family and social activities was restricted. Participants were 29 mining operators (26 male, average age 37.4 ± 6.8 years) who recorded sleep, work and fatigue information and wore an activity monitor for a cycle of seven day shifts and seven night shifts (both 12 h) followed by either seven or fourteen days off. During the two weeks of work participants lived on-site. Total sleep time was significantly less (p < 0.01) while on-site on both day (6.1 ± 1.0 h) and night shifts (5.7 ± 1.5 h) than days off (7.4 ± 1.4 h). Further, night shift sleep was significantly shorter than day-shift sleep (p < 0.01). Assessment of subjective fatigue ratings showed that the sleep associated with both days off and night shifts had a greater recovery value than sleep associated with day shifts (p < 0.01). While on-site, participants obtained only 6 h of sleep indicating that the absence of competing domestic, family and social activities did not convert to more sleep. Factors including shift start times and circadian influences appear to have been more important.     

Tree pattern mining with tree automata constraints

Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process.