关联规则挖掘在教学评价中的应用研究

教学评价是院校最重要的工作之一,而科学的评教方法又显得尤为重要。本文介绍一种更适合于关系型数据库关联规则挖掘的、基于SQL的频繁项关联规则挖掘算法,并将其应用于教学评价。通过对大量的样本数据进行试验,得出了应用以往传统的教学评价方法所无法得到重要的教学参考信息。     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

Mining e-Learning domain concept map from academic articles

Recent researches have demonstrated the importance of concept map and its versatile applications especially in e-Learning. For example, while designing adaptive learning materials, designers need to refer to the concept map of a subject domain. Moreover, concept maps can show the whole picture and core knowledge about a subject domain. Research from literature also suggests that graphical representation of domain knowledge can reduce the problems of information overload and learning disorientation for learners. However, construction of concept maps typically relied upon domain experts in the past; it is a time consuming and high cost task. Concept maps creation for emerging new domains such as e-Learning is even more challenging due to its ongoing development nature. The aim of this paper is to construct e-Learning domain concept maps from academic articles. We adopt some relevant journal articles and conference papers in e-Learning domain as data sources, and apply text-mining techniques to automatically construct concept maps for e-Learning domain. The constructed concept maps can provide a useful reference for researchers, who are new to the e-Leaning field, to study related issues, for teachers to design adaptive learning materials, and for learners to understand the whole picture of e-Learning domain knowledge.     

Business intelligence approach to supporting strategy-making of ISP service management

The recent deregulation of telecommunication industry by the Taiwanese government has brought about the acute competition for Internet Service Providers (ISP). Taiwan’s ISP industry is characterized by the heavy pressure for raising revenue after hefty capital investments of last decade and the lack of knowledge to develop competitive strategies. To attract subscribers, all ISP dealers are making an all-out effort to improve their service management. This study proposes a Business Intelligence process for ISP dealers in Taiwan to assist management in developing effective service management strategies. We explore the customers’ usage characteristics and preference knowledge through applying the attribute-oriented induction (AOI) method on IP traffic data of users. Using the self-organizing map (SOM) method, we are able to divide customers into clusters with different usage behavior patterns. We then apply RFM modeling to calibrate customers’ value of each cluster, which will enable the management to develop direct and effective marketing strategies. For network resource management, this research mines the facility utilization over various administrative districts of the region, which could assist management in planning for effective network facilities investment. With actual data from one major ISP, we develop a BI decision support system with visual presentation, which is well received by its management staff.     

关联规则剪枝的运用

该文重点介绍了最新的一种关联规则后处理的方法,并且我们提出了这种方法的优化算法,能够有效去除关联规则集合中的无趣模式,并且为模式的可视化提供了良好的工具。相关实验表明该方法具有更好的模式后处理能力。     

多特征融合的蛋白质相互作用位点预测

蛋白质相互作用位点预测为蛋白质功能和药物设计的理解提供重要线索。而蛋白质的各种特征为蛋白质相互作用位点预测提供了大量有用信息,特别是进化信息、残基序列邻近和空间邻近性。不同的蛋白质特征对蛋白质间的相互作用的贡献也不一样。通过提取蛋白质序列谱、保守性和残基熵,提出了特征融合技术对蛋白质相互作用位点进行研究,采用SVM构建三种预测器,分别对各种不同的特征加以验证,实验结果表明了基于特征融合方法的有效性和正确性。     

基于GH-PKC体制的盲签名方案

GH-PKC是一种新的基于GF(q)上三级线性反馈移位寄存器序列的公钥密码体制。其安全性基于有限域GF(q3)上的离散对数困难问题,但运算却在有限域GF(q)中进行。文中给出了一种新的基于GH-PKC的类ELGamal数字签名算法,并在此基础上构建了基于GH-PKC的盲签名方案,其安全性等价于解GF(q3)上离散对数困难问题,但是传输的数据量只有传统方案的1/3。     

信息增益区分频繁模式分类方法

基于频繁模式的分类应用研究尚处于初始阶段,但其在关系数据、文本文档与图等方面的分类应用已取得初步成果。系统地研究了基于信息增益区分的频繁模式分类问题,提出了一种基于信息增益区分的频繁模式分类模型(IGFPC),从理论上论证了该模型的可行性。通过建立模式频率与基于信息增益区分度量间的联系,提出了一种在挖掘有用频繁模式上设置最小支持度阀值的方法,基于该方法和提出的特征选择算法(IGPS),生成用以构建高质量模式分类器的区分频繁模式。实验研究显示基于信息增益区分的频繁模式分类框架模型能在分类大数据集上达到较好的扩展性能和较高的分类精度。     

逆M序列在机抖激光陀螺消除动态闭锁中的应用

对逆M序列在消除激光陀螺动态闭锁误差中的应用进行了研究和验证.目前多采用M序列对抖动的幅度进行调制来消除激光陀螺动态闭锁误差,而逆M序列与M序列相比不仅满足注入到激光陀螺抖动中的要求,且比M序列有其性质等方面优势.通过理论分析及M序列和逆M序列在消除机抖激光陀螺动态闭锁中实验中的应用对比,实验数据表明逆M序列在消除动态闭锁中的作用要优于M序列.     

UML2.0顺序图的形式化研究

在UML2.0规范中顺序图的语义仍然是以自然语言的形式描述的,为实现对顺序图的自动化分析和验证,必须为顺序图定义一种形式化的语义模型.为此首先给出了UML顺序图的一种符合BNF范式的形式化语法,然后为该语法中的非终止符定义转换规则,将UML顺序图中的基本动作转换为加标Petri网组件,最后定义了各种合成操作,利用这些合成操作可以将UML顺序图的加标Petri网组件转换为加标Petni网.