{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:59Z","timestamp":1750309019672,"version":"3.41.0"},"reference-count":39,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7201","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T22:23:15Z","timestamp":1496269395000},"page":"1231-1241","source":"Crossref","is-referenced-by-count":0,"title":["Semi-Supervised Clustering Based on Exemplars Constraints"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Sailan","family":"WANG","sequence":"first","affiliation":[{"name":"School of Tourism, Sichuan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenzhi","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Jincheng Institute of SiChuan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Leshan Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjun","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Southwest Jiaotong University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"doi-asserted-by":"crossref","unstructured":"[1] S. Basu, I. Davidson, and K.L. Wagstaff, \u201cConstrained clustering,\u201d CRC Press, 2008.","key":"1","DOI":"10.1201\/9781584889977"},{"doi-asserted-by":"crossref","unstructured":"[2] O. Chapelle, A. Zien, and B. Scholkopf, Semi-supervised learning, MIT Press, 2006.","key":"2","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"unstructured":"[3] K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl, \u201cConstrained k-means clustering with background knowledge,\u201d ICML, pp.577-584, 2001.","key":"3"},{"unstructured":"[4] D. Klein, S.D. Kamvar, and C.D. Manning, \u201cFrom instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering,\u201d ICML, pp.307-314, 2002.","key":"4"},{"unstructured":"[5] N. Shental, A. Bar-Hillel, T. Hertz, and D. Weinshall, \u201cComputing gaussian mixture models with em using equivalence constraints,\u201d NIPS, pp.1-8, 2003.","key":"5"},{"doi-asserted-by":"crossref","unstructured":"[6] S. Basu, M. Bilenko, and R.J. Mooney, \u201cA probabilistic framework for semi-supervised clustering,\u201d KDD, pp.59-68, 2004.","key":"6","DOI":"10.1145\/1014052.1014062"},{"doi-asserted-by":"crossref","unstructured":"[7] M. Bilenko, S. Basu, and R.J. Mooney, \u201cIntegrating constraints and metric learning in semi-supervised clustering,\u201d ICML, pp.81-88, 2004.","key":"7","DOI":"10.1145\/1015330.1015360"},{"doi-asserted-by":"crossref","unstructured":"[8] B. Kulis, S. Basu, I. Dhillon, and R. Mooney, \u201cSemi-supervised graph clustering: a kernel approach,\u201d ICML, pp.457-464, 2005.","key":"8","DOI":"10.1145\/1102351.1102409"},{"unstructured":"[9] B. Yan and C. Domeniconi, \u201cAn adaptive kernel method for semi-supervised clustering,\u201d in Machine Learning: ECML 2006, vol.4212, pp.521-532, Springer, 2006.","key":"9"},{"doi-asserted-by":"crossref","unstructured":"[10] D.-Y. Yeung and H. Chang, \u201cA kernel approach for semi-supervised metric learning,\u201d IEEE Trans. Neural Netw., vol.18, no.1, pp.141-149, 2007.","key":"10","DOI":"10.1109\/TNN.2006.883723"},{"doi-asserted-by":"crossref","unstructured":"[11] S.C.H. Hoi, R. Jin, and M.R. Lyu, \u201cLearning nonparametric kernel matrices from pairwise constraints,\u201d ICML, pp.361-368, 2007.","key":"11","DOI":"10.1145\/1273496.1273542"},{"doi-asserted-by":"crossref","unstructured":"[12] M. Okabe and S. Yamada, \u201cLearning similarity matrix from constraints of relational neighbors,\u201d Journal of Advanced Computational Intelligence and Intelligent Informatics, vol.14, no.4, pp.402-407, 2010.","key":"12","DOI":"10.20965\/jaciii.2010.p0402"},{"unstructured":"[13] X. Yin, S. Chen, E. Hu, and D. Zhang, \u201cSemi-supervised clustering with metric learning: An adaptive kernel method,\u201d Pattern Recognition, vol.43, no.4, pp.1320-1333, 2010.","key":"13"},{"doi-asserted-by":"crossref","unstructured":"[14] T. Li, C. Ding, and M.I. Jordan, \u201cSolving consensus and semi-supervised clustering problems using nonnegative matrix factorization,\u201d ICDM, pp.577-582, 2007.","key":"14","DOI":"10.1109\/ICDM.2007.98"},{"doi-asserted-by":"crossref","unstructured":"[15] W. Tang, H. Xiong, S. Zhong, and J. Wu, \u201cEnhancing semi-supervised clustering: A feature projection perspective,\u201d KDD, pp.707-716, 2007.","key":"15","DOI":"10.1145\/1281192.1281268"},{"unstructured":"[16] D. Zhang, S. Chen, Z.H. Zhou, and Q. Yang, \u201cConstraint projections for ensemble learning,\u201d AAAI, pp.758-763, 2008.","key":"16"},{"doi-asserted-by":"crossref","unstructured":"[17] J.-H. Sublemontier, L. Martin, G. Cleuziou, and M. Exbrayat, \u201cIntegrating pairwise constraints into clustering algorithms: optimization-based approaches,\u201d Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on, pp.272-279, IEEE, 2011.","key":"17","DOI":"10.1109\/ICDMW.2011.103"},{"doi-asserted-by":"crossref","unstructured":"[18] H. Zeng and Y.-M. Cheung, \u201cSemi-supervised maximum margin clustering with pairwise constraints,\u201d IEEE Trans. Knowl. Data Eng., vol.24, no.5, pp.926-939, 2012.","key":"18","DOI":"10.1109\/TKDE.2011.68"},{"doi-asserted-by":"crossref","unstructured":"[19] J. Yu, D. Tao, Y. Rui, and J. Cheng, \u201cPairwise constraints based multiview features fusion for scene classification,\u201d Pattern Recognition, vol.46, no.2, pp.483-496, 2013.","key":"19","DOI":"10.1016\/j.patcog.2012.08.006"},{"doi-asserted-by":"crossref","unstructured":"[20] H. Jiang, Z. Ren, J. Xuan, and X. Wu, \u201cExtracting elite pairwise constraints for clustering,\u201d Neurocomputing, vol.99, pp.124-133, 2013.","key":"20","DOI":"10.1016\/j.neucom.2012.06.013"},{"unstructured":"[21] X. Wang, B. Qian, and I. Davidson, \u201cLabels vs pairwise constraints: A unified view of label propagation and constrained spectral clustering,\u201d ICDM, pp.1146-1151, 2012.","key":"21"},{"doi-asserted-by":"crossref","unstructured":"[22] T.F. Covoes, E.R. Hruschka, and J. Ghosh, \u201cCompetitive learning with pairwise constraints,\u201d IEEE Trans. Neural Netw. Learning Syst, vol.24, no.1, pp.164-169, 2013.","key":"22","DOI":"10.1109\/TNNLS.2012.2227064"},{"unstructured":"[23] E.R. Eaton, Clustering with propagated constraints, Thesis of the University of Maryland, 2005.","key":"23"},{"doi-asserted-by":"crossref","unstructured":"[24] J. Huang and H. Sun, \u201cLightly-supervised clustering using pairwise constraint propagation,\u201d 2008 3rd International Conference on Intelligent System and Knowledge Engineering, pp.765-770, 2008.","key":"24","DOI":"10.1109\/ISKE.2008.4731033"},{"unstructured":"[25] Q. Xu, M. desJardins, and K.L. Wagstaff, \u201cActive constrained clustering by examining spectral eigenvectors,\u201d Discovery Science, vol.3735, pp.294-307, Springer, 2005.","key":"25"},{"doi-asserted-by":"crossref","unstructured":"[26] S. Basu, A. Banerjee, and R.J. Mooney, \u201cActive semi-supervision for pairwise constrained clustering,\u201d SDM, pp.333-344, SIAM, 2004.","key":"26","DOI":"10.1137\/1.9781611972740.31"},{"unstructured":"[27] D.P. Kingma, S. Mohamed, D.J. Rezende, and M. Welling, \u201cSemi-supervised learning with deep generative models,\u201d Advances in Neural Information Processing Systems, pp.3581-3589, 2014.","key":"27"},{"unstructured":"[28] I. Davidson, K.L. Wagstaff, and S. Basu, \u201cMeasuring constraint-set utility for partitional clustering algorithms,\u201d Knowledge Discovery in Databases: PKDD 2006, vol.4213, pp.115-126, 2006.","key":"28"},{"unstructured":"[29] M. Mezard, \u201cWhere are the exemplars?,\u201d Science, vol.315, no.5814, pp.949-951, 2007.","key":"29"},{"unstructured":"[30] M. Khosla, K. Melhorn, and K. Panagiotou, Message Passing Algorithms, Ph.D. Thesis, Citeseer, 2009.","key":"30"},{"unstructured":"[31] B.J. Frey and D. Dueck, \u201cClustering by passing messages between data points,\u201d science, vol.315, no.5814, pp.972-976, 2007.","key":"31"},{"unstructured":"[32] A. Rodriguez and A. Laio, \u201cClustering by fast search and find of density peaks,\u201d Science, vol.344, no.6191, pp.1492-1496, 2014.","key":"32"},{"doi-asserted-by":"crossref","unstructured":"[33] Z. Li, J. Liu, and X. Tang, \u201cPairwise constraint propagation by semidefinite programming for semi-supervised classification,\u201d ICML, pp.576-583, 2008.","key":"33","DOI":"10.1145\/1390156.1390229"},{"unstructured":"[34] A. Strehl and J. Ghosh, \u201cCluster ensembles \u2014 a knowledge reuse framework for combining multiple partitions,\u201d J. Machine Learning Research, vol.3, pp.583-617, 2003.","key":"34"},{"doi-asserted-by":"crossref","unstructured":"[35] R.M. Neal and G.E. Hinton, \u201cA view of the em algorithm that justifies incremental, sparse, and other variants,\u201d in Learning in graphical models, pp.355-368, Springer, 1998.","key":"35","DOI":"10.1007\/978-94-011-5014-9_12"},{"unstructured":"[36] M. Bruneau and E. Magnin, \u201cConvergence of a stochastic approximation version of the em algorithm,\u201d J. American Oil Chemists Society, vol.55, no.4, pp.375-380, 1999.","key":"36"},{"unstructured":"[37] C. Wu, C. Yang, H. Zhao, and J. Zhu, \u201cOn the convergence of the em algorithm: From the statistical perspective,\u201d arXiv preprint arXiv:1611.00519, 2016.","key":"37"},{"doi-asserted-by":"crossref","unstructured":"[38] Z.H. Zhou and W. Tang, \u201cKnowledge-based systems,\u201d ICML, pp.77-83, 2006.","key":"38","DOI":"10.1016\/j.knosys.2005.11.003"},{"unstructured":"[39] S. Garcla, A. Fernndez, J. Luengo, and F. Herrera, \u201cAdvanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power,\u201d Information Sciences, vol.180, no.10, pp.2044-2064, 2010.","key":"39"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/6\/E100.D_2016EDP7201\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:03:35Z","timestamp":1750284215000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/6\/E100.D_2016EDP7201\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7201","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}