Soft clustering by convex electoral model
نویسندگان
چکیده
منابع مشابه
Model-based Clustering with Soft Balancing
Balanced clustering algorithms can be useful in a variety of applications and have recently attracted increasing research interest. Most recent work, however, addressed only hard balancing by constraining each cluster to have equal or a certain minimum number of data objects. This paper provides a soft balancing strategy built upon a soft mixtureof-models clustering framework. This strategy con...
متن کاملConvex Multi-Task Learning by Clustering
We consider the problem of multi-task learning in which tasks belong to hidden clusters. We formulate the learning problem as a novel convex optimization problem in which linear classifiers are combinations of (a small number of) some basis. Our formulation jointly learns both the basis and the linear combination. We propose a scalable optimization algorithm for finding the optimal solution. Ou...
متن کاملIntegration of cache-based model and topic dependent class model with soft clustering and soft voting
A topic dependent class (TDC) [1] language model (LM) is a topic-based LM that uses a semantic extraction method to reveal latent topic information from nouns relation. Then a clustering for a given context is performed to define topics. Finally, a fixed window of word history is observed to decide the topic of the current event through voting in online manner. Previously, we have shown that TD...
متن کاملSparse Convex Clustering
Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering sc...
متن کاملModel-based Clustering With Soft And Probabilistic Constraints
The problem of clustering with constraints has received a lot of attention lately. Many existing algorithms assume the specified constraints are correct and consistent. We take a new approach and model a constraint as a random variable. This enables us to model the uncertainty of constraints in a principled manner. The effect of constraints can be readily propagated to the neighborhood by biasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2020
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-020-05148-4