標(biāo)題: Titlebook: Artificial Intelligence and Soft Computing; 11th International C Leszek Rutkowski,Marcin Korytkowski,Jacek M. Zurad Conference proceedings [打印本頁(yè)] 作者: Maculate 時(shí)間: 2025-3-21 18:23
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing影響因子(影響力)
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing被引頻次
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing被引頻次學(xué)科排名
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing年度引用
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing年度引用學(xué)科排名
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing讀者反饋
書(shū)目名稱(chēng)Artificial Intelligence and Soft Computing讀者反饋學(xué)科排名
作者: malign 時(shí)間: 2025-3-21 21:24
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 時(shí)間: 2025-3-22 01:29 作者: 古董 時(shí)間: 2025-3-22 08:00
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 時(shí)間: 2025-3-22 09:37 作者: 腫塊 時(shí)間: 2025-3-22 14:59 作者: 割公牛膨脹 時(shí)間: 2025-3-22 17:07
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é)果 時(shí)間: 2025-3-22 22:31 作者: 山頂可休息 時(shí)間: 2025-3-23 05:14
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 時(shí)間: 2025-3-23 06:16 作者: 有權(quán) 時(shí)間: 2025-3-23 12:38 作者: BLA 時(shí)間: 2025-3-23 15:29
Sample Complexity of Linear Learning Machines with Different Restrictions over Weightsat, sample complexity can be quite different even for learning machines having the same VC-dimension. Moreover, independently from the capacity of a learning machine, the distribution of data is also significant. Experimental results are compared with known theoretical results for sample complexity and generalization bounds.作者: 偽善 時(shí)間: 2025-3-23 18:18 作者: NIL 時(shí)間: 2025-3-23 23:19 作者: Physiatrist 時(shí)間: 2025-3-24 02:25 作者: 6Applepolish 時(shí)間: 2025-3-24 06:51
New Specifics for a Hierarchial Estimator Meta-algorithmlled training set division and a competence function creation method. The included experimental results show improvement over the methods described in [1]. A short recollection of Hierarchical Estimator is also included.作者: 新鮮 時(shí)間: 2025-3-24 13:47
On Pre-processing Algorithms for Data Streampose of this paper is to propose a pre-processing method for clustering algorithms. Experimental results show that proposed method is appropriate to handle noisy data and can accelerate processing time.作者: FLING 時(shí)間: 2025-3-24 17:49 作者: ligature 時(shí)間: 2025-3-24 20:41 作者: agglomerate 時(shí)間: 2025-3-25 00:46 作者: maverick 時(shí)間: 2025-3-25 06:32 作者: 污穢 時(shí)間: 2025-3-25 07:36
https://doi.org/10.1007/978-3-663-06823-5 the language models required for a natural language based EPG search system that outperform the baseline model created only from the original EPG data source by a significant margin measured by an absolute improvement of 14.1% on the model coverage (recall accuracy) using large-scale test data collected from a real-world EPG search application.作者: 半圓鑿 時(shí)間: 2025-3-25 14:36 作者: Indicative 時(shí)間: 2025-3-25 19:19 作者: 一美元 時(shí)間: 2025-3-25 23:03
On Resources Optimization in Fuzzy Clustering of Data Streamsmonstrated for both the wFCM and wPCM algorithms. The maximum chunk size limit modification, as a solution to this problem, is introduced. This modification ensures that the available memory is never exceeded, what is shown in the simulations. The considered modification decreases the quality of clustering results only slightly.作者: 拱形大橋 時(shí)間: 2025-3-26 00:25
Einleitung und Problemstellung,ich are stored into a vector of visual properties. These both vectors are then used to compute the overall web page similarity. This method will be described in detail and results of several experiments are also introduced in this paper.作者: ensemble 時(shí)間: 2025-3-26 05:34 作者: 嚴(yán)重傷害 時(shí)間: 2025-3-26 11:21
,F?higkeit zur Erkl?rung von Fachinhalten,pose of this paper is to propose a pre-processing method for clustering algorithms. Experimental results show that proposed method is appropriate to handle noisy data and can accelerate processing time.作者: 出生 時(shí)間: 2025-3-26 15:39
Dependency Analysis in Ontology-Driven Content-Based Systemsating the content using ontologies. Such systems contain ontology layer, annotation layer and content layer. These layers contain semantically interrelated and interdependent entities. Thus, a change in one layer causes many unseen and undesired changes and impacts that propagate to other entities. 作者: overwrought 時(shí)間: 2025-3-26 18:48 作者: 聯(lián)邦 時(shí)間: 2025-3-26 22:33 作者: CLAIM 時(shí)間: 2025-3-27 04:29
Fast Plagiarism Detection by Sentence Hashingpecial trait of the written texts - their natural sentence fragmentation, later employing a set of special techniques for text representation. Results obtained demonstrate that the algorithm delivers solution faster than the alternatives. Its algorithmic complexity is logarithmic, thus its performan作者: abreast 時(shí)間: 2025-3-27 08:27 作者: 樣式 時(shí)間: 2025-3-27 11:49
On the Structure of Indiscernibility Relations Compatible with a Partially Ordered Set, he introduces a notion of compatibility between the (partially ordered) universe and an indiscernibility relation on its support, and establishes a criterion for compatibility. In this paper we make a first step in the direction of investigating the structure of all the indiscernibility relations 作者: DOLT 時(shí)間: 2025-3-27 16:00 作者: 不滿分子 時(shí)間: 2025-3-27 19:05 作者: 壯麗的去 時(shí)間: 2025-3-27 22:40
Mining of Multiobjective Non-redundant Association Rules in Data Streamsddressed both the issues for data streams. Further, association rule mining is now considered as multiobjective problem where multiple measures like correlation coefficient, recall, comprehensibility, lift etc can be used for evaluating a rule. Discovery of multiobjective association rules in data s作者: 連鎖 時(shí)間: 2025-3-28 05:24 作者: corpuscle 時(shí)間: 2025-3-28 10:07
On Resources Optimization in Fuzzy Clustering of Data Streamsms are examined. It is shown that partitioning a data stream into chunks reduces the processing time of considered algorithms significantly. The partitioning procedure is accompanied with the reduction of results accuracy, however the change is acceptable. The problems arised due to the high speed d作者: CLOT 時(shí)間: 2025-3-28 13:25
A Comparison of Complexity Selection Approaches for Polynomials Based on: Vapnik-Chervonenkis Dimense recent ideas of Rademacher complexity and covering numbers. The classification task that we consider is carried out by polynomials. Additionally, we compare results of non-regularized and ..-regularized learning and its influence on complexity.作者: Range-Of-Motion 時(shí)間: 2025-3-28 15:05 作者: Brain-Waves 時(shí)間: 2025-3-28 20:21 作者: entice 時(shí)間: 2025-3-29 01:22 作者: 比喻好 時(shí)間: 2025-3-29 04:23 作者: 巫婆 時(shí)間: 2025-3-29 08:20 作者: PATRI 時(shí)間: 2025-3-29 12:55 作者: glowing 時(shí)間: 2025-3-29 18:57
Mining of Multiobjective Non-redundant Association Rules in Data Streamsg candidates, genMG computes minimal generators of all closed itemsets stored in the synopsis. Next, genMAR generates multiobjective association rules using non-dominating sorting based on user specified interestingness measures that are computed using the synopsis. Experimental evaluation using syn作者: fender 時(shí)間: 2025-3-29 20:28 作者: lanugo 時(shí)間: 2025-3-29 23:52
https://doi.org/10.1007/978-3-642-29350-4human-computer interaction; knowledge management system; parallel processing; probabilistic algorithms; 作者: LURE 時(shí)間: 2025-3-30 05:59
978-3-642-29349-8Springer-Verlag Berlin Heidelberg 2012作者: Juvenile 時(shí)間: 2025-3-30 11:25
On the Structure of Indiscernibility Relations Compatible with a Partially Ordered Set, he introduces a notion of compatibility between the (partially ordered) universe and an indiscernibility relation on its support, and establishes a criterion for compatibility. In this paper we make a first step in the direction of investigating the structure of all the indiscernibility relations which satisfy such a compatibility criterion.作者: 防止 時(shí)間: 2025-3-30 15:20 作者: overshadow 時(shí)間: 2025-3-30 20:11
A Clustering Algorithm Based on Distinguishability for?Nominal Attributesn within each pair of cluster, and next the measure of?.-distinguishability of clusters for creating a junction of clusters. The developed method is hierarchical and agglomerative one and can be characterized both by?high speed of computation as well as?extremely good accuracy of clustering.作者: 嘮叨 時(shí)間: 2025-3-31 00:33 作者: Gorilla 時(shí)間: 2025-3-31 02:24 作者: 惡意 時(shí)間: 2025-3-31 07:18 作者: Assignment 時(shí)間: 2025-3-31 09:50 作者: 柔美流暢 時(shí)間: 2025-3-31 16:43
,Forschungsdesign – Forschungsmethode,ta, which is one of the core tasks of machine learning, primarily for the purpose of prediction. It arranges many simple function approximators into a tree-like structure in order to achieve a solution with a low error..This paper presents a new version of specifics for that meta-algorithm – a so ca作者: 支架 時(shí)間: 2025-3-31 17:55 作者: PANIC 時(shí)間: 2025-4-1 01:15 作者: heart-murmur 時(shí)間: 2025-4-1 05:16
