Results 171 to 180 of about 1,206 (204)
Some of the next articles are maybe not open access.
Algorithms for computing centroids
Computers & Operations Research, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark J. Kaiser, Thomas L. Morin
openaire +2 more sources
Centers to centroids in graphs
Journal of Graph Theory, 1978AbstractFor S ⊆ V(G) the S‐center and S‐centroid of G are defined as the collection of vertices u ∈ V(G) that minimize es(u) = max {d(u, v): v ∈ S} and ds(u) = ∑u∈S d(u, v), respectively. This generalizes the standard definition of center and centroid from the special case of S = V(G). For 1 ⩽ k ⩽|V(G)| and u ∈ V(G) let rk(u) = max {∑s∈S d(u, s): S ⊆ V(
openaire +1 more source
Algebra and Logic, 2012
The author looks at connections between two known analogs of the concept of a ring centroid in the class of algebraic groups.
openaire +2 more sources
The author looks at connections between two known analogs of the concept of a ring centroid in the class of algebraic groups.
openaire +2 more sources
Proceedings of the 2019 2nd International Conference on Data Science and Information Technology, 2019
A weakness of the classic K means algorithm uses a random method for initializing centroids since it will produce random results that is unpredictable making it unreliable. The enhanced K means algorithm uses an innovative solution through a new method called Centroid 360 that is consistent and uses radius and 360 degrees to distribute centroid ...
Jovy Jay D. Cabrera +2 more
openaire +1 more source
A weakness of the classic K means algorithm uses a random method for initializing centroids since it will produce random results that is unpredictable making it unreliable. The enhanced K means algorithm uses an innovative solution through a new method called Centroid 360 that is consistent and uses radius and 360 degrees to distribute centroid ...
Jovy Jay D. Cabrera +2 more
openaire +1 more source
Center, Centroid, Extended Centroid, and Quotients of Jordan Systems
Communications in Algebra, 2006In this article we prove that the extended centroid of a nondegenerate Jordan system is isomorphic to the centroid (and to the center in the case of Jordan algebras) of its maximal Martindale-like system of quotients with respect to the filter of all essential ideals.
Esther García, Miguel Gómez Lozano
openaire +1 more source
2018
Centroid terms are single words that semantically and topically characterise text documents and thus can act as their very compact representation in automatic text processing tasks. In this paper, a novel brain-inspired approach is presented to first simplify the determination of centroid terms and second to generalise the underlying concept at the ...
H. Unger, M. M. Kubek
openaire +1 more source
Centroid terms are single words that semantically and topically characterise text documents and thus can act as their very compact representation in automatic text processing tasks. In this paper, a novel brain-inspired approach is presented to first simplify the determination of centroid terms and second to generalise the underlying concept at the ...
H. Unger, M. M. Kubek
openaire +1 more source
Pattern recognition with generalized centroids and subcentroids
Applied Optics, 2005We propose a class of generalized moment functions (GMFs) that can be used to determine a set of geometric points, namely, generalized centroids (G centroids), within an object. Based on a linear GMF, a mass centroid and its subcentroids can be defined and extracted, which provide information on the location and orientation of an object.
Chang, Shoude, Grover, C. P.
openaire +2 more sources
On the centroid of recursive trees [PDF]
Australas. J Comb., 2002 A recursive tree is a rooted tree with the vertices labeled \(1, 2, \ldots, n\), such that any node has a higher label than its parent. This paper gives exact values for the average distance between the root and the (nearest) centroid over all recursive trees with \(n\) nodes. This average distance tends to 1 when \(n\) goes to infinity.
openaire +1 more source
Networks, 1991
AbstractIf k is a nonnegative integer and x is a vertex of a tree T, the k‐ball branch weight of x, denoted b(x;k), is the number of vertices in a largest subtree of T, all of whose vertices are a distance at least k + 1 from x. The k‐ball branch weight centroid of T, denoted W(T;k), consists of all vertices x of T for which b(x;k) is a minimum.
openaire +1 more source
AbstractIf k is a nonnegative integer and x is a vertex of a tree T, the k‐ball branch weight of x, denoted b(x;k), is the number of vertices in a largest subtree of T, all of whose vertices are a distance at least k + 1 from x. The k‐ball branch weight centroid of T, denoted W(T;k), consists of all vertices x of T for which b(x;k) is a minimum.
openaire +1 more source
The Optimality of the Centroid Method
Psychometrika, 2003The aim of this note is to show that the centroid method has two optimality properties. It yields loadings with the highest sum of absolute values, even in absence of the constraint that the squared component weights be equal. In addition, it yields scores with maximum variance, subject to the constraint that none of the squared component weights be ...
openaire +2 more sources