共查询到20条相似文献,搜索用时 100 毫秒
1.
聚类有效性函数:熵公式 总被引:12,自引:2,他引:10
依据香农信息熵理论。本文引入了一个新的划分熵公式。结合J.C.Bezdek给出的划分熵,定义了一个新的聚类有效性函数。通过四组数据对该聚类有效性函数的判决功能和鲁棒性进行了研究。 相似文献
2.
3.
硬聚类和模糊聚类的结合——双层FCM快速算法 总被引:3,自引:0,他引:3
模糊c均值(FCM)聚类算法在模式识别领域中得到了广泛的应用,但FCM算法在大数据集的情况下需要大量的CPU时间,令用户感到十分不便,提高算法的速度是一个急待解决的问题。本文提出的双层FCM聚类算法是一种快速算法,它体现了硬聚类和模糊聚类的结合,以硬聚类的结果对模糊聚类的初始值进行指导,从而明显地缩短了迭代过程。双层FCM算法所用的CPU时间仅为FCM算法的十三分之一,因而具有很强的实用价值。 相似文献
4.
5.
一种改进的遗传k-means聚类算法 总被引:8,自引:0,他引:8
在经典的k-means聚类算法中,聚类数k必须事先给定,然而在现实中k很难被精确的确定.本文提出了一种改进的遗传k-means聚类算法,并构造了一个用来评价分类程度好坏的适应度函数,该适应度函数考虑的是在提高紧凑度(类内距)和分离度(类间距)的同时使得分类个数尽可能少.最后采用两个人工数据集和三个UCI数据集对k-means聚类算法(KM),遗传聚类算法(GA),遗传k-means聚类算法(GKM)和改进的遗传k-means聚类算法(IGKM)进行比较研究,比较的指标有类间距、类内距和分类正确率.研究证明改进的遗传k-means算法能够自动获取最佳聚类数k并且保持较高的正确率. 相似文献
6.
在模糊C均值(Fuzzy C-Means,FCM)聚类应用过程中,针对目前模糊加权指数的确定缺乏理论依据和有效评价方法这一问题,提出了一种基于子集测度的模糊加权指数计算方法.首先根据子集测度理论定义了一个聚类有效性函数,然后依据该函数在聚类过程中通过循环进化迭代来计算聚类结果的有效性,并将其值反馈到模糊加权指数m的变化中,而使m收敛到一个稳定解,即得到最佳模糊加权指数.理论分析和实验表明,该算法是有效的,为模糊加权指数m的探讨研究提供了一种新的思路和途径. 相似文献
7.
8.
9.
10.
提出一种新的基于模糊聚类和卡尔曼滤波方法的模糊辨识算法 .该方法是基于快速模糊聚类 ,计算给定样本在各类中的隶属度 ,并利用卡尔曼滤波方法辨识模糊模型的结论参数 .整个辨识过程与一般的模糊聚类方法 [1 ]相比 ,需要的 CPU时间大大缩短 .最后通过仿真实例验证了该方法的有效性 . 相似文献
11.
An important role of classroom interaction is the processes involved in knowing or coming to know. Following a conversation analytical approach, this study investigates how students’ claims of not knowing, not remembering or not understanding are handled by mathematics teachers in whole class interactions. The study draws on video recordings of 42 mathematics lessons from 8 secondary schools in England. It is argued that claims of not knowing and claims of not remembering perform different social actions and are consequently treated differently by teachers. Claims of not knowing can challenge the assumption that knowledge can be taken-as-shared in a way that claims of not remembering do not. This contributes to the research field of mathematics classroom interaction as it nuances the epistemic management within these interactions and how this can contribute to the norms around the negotiation of meaning. 相似文献
12.
Bruce Russell 《Acta Analytica》2005,20(2):26-37
Contextualism is supposed to explain why the following argument for skepticism seems plausible: (1) I don’t know that I am
not a bodiless brain-in-a-vat (BIV); (2) If I know I have hands, then I know I am not a bodiless BIV; (3) Therefore, I do
not know I have hands. Keith DeRose claims that (1) and (2) are “initially plausible.” I claim that (1) is initially plausible
only because of an implicit argument that stands behind it; it is not intuitively plausible. The argument DeRose offers is
based on the requirement of sensitivity, that is, on the idea that if you know something then you would not believe it if
it were false. I criticize the sensitivity requirement thereby undercutting its support for (1) and the skeptical data that
contextualism is meant to explain. While skepticism is not a plausible ground for contextualism, I argue that certain pragmatic
considerations are. It’s plausible to think that to know something more evidence is required when more is at stake. The best
way to handle skepticism is to criticize the arguments for it. We should not adopt contextualism as a means of accommodating
skepticism even if there are other pragmatic reasons for being a contextualist about knowledge. 相似文献
13.
A. Sprzeuzkouski 《Journal of Optimization Theory and Applications》1976,18(1):103-118
It is shown that a saddle-point solution exists in a two-person, zero-sum game whose payoff is given by a matrix which is not completely defined. On the other hand, we show that such games do not always have a value, so that a saddle-point solution is not necessarily an optimal solution.This work was supported by the Centre d'Etudes Atomiques, Saclay, France. 相似文献
14.
Umed H. Karimov Dusan Repovs 《Proceedings of the American Mathematical Society》2004,132(7):2159-2162
In answer to a question of Michael, Dydak, Segal and Spiez have constructed a contractible polyhedron that is not strictly contractible. In the present note we prove a related result; by using alternative methods we show that there exist contractible polyhedra that are not simply (hence not strictly) contractible.
15.
Binary random variables often refer to such as customers that are present or not, roads that are open or not, machines that are operable or not. At the same time, stochastic programs often apply to situations where penalties are accumulated when demand is not met, travel times are too long, or profits too low. Typical for these situations is that the penalties imply a partial order on the scenarios, leading to a partition of the scenarios into two sets: those that can result in penalties for some decisions, and those that never lead to penalties. We demonstrate how this observation can be used to efficiently calculate out-of-sample values, find good scenario trees and generally simplify calculations. Most of our observations apply to general integer random variables, and not just the 0/1 case. 相似文献
16.
Volker Elling. 《Mathematics of Computation》2006,75(256):1721-1733
A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.
17.
The intuition while observing the economy of queueing systems, is that one’s motivation to join the system, decreases with
its level of congestion. Here we present a queueing model where sometimes the opposite is the case. The point of departure
is the standard first-come first-served single server queue with Poisson arrivals. Customers commence service immediately
if upon their arrival the server is idle. Otherwise, they are informed if the queue is empty or not. Then, they have to decide
whether to join or not. We assume that the customers are homogeneous and when they consider whether to join or not, they assess
their queueing costs against their reward due to service completion. As the whereabouts of customers interact, we look for
the (possibly mixed) join/do not join Nash equilibrium strategy, a strategy that if adopted by all, then under the resulting
steady-state conditions, no one has any incentive not to follow it oneself. We show that when the queue is empty then depending
on the service distribution, both ‘avoid the crowd’ (ATC) and ‘follow the crowd’ (FTC) scenarios (as well as none-of-the-above)
are possible. When the queue is not empty, the situation is always that of ATC. Also, we show that under Nash equilibrium
it is possible (depending on the service distribution) that the joining probability when the queue is empty is smaller than
it is when the queue is not empty.
This research was supported by The Israel Science Foundation Grant No. 237/02. 相似文献
18.
Mihai Ciucu 《Combinatorica》1996,16(3):321-324
A point set satisfies the Steinhaus property if no matter how it is placed on a plane, it covers exactly one integer lattice point. Whether or not such a set exists, is an open problem. Beck has proved [1] that any bounded set satisfying the Steinhaus property is not Lebesgue measurable. We show that any such set (bounded or not) must have empty interior. As a corollary, we deduce that closed sets do not have the Steinhaus property, fact noted by Sierpinski [3] under the additional assumption of boundedness. 相似文献
19.
J. APALOO 《Natural Resource Modeling》2005,18(4):521-535
ABSTRACT. The evolutionary stability concepts continuously stable strategies (CSS) and evolutionarily stable neighborhood invader strategies (ESNIS) share two properties in common. First, they are both evolutionarily stable strategies (ESS). Secondly, given any strategy in the close neighborhood of the CSS or ESNIS, there are some strategies that are closer to the CSS or ESNIS that can invade it. An ESNIS is a CSS but the converse is not true in general. We examine evolutionary adaptive dynamics in the neighborhood of a CSS that is not an ESNIS. We show that if an evolutionary game possesses a CSS which is not an ESNIS, the succession of strategies mediated by natural selection become arbitrarily close to the CSS but the precise value of the CSS cannot be attained unless the CSS is the first strategy to invade into the environment and is henceforth never perturbed. Thus if evolution does not start with the CSS that is not an ESNIS, we will have a phenomenon of bounded evolutionary succession that does not come to an end. The analysis is applied to a class of monomorphic population evolutionary game models in which species ecological interaction is modeled by the Lotka‐Volterra equations. 相似文献
20.
文献[1-2]认为当过程能力指数为零时,合格率却不为零的情形不符合常理。因而对过程能力指数C_p及C_(pk)公式提出质疑。本文从多个角度辨析这种质疑是不成立的. 相似文献