Enhancing instance-level constrained clustering through differential evolution
Clustering has always been a powerful tool in knowledge discovery. Traditionally
unsupervised, it received renewed attention when it was shown to produce better results …
unsupervised, it received renewed attention when it was shown to produce better results …
DILS: constrained clustering through dual iterative local search
Clustering has always been a powerful tool in knowledge discovery. Traditionally
unsupervised, it has received renewed attention recently as it has shown to produce better …
unsupervised, it has received renewed attention recently as it has shown to produce better …
A new knowledge-based constrained clustering approach: Theory and application in direct marketing
A Seret, T Verbraken, B Baesens - Applied Soft Computing, 2014 - Elsevier
Clustering has always been an exploratory but critical step in the knowledge discovery
process. Often unsupervised, the clustering task received a huge interest when reinforced by …
process. Often unsupervised, the clustering task received a huge interest when reinforced by …
Initializing FWSA K-Means With Feature Level Constraints
Z He - IEEE Access, 2022 - ieeexplore.ieee.org
Weighted K-Means (WKM) algorithms are increasingly important with the increase of data
dimension. WKM faces an initialization problem that is more complicated than K-Means' …
dimension. WKM faces an initialization problem that is more complicated than K-Means' …
Active seed selection for constrained clustering
VV Vu, N Labroche - Intelligent Data Analysis, 2017 - content.iospress.com
Active learning for semi-supervised clustering allows algorithms to solicit a domain expert to
provide side information as instances constraints, for example a set of labeled instances …
provide side information as instances constraints, for example a set of labeled instances …
An incremental group-specific framework based on community detection for cold start recommendation
To address cold start problem by utilizing only rating information, this paper proposes an
incremental group-specific framework for recommender systems. Firstly, a decoupled …
incremental group-specific framework for recommender systems. Firstly, a decoupled …
MAPK-means: A clustering algorithm with quantitative preferences on attributes
This paper describes a new semi-supervised clustering algorithm as part of a more general
framework of interactive exploratory clustering, that favors the exploration of possible …
framework of interactive exploratory clustering, that favors the exploration of possible …
Clustering with quantitative user preferences on attributes
This paper proposes a new semi-supervised clustering framework to represent and integrate
quantitative preferences on attributes. A new metric learning algorithm is derived that …
quantitative preferences on attributes. A new metric learning algorithm is derived that …
An effective semi-supervised clustering framework integrating pairwise constraints and attribute preferences
Both the instance level knowledge and the attribute level knowledge can improve clustering
quality, but how to effectively utilize both of them is an essential problem to solve. This paper …
quality, but how to effectively utilize both of them is an essential problem to solve. This paper …
APROXIMATION TO THE THEORY OF AFFINITIES TO MANAGE THE PROBLEMS OF THE GROUPING PROCESS
AM GIL-LAFUENTE, A Klimova - Computational Intelligence In …, 2010 - World Scientific
Perhaps more than ever, new economic and enterprise needs have increased the interest
and utility of the methods of the grou** process based on the theory of uncertainty. We …
and utility of the methods of the grou** process based on the theory of uncertainty. We …