Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm

Multiple-Instance Learning （MIL） is used to predict the unlabeled bags＇ label by learning the labeled positive training bags and negative training bags.Each bag is made up of several unlabeled instances.A bag is labeled positive if at least one of its instances is positive,otherwise negative.Existing multiple-instance learning methods with instance selection ignore the representative degree of the selected instances.For example,if an instance has many similar instances with the same label around it,the instance should be more representative than others.Based on this idea,in this paper,a multiple-instance learning with instance selection via constructive covering algorithm （MilCa） is proposed.In MilCa,we firstly use maximal Hausdorff to select some initial positive instances from positive bags,then use a Constructive Covering Algorithm （CCA） to restructure the structure of the original instances of negative bags.Then an inverse testing process is employed to exclude the false positive instances from positive bags and to select the high representative degree instances ordered by the number of covered instances from training bags.Finally,a similarity measure function is used to convert the training bag into a single sample and CCA is again used to classification for the converted samples.Experimental results on synthetic data and standard benchmark datasets demonstrate that MilCa can decrease the number of the selected instances and it is competitive with the state-of-the-art MIL algorithms.     

Learnability of multi-instance multi-label learning

Multi-instance multi-label learning(MIML) is a new machine learning framework where one data object is described by multiple instances and associated with multiple class labels.During the past few years,many MIML algorithms have been developed and many applications have been described.However,there lacks theoretical exploration to the learnability of MIML.In this paper,through proving a generalization bound for multi-instance single-label learner and viewing MIML as a number of multi-instance single-label learning subtasks with the correlation among the labels,we show that the MIML hypothesis class constructed from a multi-instance single-label hypothesis class is PAC-learnable.     

Incremental frequent tree-structured pattern mining from semi-structured data

The paper studies the problem of incremental pattern mining from semi-structrued data. When a new dataset is added into the original dataset, it is difficult for existing pattern mining algorithms to incrementally update the mined results. To solve the problem, an incremental pattern mining algorithm based on the rightmost expansion technique is proposed here to improve the mining performance by utilizing the original mining results and information obtained in the previous mining process. To improve the efficiency, the algorithm adopts a pruning technique by using the frequent pattern expansion forest obtained in mining processes. Comparative experiments with different volume of initial datasets, incremental datasets and different minimum support thresholds demonstrate that the algorithm has a great improvement in the efficiency compared with that of non-incremental pattern mining algorithm.     

A multi-label classification algorithm based on label-specific features

Aiming at the problem of multi-label classification,a multi-label classification algorithm based on label-specific features is proposed in this paper.In this algorithm,we compute feature density on the positive and negative instances set of each class firstly and then select mk features of high density from the positive and negative instances set of each class,respectively;the intersection is taken as the label-specific features of the corresponding class.Finally,multi-label data are classified on the basis of label-specific features.The algorithm can show the label-specific features of each class.Experiments show that our proposed method,the MLSF algorithm,performs significantly better than the other state-of-the-art multi-label learning approaches.     

CFSBC： Clustering in High-Dimensional Space Based on Closed Frequent Item Set

Clustering in high-dimensional space is an important domain in data mining. It is the process of discovering groups in a high-dimensional dataset, in such way, that the similarity between the elements of the same cluster is maximum and between different clusters is minimal. Many clustering algorithms are not applicable to high dimensional space for its sparseness and decline properties. Dimensionality reduction is an effective method to solve this problem. The paper proposes a novel clustering algorithm CFSBC based onclosed frequent hemsets derived from association rule mining. which can get the clustering attributes with high efficiency. The algorithm has several advantages. First, it deals effectively with the problem of dimensionality reduction. Second, it is applicable to different kinds of attributes, Third, it is suitable for very large data sets. Experiment shows that the proposed algorithm is effective and efficient     

Mining Frequent Closed Itemsets in Large High Dimensional Data

Large high-dimensional data have posed great challenges to existing algorithms for frequent itemsets mining. To solve the problem, a hybrid method, consisting of a novel row enumeration algorithm and a column enumeration algorithm, is proposed. The intention of the hybrid method is to decompose the mining task into two subtasks and then choose appropriate algorithms to solve them respectively. The novel algorithm, i.e., Intertransaction is based on the characteristic that there are few common items between or among long transactions. In addition, an optimization technique is adopted to improve the performance of the intersection of bit-vectors. Experiments on synthetic data show that our method achieves high performance in large high-dimensional data.     

Intrusion detection based on rough set and artificial immune

In order to increase intrusion detection rate and decrease false positive detection rate , a novel intrusion detection algorithm based on rough set and artificial immune ( RSAI-IDA) is proposed. Using artificial immune in intrusion detection , anomaly actions are detected adaptively , and with rough set , effective antibodies can be obtained .A scheme , in which antibodies are partly generated randomly and others are from the artificial immune algorithm , is applied to ensure the antibodies di-versity.Finally, simulations of RSAI-IDA and comparisons with other algorithms are given .The ex-perimental results illustrate that the novel algorithm achieves more effective performances on anomaly intrusion detection , where the algorithm ’ s time complexity decreases , the true positive detection rate increases , and the false positive detection rate is decreased .     

Motion Planning Method for Obstacle Avoidance of 6-DOF Manipulator Based on Improved A* Algorithm

