Results 201 to 210 of about 3,432 (233)
Some of the next articles are maybe not open access.
Clusterability and Centroid Approximation
2003Identifying clusters in a dataset is valuable. Most existing data clustering algorithms need the number of clusters as an input. The present paper introduces a graphical method that outputs the number of clusters. Once the number of clusters is calculated, other clustering algorithms may use it. This method is cubic in the number of input data.
Alina Romero, Mukkai S. Krishnamoorthy
openaire +1 more source
An Introduction to Centroid Cephalometrics
British Journal of Orthodontics, 1982Traditional cephalometry has depended upon measuring the relationship of anatomical points and lines (or planes) to each other. A centroid approach defines two relatively stable lines, each of which can be used for reference purposes and for analysing craniofacial changes elsewhere.
J S, Johnson, R J, Hubbold
openaire +2 more sources
Algorithms for computing centroids
Computers & Operations Research, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark J. Kaiser, Thomas L. Morin
openaire +3 more sources
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
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 +2 more sources
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 +2 more sources
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
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

