scispace - formally typeset
Search or ask a question
Topic

Centroid

About: Centroid is a research topic. Over the lifetime, 4110 publications have been published within this topic receiving 53637 citations. The topic is also known as: barycenter (geometry) & geometric center of a plane figure.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, a methodology that combines differential evolution, an evolutionary optimization scheme, and the Geometric Centroid of Precision Positions technique for mechanism synthesis is presented for the synthesis of six-bar linkages for dwell and dual-dwell mechanisms with prescribed timing and transmission angle constraints.

93 citations

Patent
William Scott Spangler1
20 Sep 2001
TL;DR: In this article, a method and structure for clustering documents in datasets which include clustering first documents and a first dataset to produce first document classes, creating centroid seeds based on the first documents classes, and clustering second documents in a second dataset using the centroid seed, wherein the first dataset and the second dataset are related.
Abstract: A method and structure for clustering documents in datasets which include clustering first documents and a first dataset to produce first document classes, creating centroid seeds based on the first document classes, and clustering second documents in a second dataset using the centroid seeds, wherein the first dataset and the second dataset are related. The clustering of the first documents in the first dataset forms a first dictionary of most common words in the first dataset and generates a first vector space model by counting, for each word in the first dictionary, a number of the first documents in which the word occurs, and clusters the first documents in the first dataset based on the first vector space model, and further generates a second vector space model by counting, for each word in the first dictionary, a number of the second documents in which the word occurs. Creation of the centroid seeds includes classifying second vector space model using the first document classes to produce a classified second vector space model and determining a mean of vectors in each class in the classified second vector space model, the mean includes the centroid seeds.

92 citations

Proceedings ArticleDOI
01 Jun 2019
TL;DR: This paper design a unified objective without accessing the source domain data and adopt an alternating minimization scheme to iteratively discover the pseudo target labels, invariant subspace, and target centroids, which could be regarded as a well-performing baseline for domain adaptation tasks.
Abstract: Conventional domain adaptation methods usually resort to deep neural networks or subspace learning to find invariant representations across domains. However, most deep learning methods highly rely on large-size source domains and are computationally expensive to train, while subspace learning methods always have a quadratic time complexity that suffers from the large domain size. This paper provides a simple and efficient solution, which could be regarded as a well-performing baseline for domain adaptation tasks. Our method is built upon the nearest centroid classifier, seeking a subspace where the centroids in the target domain are moderately shifted from those in the source domain. Specifically, we design a unified objective without accessing the source domain data and adopt an alternating minimization scheme to iteratively discover the pseudo target labels, invariant subspace, and target centroids. Besides its privacy-preserving property (distant supervision), the algorithm is provably convergent and has a promising linear time complexity. In addition, the proposed method can be readily extended to multi-source setting and domain generalization, and it remarkably enhances popular deep adaptation methods by borrowing the learned transferable features. Extensive experiments on several benchmarks including object, digit, and face recognition datasets validate that our methods yield state-of-the-art results in various domain adaptation tasks.

91 citations

Proceedings ArticleDOI
Yi Wang1, Yuexian Zou1
19 Aug 2016
TL;DR: Experimental results show that the proposed fast DE-VOC method is comparable with mainstream ones on counting accuracy while running much faster in testing phase.
Abstract: Density estimation based visual object counting (DE-VOC) methods estimate the counts of an image by integrating over its predicted density map. They perform effectively but inefficiently. This paper proposes a fast DE-VOC method but maintains its effectiveness. Essentially, the feature space of image patches from VOC can be clustered into subspaces, and the examples of each subspace can be collected to learn its embedding. Also, it is assumed that the neighborhood embeddings of image patches and their corresponding density maps generated from training images are similar. With these principles, a closed form DE-VOC algorithm is derived, where the embedding and centroid of each neighborhood are precomputed by the training samples. Consequently, the density map of a given patch is estimated by simple classification and mapping. Experimental results show that our proposed method is comparable with mainstream ones on counting accuracy while running much faster in testing phase.

88 citations

Journal Article
TL;DR: The simulation experiment with IRIS data set shows that the proposed algorithm converges faster and the value k found is close to the actual value, which proves the validity of the algorithm.
Abstract: Aiming at the problemsof too much iterative times in selecting initial centroids stochastically for K-Means algorithm,a method is proposed to optimize the initial centroids through cutting the set into k segmentations and select one point in each segmentation as initial centroids for iterative computing. A new valid function called clustering-index is defined as the sum of clustering-density and clustering-significance and can be used to search the optimization of k in the internal of [1,n(1/2) ]. The simulation experiment with IRIS data set shows that the proposed algorithm converges faster and the value k found is close to the actual value,which proves the validity of the algorithm.

88 citations


Network Information
Related Topics (5)
Cluster analysis
146.5K papers, 2.9M citations
84% related
Fuzzy logic
151.2K papers, 2.3M citations
78% related
Artificial neural network
207K papers, 4.5M citations
75% related
Image processing
229.9K papers, 3.5M citations
75% related
Feature extraction
111.8K papers, 2.1M citations
75% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023492
20221,001
2021184
2020202
2019269
2018271