The conventional A* algorithm may suffer from the infinite loop and a large number of search data in the process of motion planning for manipulator. To solve the problem,an improved A* algorithm is proposed in this paper by the means of selecting middle points and applying variable step segments searching during the searching process. In addition,a new method is proposed for collision detection in the workspace. In this paper,the MOTOMAN MH6 manipulator with 6-DOF is applied for motion plan. The algorithm is based on the basis of the simplification for the manipulator and obstacles by cylinder enveloping. Based on the analysis of collision detection,the free space can be achieved which makes it possible for the entire body to avoid collisions with obstacles. Compared with the Conventional A*,the improved algorithm deals with less searching points and performs more efficiently. The simulation developed in VC + + with OpenGL and the actual system experiments prove effectiveness and feasibility of this improved method.     

Application of marching cubes algorithm in visualization of mineral deposits

An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits.The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm. The implementation scheme was applied to model and reconstruct the surfaces of mineral deposits, using the geological data obtained from an iron mine in China. Experimental results demonstrate the ability of the implementation scheme to solve the ambiguity problem, and illustrate the effectiveness and efficiency of the MC algorithm in the visualization of mineral deposits.     

An Improved Algorithm for k-Nearest-Neighbor Finding and Surface Normals Estimation

This paper is to improve the speed of k-nearest-neighbor search and put forward algorithms related to tangent plane estimation based on existing methods. Starting from the points cloud, the algorithm segments the whole data into many different small cubes in space, and the size of cube is related to the density of the points cloud. Considering the position of the point in the cube, the algorithm enlarges the area around the given point step by step until the k-nearest-neighbor is accomplished. The neighbor’s least-squares tangent plane is estimated. In order to orient the planes, the k-nearest-neighbor is introduced into the problem of seeking the minimum spanning trees instead of searching the whole data. The research proved that the algorithms put forward in this paper were effective in processing data in short time and with high precision. The theory was useful for the practical application in reverse engineering and other areas related. Solution for finding k-nearest-neighbor problem, which still costs much time in present, was provided, and a propagation algorithm for orienting the planes was also discussed. The algorithm chose the orientation among the k-nearest-neighbor of the current point.     

彩色图像的边缘检测

彩色图像的边缘检测算法有很多,但检测结果仍存在细节丢失、抗噪性差的问题。本文提出一种新的彩色图像的边缘检测算法。首先,在RGB空间下,采用矢量梯度算法,分别在三个通道中求出像素的梯度值。然后,采用自适应双阈值算法,对梯度值进行判断,筛选出图像的边缘点。最后,只采用筛选后的边缘点的信息,构造新的模糊矩阵的隶属函数,从而形成新的模糊算法。利用该算法,检测出最终的图像边缘信息。实验证明,该算法得到的图像检测结果,不仅对比度高、边缘连续、细节保存完整,而且具有较强的抗噪性。     

时间表理论中LPT算法在装箱问题中的应用

本文利用二分搜索法和时间表理论中LPT算法求解装箱问题的近似最优解;给出了一个直观性算法,并研究这个算法的最坏情形,最后说明此算法在某些方面优于著名的FFD算法。     

自适应滤波算法综述

基于二阶统计量即相关函数的自适应滤波算法在自适应信号处理中有着 广泛的应用，本文就国内外对这些算法的研究进行了综述。     

基于老化算法的分布式文件缓存算法

为提升数据检索读的性能, 基于老化算法采取Cache方法, 通过设计合理的缓存结构, 给出一种新的分布式文件缓存算法. 该算法在缓存实现部分, 使用了LRU算法中常用的老化算法, 并将其由一个页面置换算法改进为一个文件缓存替换算法, 且在该过程中完好地继承了老化算法的优点. 评测结果显示了改进方法的有效性.     

EM算法理论及其应用

EM算法是一种迭代算法,主要用来计算后验分布的众数或极大似然估计,广泛地应用于缺损数据、截尾数据、成群数据、带有讨厌参数的数据等所谓的不完全数据的统计推断问题。在介绍EM算法的基础上,针对EM算法收敛速度慢的缺陷,具体讨论了加速EM算法：EMB算法和MEMB算法;针对EM算法计算的局限性,给出了EM算法的推广：GEM和MCEM算法。最后给出了EM的实值实例,结果精确。     

基于Bresenham算法的四步画直线算法

通过分析计算机图形学中的画直线的Bresenham算法，以及由此改进的“对称算法”、“二步法”，提出将“对称算法”和“二步法”结合形成“4—点画线算法”，与Bresenham算法相比，该算法可以将画线效率提高近2倍。     

一种改进的KR模式匹配算法

在分析BF、KMP和KR等模式匹配算法的基础上提出一种改进的KR算法(IKR),在产生哈希冲突时利用双向比较法进行匹配.实验结果表明,该算法可以快速有效地进行模式匹配.     

几种模式匹配算法的效率分析

分析几种模式匹配算法如KMP、BM、RK、SO。通过上机实验对这些算法的匹配时间进行测试,结果表明在这些模式匹配算法中BM算法是速度最快效率最高的算法。     

排课系统中混合算法的应用研究

排课系统比较复杂又具有智能特点,其算法主要有模拟手工算法、回溯算法、遗传算法、贪心算法等.在软件开发过程中,发挥每种算法优点以提高排课的科学性、高效性和合理性是个重要课题.结合成功研制排课系统的经验,阐述了不同算法的应用,提出了通过所有算法的混合应用解决排课问题的方法.     

大数快速模幂算法的研究

大数模幂在现代密码学领域有着广泛的应用，它是RSA．ELGamal等公钥密码的基本运算。对目前具有典型代表的各种大数模幂算法进行分析，从基本设计原理和实现角度对这些模幂算法进行分类，归纳并给出了各类算法的实现方法、优缺点和研究现状。