Joint European Conference on Artificial Intelligence in Medicine and Medical Decision Making
標(biāo)簽： Intelligence Conference Artificial European
上傳時間： 2015-11-07
上傳用戶：15736969615
COM versus CORBAA Decision Framework！一本介紹應(yīng)該使用COM還是CORBA的記錄文摘！
標(biāo)簽： COM Framework Decision versus
上傳時間： 2013-12-03
上傳用戶：變形金剛
Dream.exe soft source (Visual C++)
標(biāo)簽： Visual source Dream soft
上傳時間： 2013-12-02
上傳用戶：guanliya
this soft is for an important soft for soft people ,this soft is my dear to you for your soft.
標(biāo)簽： soft for this important
上傳時間： 2015-11-24
上傳用戶：zhanditian
ID3決策樹內(nèi)容簡介： 概述 預(yù)備知識 決策樹生成(Building Decision Tree) 決策樹剪枝(Pruning Decision Tree) 捕捉變化數(shù)據(jù)的挖掘方法 小結(jié)
標(biāo)簽： Decision Tree Building Pruning
上傳時間： 2013-12-12
上傳用戶：上善若水
Decision Tree Decision Tr
上傳時間： 2013-12-24
上傳用戶：jing911003
for edge filter. yoy can combain the matlab soft to BCB
標(biāo)簽： combain filter matlab edge
上傳時間： 2016-01-30
上傳用戶：gxf2016
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
標(biāo)簽： the decision clusters Cluster
上傳時間： 2013-12-21
上傳用戶：gxmm
主要是KNN（the k-nearest neighbor algorithm ）,LVQ1（learning vector quantization 1）, DSM（decision surface mapping）算法。 and a simple clustering algorithm.
標(biāo)簽： quantization k-nearest algorithm decision
上傳時間： 2016-02-07
上傳用戶：zhyiroy
One kind of decision-making tree algorithm, can be seen as one kind data mining algorithm ,find the rule from large-scale data middle.
標(biāo)簽： algorithm kind decision-making mining
上傳時間： 2014-01-13
上傳用戶：ruan2570406
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
