Constrained clustering: Difference between revisions
m Task 18 (cosmetic): eval 3 templates: hyphenate params (3×); |
|||
| Line 8: | Line 8: | ||
| year = 2014 |
| year = 2014 |
||
| title = Model Selection for Semi-Supervised Clustering |
| title = Model Selection for Semi-Supervised Clustering |
||
| |
| book-title = Proceedings of the 17th International Conference on Extending Database Technology (EDBT) |
||
| pages = 331–342 |
| pages = 331–342 |
||
| doi = 10.5441/002/edbt.2014.31 |
| doi = 10.5441/002/edbt.2014.31 |
||
| Line 24: | Line 24: | ||
| year = 2001 |
| year = 2001 |
||
| title = Constrained K-means Clustering with Background Knowledge |
| title = Constrained K-means Clustering with Background Knowledge |
||
| |
| book-title = Proceedings of the Eighteenth International Conference on Machine Learning. |
||
| pages = 577–584 |
| pages = 577–584 |
||
}}</ref> |
}}</ref> |
||
| Line 32: | Line 32: | ||
| year = 2012 |
| year = 2012 |
||
| title = Constrained Clustering with Minkowski Weighted K-Means |
| title = Constrained Clustering with Minkowski Weighted K-Means |
||
| |
| book-title = Proceedings of the 13th IEEE International Symposium on Computational Intelligence and Informatics |
||
| pages = 13–17 |
| pages = 13–17 |
||
| doi=10.1109/CINTI.2012.6496753 |
| doi=10.1109/CINTI.2012.6496753 |
||
Revision as of 14:52, 13 January 2021
In computer science, constrained clustering is a class of semi-supervised learning algorithms. Typically, constrained clustering incorporates either a set of must-link constraints, cannot-link constraints, or both, with a Data clustering algorithm. Both a must-link and a cannot-link constraint define a relationship between two data instances. A must-link constraint is used to specify that the two instances in the must-link relation should be associated with the same cluster. A cannot-link constraint is used to specify that the two instances in the cannot-link relation should not be associated with the same cluster. These sets of constraints acts as a guide for which a constrained clustering algorithm will attempt to find clusters in a data set which satisfy the specified must-link and cannot-link constraints. Some constrained clustering algorithms will abort if no such clustering exists which satisfies the specified constraints. Others will try to minimize the amount of constraint violation should it be impossible to find a clustering which satisfies the constraints. Constraints could also be used to guide the selection of a clustering model among several possible solutions. [1]
A cluster in which the members conform to all must-link and cannot-link constraints is called a chunklet.
Examples
Examples of constrained clustering algorithms include:
- COP K-means [2]
- PCKmeans (Pairwise Constrained K-means) [3]
- CMWK-Means (Constrained Minkowski Weighted K-Means) [4]
References
- ^ Pourrajabi, M.; Moulavi, D.; Campello, R. J. G. B.; Zimek, A.; Sander, J.; Goebel, R. (2014). "Model Selection for Semi-Supervised Clustering". Proceedings of the 17th International Conference on Extending Database Technology (EDBT). pp. 331–342. doi:10.5441/002/edbt.2014.31.
- ^ Wagstaff, K.; Cardie, C.; Rogers, S.; Schrödl, S. (2001). "Constrained K-means Clustering with Background Knowledge". Proceedings of the Eighteenth International Conference on Machine Learning. pp. 577–584.
- ^ http://www.cs.utexas.edu/~ml/papers/semi-sdm-04.pdf
- ^ de Amorim, R. C. (2012). "Constrained Clustering with Minkowski Weighted K-Means". Proceedings of the 13th IEEE International Symposium on Computational Intelligence and Informatics. pp. 13–17. doi:10.1109/CINTI.2012.6496753.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |