نتایج جستجو برای: cluster approximation

تعداد نتایج: 393694  

2000
Wim Wiegerinck

Recently, variational approximations such as the mean field approximation have received much interest. We extend the standard mean field method by using an approximating dis­ tribution that factorises into cluster poten­ tials. This includes undirected graphs, di­ rected acyclic graphs and junction trees. We derive generalised mean field equations to op­ timise the cluster potentials. We show t...

Journal: :Comput. Meth. in Appl. Math. 2014
Dietmar Gallistl

This paper analyses an adaptive nonconforming finite element method for eigenvalue clusters of self-adjoint operators and proves optimal convergence rates (with respect to the concept of nonlinear approximation classes) for the approximation of the invariant subspace spanned by the eigenfunctions of the eigenvalue cluster. Applications include eigenvalues of the Laplacian and of the Stokes system.

2006
Duoqian Miao Min Chen Zhihua Wei Qiguo Duan

Due to the uncertainty in accessing web pages, analysis of web logs faces some challenges. Several rough k-means cluster algorithms have been proposed and successfully applied to web usage mining. However, they did not explain why rough approximations of these cluster algorithms were introduced. This paper analyzes the characteristics of the data in the boundary areas of clusters, and then a ro...

2010
Sanjib Sadhu Arijit Bishnu Subhas C. Nandy Partha P. Goswami

The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A logn-factor approximation algorithm is proposed.

Journal: :Physical review 2021

We perform a detailed study of the phase transitions and mechanisms electron localization in extended Hubbard model using dynamical cluster approximation on $2\times 2$ cluster. explore interplay charge order Mott physics. find that nearest-neighbor Coulomb interaction $V$ causes "screening" effects close to transition, pushing boundary larger values $U$. also demonstrate different correlations...

1997
Iead A. Rezek Stephen J. Roberts

In metric space theory connectedness can be described in terms of a mapping of sets onto the real axis. This function is essentially a labelling function which clustering methods approximate. With the use of metric space theory a proposition and a conjecture are given which are implemented to perform unsupervised clustering which lacks many of the limitations of other, model-based, methods.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید