After getting the feature set, USES cover algorithm as a text classifier to study.
在得到特征集后，使用覆盖算法作为文本分类器进行学习。
Based on these theorems, gives the minimum cover algorithm of the multivalued dependency based on the MVD schema matrix.
根据这些定理，给出了基于MVD模式矩阵的多值依赖最小覆盖算法。
The experiment results show that the cover algorithm has good robustness and high classifying accuracy over Normal Galaxies and stars datasets.
对正常星系和恒星两类光谱数据进行实验，结果表明，覆盖算法具有较好的鲁棒性、较高的分类正确率。
Use the method of x2 statistic to extract texts characteristics after processing the text and then use cross cover algorithm to design a classifier.
为解决基于卡方统计量离散化方法在处理未知数据特性时的参数难确定问题，提出了一种基于粗糙集方法的自动离散化方法。
Based on the Crossing Cover Algorithm of forward neural network, this paper realizes the automatic classification of texts after the preprocessing of the texts.
本文利用前向神经网络的交叉覆盖算法，通过对文本进行分词的预处理后，实现文本的自动分类。
Based on CHI value feature selection and the cover algorithm of forward neural network, realizes the automatic classification of texts after the preprocessing of the texts.
通过对前向神经网络交叉覆盖算法的分析，针对该算法的特点，文中提出了扩大覆盖半径以减少拒识样本数据的新方法。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
Visual search is simulated with an algorithm for two interacting processes: a cover process (" look ") and a vision process (" see ").
视觉搜索的模拟算法考虑两个交互作用的过程：覆盖过程(“看”)和视觉过程(“看见”)。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Simulations showed that size of cover set obtained by synchronous scheduling algorithm is 76% of asynchronous scheduling algorithm's, and average cover degree is near to optimization.
仿真实验表明，同步调度算法得到的覆盖集的大小为异步调度算法的76%左右，平均覆盖度接近理想最优情况。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
Based on the features of wheat and its background components, an algorithm was designed to extract the percent ground cover, and the corresponding program was developed.
在分析数字影像中小麦和背景特征的基础上设计了小麦覆盖度的提取算法，并开发了一个对影像进行自动分类提取小麦覆盖度的程序包。
An algorithm resolving Matrix Cover problem rapidly is introduced and extended. The domain for the components of vectors is enlarged.
介绍一种快速求解矩阵覆盖问题的算法，并对此算法进行了扩展，将原算法中向量的各个分量的取值范围扩大。
Test results indicate that the algorithm can acquire about 16% of the useful expanded rules to cover 93% of the annotated positive examples and can improve the expected accuracy from 51% to 81%.
实验结果表明：现有算法以16%的有效扩展规则覆盖了93%的标注正例，并使预期精度从51%提高到81%，显示了这套规则学习和评价方法的有效性。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
In this paper, taking BMP image as cover, a secure self-embedding algorithm is proposed.
本文以BMP格式图像为研究对象，提出一种安全的自嵌入水印算法。
The experimental results indicate that the proposed algorithm can remove the thin cloud cover effectively, maintain the details better and prevent producing the boundaries.
实验结果表明，该方法不仅可以有效减少薄云雾的影响，而且可以更好地保留图像细节信息，同时防止了边缘效应的产生。
The thesis is about the research on the information hiding algorithm, using images as the cover signal, primarily based on the grey relational analysis theory.
同时对灰关联分析应用在图象处理领域中的可行性以及一些关键问题进行了简单的论述，为论文的研究工作在理论上做了一些铺垫。
The thesis is about the research on the information hiding algorithm, using images as the cover signal, primarily based on the grey relational analysis theory.
同时对灰关联分析应用在图象处理领域中的可行性以及一些关键问题进行了简单的论述，为论文的研究工作在理论上做了一些铺垫。
应用推荐