一种交互式自动挖掘知识的模型

提出一种交互式自动挖掘知识的模型,论述了该模型的原理、实现机制,并讨论了模型中数据宝藏和影响域及其相互关系．该模型同时具有在线性与深入挖掘的优点,能灵活有效地满足实际应用的需求．     

Correctness proof of an in-place permutation

The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm.An in-place rectangular matrix transposition algorithm is given as an example.     

Linear low-rank approximation and nonlinear dimensionality reduction

We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of column-partitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.     

Size of random Galois lattices and number of closed frequent itemsets

Given a sample of binary random vectors with i.i.d. Bernoulli(p) components, that is equal to 1 (resp. 0) with probability p (resp. 1−p), we first establish a formula for the mean of the size of the random Galois lattice built from this sample, and a more complex one for its variance. Then, noticing that closed α-frequent itemsets are in bijection with closed α-winning coalitions, we establish similar formulas for the mean and the variance of the number of closed α-frequent itemsets. This can be interesting for the study of the complexity of some data mining problems such as association rule mining, sequential pattern mining and classification.     

应用数据挖掘的束流状态描述建模

聚类分析是描述数据群体特征的有效方法.然而,随着挖掘数据库规模的增大,评分函数极值搜索是计算复杂度很高的问题.文中提出了一种新的算法,并将其运用到束流状态描述建模中.试验结果表明,该算法快速有效.同时,重复性是电子储存环的重要指标,聚类模型可作为机器研究和决策的依据,具有指导意义.     

A Novel Rule Induction Algorithm

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｋｎｏｗｌｅｄｇｅｄｉｓｃｏｖｅｒｙｉｎｄａｔａｂａｓｅｓ (ＫＤＤ)ｉｓｃｏｎｃｅｒｎｅｄｗｉｔｈｅｘｔｒａｃｔｉｎｇｕｓｅｆｕｌｉｎｆｏｒｍａｔｉｏｎｆｒｏｍｄａｔａｂａｓｅｓ.Ｔｈｅｔｅｒｍｄａｔａｍｉｎｉｎｇｈａｓｈｉｓｔｏｒｉｃａｌｌｙｂｅｅｎｕｓｅｄｉｎｔｈｅｄａｔａｂａｓｅｃｏｍｍｕｎｉｔｙａｎｄｉｎｓｔａｔｉｓｔｉｃｓ (ｏｆｔｅｎｉｎｔｈｅｌａｔｔｅｒｗｉｔｈｎｅｇａｔｉｖｅｃｏｎｎｏｔａｔｉｏｎｓｔｏｉｎｄｉｃａｔｅｉｍｐｒｏｐｅｒｄａｔａａｎａｌｙ…     

Knowledge Discovery from Medical Data and Development of an Expert System in Immunology

Artificial intelligence is one of the fastest-developing areas of science that covers a remarkably wide range of problems to be solved. It has found practical application in many areas of human activity, also in medicine. One of the directions of cooperation between computer science and medicine is to assist in diagnosing and proposing treatment methods with the use of IT tools. This study is the result of collaboration with the Children’s Memorial Health Institute in Warsaw, from where a database containing information about patients suffering from Bruton’s disease was made available. This is a rare disorder, difficult to detect in the first months of life. It is estimated that one in 70,000 to 90,000 children will develop Bruton’s disease. But even these few cases need detailed attention from doctors. Based on the data contained in the database, data mining was performed. During this process, knowledge was discovered that was presented in a way that is understandable to the user, in the form of decision trees. The best models obtained were used for the implementation of expert systems. Based on the data introduced by the user, the system conducts expertise and determines the severity of the course of the disease or the severity of the mutation. The CLIPS language was used for developing the expert system. Then, using this language, software was developed producing six expert systems. In the next step, experimental verification was performed, which confirmed the correctness of the developed systems.     

Status Set Sequential Pattern Mining Considering Time Windows and Periodic Analysis of Patterns

The traditional sequential pattern mining method is carried out considering the whole time period and often ignores the sequential patterns that only occur in local time windows, as well as possible periodicity. Therefore, in order to overcome the limitations of traditional methods, this paper proposes status set sequential pattern mining with time windows (SSPMTW). In contrast to traditional methods, the item status is considered, and time windows, minimum confidence, minimum coverage, minimum factor set ratios and other constraints are added to mine more valuable rules in local time windows. The periodicity of these rules is also analyzed. According to the proposed method, this paper improves the Apriori algorithm, proposes the TW-Apriori algorithm, and explains the basic idea of the algorithm. Then, the feasibility, validity and efficiency of the proposed method and algorithm are verified by small-scale and large-scale examples. In a large-scale numerical example solution, the influence of various constraints on the mining results is analyzed. Finally, the solution results of SSPM and SSPMTW are compared and analyzed, and it is suggested that SSPMTW can excavate the laws existing in local time windows and analyze the periodicity of the laws, which solves the problem of SSPM ignoring the laws existing in local time windows and overcomes the limitations of traditional sequential pattern mining algorithms. In addition, the rules mined by SSPMTW reduce the entropy of the system.     

On an optimal robust digital image watermarking based on SVD using differential evolution algorithm

It is shown that the optimal robust digital image watermarking based on singular value decomposition using differential evolution algorithm proposed by Veysel Aslantas [Opt. Commun. 282(5):769-777 (2009)] has a serious fundamental flaw and should not be used for proof of ownership application.