A framework for deep constrained clustering
نویسندگان
چکیده
The area of constrained clustering has been extensively explored by researchers and used practitioners. Constrained formulations exist for popular algorithms such as k-means, mixture models, spectral but have several limitations. A fundamental strength deep learning is its flexibility, here we explore a framework in particular how it can extend the field clustering. We show that our not only handle standard together/apart constraints (without well documented negative effects reported earlier) generated from labeled side information more complex new types continuous values high-level domain knowledge. Furthermore, propose an efficient training paradigm generally applicable to these four constraints. validate effectiveness approach empirical results on both image text datasets. also study robustness when with noisy different components contribute final performance. Our source code available at: http://github.com/blueocean92 .
منابع مشابه
A Declarative Framework for Constrained Clustering
In recent years, clustering has been extended to constrained clustering, so as to integrate knowledge on objects or on clusters, but adding such constraints generally requires to develop new algorithms. We propose a declarative and generic framework, based on Constraint Programming, which enables to design clustering tasks by specifying an optimization criterion and some constraints either on t...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملA SAT-based Framework for Efficient Constrained Clustering
The area of clustering under constraints has recently received much attention in the data mining community. However, most work involves adding constraints to existing algorithms which, although being quite pragmatic, raises several difficulties. Examples of these difficulties include creating intractable constraint satisfaction sub-problems and constrained clustering algorithms that are easily ...
متن کاملa framework for identifying and prioritizing factors affecting customers’ online shopping behavior in iran
the purpose of this study is identifying effective factors which make customers shop online in iran and investigating the importance of discovered factors in online customers’ decision. in the identifying phase, to discover the factors affecting online shopping behavior of customers in iran, the derived reference model summarizing antecedents of online shopping proposed by change et al. was us...
15 صفحه اولA fast algorithm for robust constrained clustering
The application of “concentration” steps is the main principle behind Forgy’s kmeans algorithm and Rousseeuw and van Driessen’s fast-MCD algorithm. Although they share this principle, it is not completely straightforward to combine both algorithms for developing a clustering method which is not affected by a certain proportion of outlying observations and that is able to cope with non spherical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2021
ISSN: ['1573-756X', '1384-5810']
DOI: https://doi.org/10.1007/s10618-020-00734-4