ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Don’t waste efforts in publishing without DOI. Get proper indexation and citation to the article by publishing it with a journal that is assigning DOI to your work

**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 32    Submit Your Rating     Cite This   Download        Certificate


    2 Author(s):  M. PAVITHRA, DR.R.M.S.PARVATHI

Vol -  10, Issue- 8 ,         Page(s) : 35 - 41  (2019 ) DOI :


In certain clustering tasks it is possible to obtain limited supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clusters. The resulting problem is known as semi-supervised clustering, an instance of semi-supervised learning stemming from a traditional unsupervised learning setting. Several algorithms exist for enhancing clustering quality by using supervision in the form of constraints [2]. These algorithms typically utilize the pairwise constraints to either modify the clustering objective function or to learn the clustering distortion measure. Semi-supervised clustering employs limited supervision in the form of labeled instances or pairwise instance constraints to aid unsupervised clustering and often significantly improves the clustering performance. Despite the vast amount of expert knowledge spent on this problem, most existing work is not designed for handling high-dimensional sparse data [4]. Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannot link constraints between pairs of examples. It presents a pairwise constrained clustering framework and a new method for actively selecting informative pairwise constraints to get improved clustering performance [6]. The clustering and active learning methods are both easily scalable to large datasets, and can handle very high dimensional data. Experimental and theoretical results confirm that this active querying of pairwise constraints significantly improves the accuracy of clustering when given a relatively small amount of supervision [5].

[1]. S. Basu, A. Banerjee, and R.J. Mooney, ‘Active semi-supervision for pairwise constrained clustering’, in ICDM, pp. 333–344, (2014).
[2]. S.J. Huang, R. Jin, and Z.H. Zhou, ‘Active learning by querying informative and representative examples’. NIPS, (2010)
[3]. S. Basu, M. Bilenko, and R.J. Mooney, ‘A probabilistic framework for semi-supervised clustering’, in SIGKDD, pp. 59–68. ACM, (2013).
[4]. P. Jain and A. Kapoor, ‘Active learning for large multi-class problems’, in CVPR, pp. 762–769. IEEE, (2009).
[5]. P.K. Mallapragada, R. Jin, and A.K. Jain, ‘Active query selection for semi-supervised clustering’, in ICPR, pp. 1–4. IEEE, (2008).
[6]. Q. Xu, M. Desjardins, and K. Wagstaff, ‘Active constrained clustering by examining spectral eigenvectors’, in Discovery Science, pp. 294– 307. Springer, (2005).
[7]. S.Rajan, J. Ghosh, and M.M. Crawford, “An active learning approach to hyper spectral data classification,” IEEE Trans. Geosci. Remote Sens., vol. 46, no. 4, pp. 1231–1242, Apr. 2008.
[8]. D. Cohn, Z. Ghahramani, and M. Jordan, “Active Learning with Statistical Models,” J. Artificial Intelligence Research, vol. 4, pp. 129- 145, 2016.
[9]. Y. Guo and D. Schuurmans, “Discriminative Batch Mode Active Learning,” Proc. Advances in Neural Information Processing Systems, pp. 593-600, 2008.
 [10]. S. Hoi, R. Jin, J. Zhu, and M. Lyu, “Batch Mode Active Learning and Its Application to Medical Image Classification,” Proc. 23rd Int’l Conf. Machine learning, pp.  417-424, 2006.

*Contents are provided by Authors of articles. Please contact us if you having any query.

Bank Details