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.     

关联规则剪枝的运用

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

Beyond Market Baskets: Generalizing Association Rules to Dependence Rules

One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market basket data and partly by the goal of ironing out some problems in the definition of association rules, we develop the notion of dependence rules that identify statistical dependence in both the presence and absence of items in itemsets. We propose measuring significance of dependence via the chi-squared test for independence from classical statistics. This leads to a measure that is upward-closed in the itemset lattice, enabling us to reduce the mining problem to the search for a border between dependent and independent itemsets in the lattice. We develop pruning strategies based on the closure property and thereby devise an efficient algorithm for discovering dependence rules. We demonstrate our algorithm's effectiveness by testing it on census data, text data (wherein we seek term dependence), and synthetic data.     

开采沉陷信息处理软件系统模块划分方法的探讨

对开采沉陷信息处理软件系统各个模块间的关系及设计原则进行了探讨．利用文中讨论的设计划分方法开发的“地表移动与三下采煤数据管理及处理”软件收到了良好的运行效果     

Theory and techniques of data mining in CGF behavior modeling

For the large quantity of data,rules and models generated in the course of computer generated forces (CGFs) behavior modeling,the common analytical methods are statistical methods based on the tactical rules,tactical doctrine and empirical knowledge.However,from the viewpoint of data mining,we can find many of these analytical methods are also each-and-every different data mining methods.In this paper,we survey the data mining theory and techniques that have appeared in the course of CGF behavior modeling f...     

基于词性的文本挖掘算法在IDS日志中的应用

提出一种以词性为参考值的文本挖掘算法,能有效挖掘与种子词有关的关联规则。基于Bootstrapping算法思想,既减少了预处理阶段对于词根还原的依赖,能处理日志中出现的中文词汇。增加了对于日志文本上下的理解,提高了关联规则的有效性,并应用与IDS日志挖掘之中,有效改善挖掘效率,为规则库提供关联规则。     

Several multi-criteria programming methods for classification

In this paper, we propose a general optimization-based model for classification. Then we show that some well-known optimization-based methods for classification, which were developed by Shi et al. [Data mining in credit card portfolio management: a multiple criteria decision making approac. In: Koksalan M, Zionts S, editors. Multiple criteria decision making in the new millennium. Berlin: Springer; 2001. p. 427–36] and Freed and Glover [A linear programming approach to the discriminant problem. Decision Sciences 1981; 12: 68–79; Simple but powerful goal programming models for discriminant problems. European Journal of Operational Research 1981; 7: 44–60], are special cases of our model. Moreover, three new models, MCQP (multi-criteria indefinite quadratic programming), MCCQP (multi-criteria concave quadratic programming) and MCVQP (multi-criteria convex programming), are developed based on the general model. We also propose algorithms for MCQP and MCCQP, respectively. Then we apply these models to three real-life problems: credit card accounts, VIP mail-box and social endowment insurance classification. Extensive experiments are done to compare the efficiency of these methods.     

Reconfiguring existing pollutant monitoring stations by increasing the value of the gathered information

The objective of this study is to provide a framework for relocating or reconfiguring existing pollution monitoring station networks by using feature selection and data mining techniques. This methodology enables a partial redesign based on the maximization of the available information that is gathered by the pollution networks by the optimal data mining technique. It also considers requirements of the decision makers, like potential target places, etc.Since this methodology is based on the quality of forecasting, it can also be useful for auditing and forecasting. A case study is included in this paper. In light of the prediction results, a new way to relocate the existing monitoring station is proposed.