Titlebook: Artificial Intelligence and Soft Computing; 11th International C Leszek Rutkowski,Marcin Korytkowski,Jacek M. Zurad Conference proceedings

Maculate

書目名稱Artificial Intelligence and Soft Computing影響因子(影響力)




書目名稱Artificial Intelligence and Soft Computing影響因子(影響力)學科排名




書目名稱Artificial Intelligence and Soft Computing網(wǎng)絡公開度




書目名稱Artificial Intelligence and Soft Computing網(wǎng)絡公開度學科排名




書目名稱Artificial Intelligence and Soft Computing被引頻次




書目名稱Artificial Intelligence and Soft Computing被引頻次學科排名




書目名稱Artificial Intelligence and Soft Computing年度引用




書目名稱Artificial Intelligence and Soft Computing年度引用學科排名




書目名稱Artificial Intelligence and Soft Computing讀者反饋




書目名稱Artificial Intelligence and Soft Computing讀者反饋學科排名

malign

0302-9743 ) constitutes the refereed proceedings of the 11th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2012, held in Zakopane, Poland in April/ May 2012. The 212 revised full papers presented were carefully reviewed and selected from 483 submissions. The papers are organi

GOAD

古董

https://doi.org/10.1007/978-3-658-28464-0er focuses on general pruning methods which can be successfully applied for arbitrary classification method. Simple but efficient wrapper method based on generalization of Hart’s Condensed Nearest Neighbors rule is presented and impact of this method on classification quality is reported.

institute

腫塊

割公牛膨脹

https://doi.org/10.1007/978-3-658-37514-0 non-symmetric cost of misclassification events, and combining several weak classifiers (metalearning). We show that metalearning seems counter-productive if the goal is to enhance the recognition of a weak class, and that the method of choice would consist in combining boosting with the non-symmetric cost approach.

結(jié)果

山頂可休息

Fast Plagiarism Detection by Sentence Hashing obtained demonstrate that the algorithm delivers solution faster than the alternatives. Its algorithmic complexity is logarithmic, thus its performance is better than most algorithms using dynamic programming used to find the longest common subsequence.

aristocracy