The -help option will print out the list of supported tag entries (frames in ID3).
help选项将打印出支持的标签条目列表(ID 3中的帧)。
The ID3 tag gives you the length of the track only for the part that has been loaded.
ID 3标签只能给出已载入部分的音轨时长。
For files that can't abide an ID3 tag for various reasons, I print an informative message and skip them.
对于那些由于种种原因不能使用ID 3标签的文件，打印一条消息给出信息，并跳过它们。
I used fuzzy string matching, FreeDB searches, ID3 versions 1 and 2, and lots of text-mode user interactions.
我用到了模糊字符串匹配、FreeDB检索、ID3版本1和2，以及许多文本模式用户交互。
Thus, every choice I made for autotag.pl is battle-tested, and I hope you will find those choices alone useful if you ever do ID3-related Perl work.
这样，我为autotag . pl所作的每一个选择都经过实际的测试，并且，我希望如果您从事ID 3相关的Perl工作，这些选择也能对您有所帮助。
The experimental result indicates that it has advantages over Fuzzy-ID3.
实验结果表明：扩展算法优于模糊ID3算法。
ID3 algorithm is the most basic algorithm in the decision tree learning, and has a wide application.
ID 3算法是最基本的决策树学习算法，有很广的应用。
Data mining adopts the improved ID3 algorithm and can meet the demand of load analysis and prediction.
数据挖掘采用改进ID 3算法，能够满足负荷分析和预测方面的要求。
Minimum entropy is chosen as a heuristic strategy in decision tree (DT) learning algorithm such as ID3.
决策树的学习算法，比如id3算法，选用最小信息熵作为启发式信息。
ID3 algorithm is a classical algorithm in data mining, this algorithm has the worse ability to resist noise.
ID 3算法是数据挖掘中经典的决策树分类算法，该算法具有抗噪声能力差的缺点。
The algorithm constructs decision tree using an improved ID3 algorithm, and fills the missing data by decision rules.
该算法应用改进的ID 3算法来构造决策树，利用决策规则对缺失值进行补充。
Adding these methods into ID3 makes the algorithm be able to deal with both consistent and inconsistent data properly.
将这些方法结合进id 3算法，使算法对相容和不相容数据均可进行有效地处理。
Results of instance comparison test verify the effectiveness of the method and conquer the most demerit of ID3 decision tree.
通过实例比较验证了该方法的有效性，克服了常规ID3算法的不足。
Results The decision tree algorithm ID3 and C4.5 for medical image data mining are realized, the experiment results are given.
结果实现了ID3和C4.5算法对图像数据的分类，获得了分类的实验结果。
And it introduces some algorithms of decision tree learning such as ID3, C4.5 and feature subset selection of Inductive learning.
介绍了归纳学习中的决策树学习算法如id3、C4.5和特征子集选择问题。
The optimized ID3 algorithm can process the XML document intelligently, generate the decision rules, and optimize the rules in the limit range.
该改进的算法可以智能处理XML文档，生成决策规则，并在一定范围内优化规则。
The algorithm of ID3 usually leans to select attributes which value much more, and can't handle continuous data, and is sensitivity to the noise.
ID 3算法往往偏向于取值较多的属性，不能处理连续数据，对噪声也较为敏感。
To make more scientific decision, an improved decision tree algorithm weighted ID3 is proposed and applied into the determination of aluminum tapping volume.
为提高决策的科学化程度，提出了一种改进的决策树生成算法加权id3，并将其应用于铝电解生产中出铝量的设定。
Induction learning of decision tree based on ID3 algorithm is an important branch of inductive learning now, which can be used to automatic acquisition of knowledge.
基于ID 3算法的决策树归纳学习是归纳学习的一个重要分支，可用于知识的自动获取过程。
For a given incomplete decision table, the algorithm constructs decision tree using the improved ID3 algorithm, and fills the missing data in the process of constructing the decision tree.
对于给定的不完全决策表，该算法应用改进的ID 3算法来构造决策树，在构造决策树的过程中对遗失值进行补充。
Information gain is the measurement of the attributes selection in classical decision tree algorithm-ID3, but the attributes with high information gain is not always the valuable attributes.
传统的ID3决策树算法以信息增益作为属性选择的准则值，但是信息增益大的属性并不一定就是有价值的属性。
The rough sets reduction model is established by integrating rough sets theory with ID3 algorithm based on statistics, uncertainty fuzzy data set information can be processed with the model.
把粗糙集理论与基于概率统计ID3算法结合建立粗糙集约简模型，可处理不精确和模糊数据集信息。
According to the character of expected information, the article proposed a new ID3 algorithm of decision trees to reduce the complexity of computing expected information by the convex function.
根据ID3算法中信息增益计算原理的特点，利用上凸函数的性质提出一种新的改进的ID3算法，减少了信息增益的计算量，进而提高ID3算法中信息增益的计算效率。
According to the character of expected information, the article proposed a new ID3 algorithm of decision trees to reduce the complexity of computing expected information by the convex function.
根据ID3算法中信息增益计算原理的特点，利用上凸函数的性质提出一种新的改进的ID3算法，减少了信息增益的计算量，进而提高ID3算法中信息增益的计算效率。
应用推荐