Welcome to the InfoSci Platform
Reference Hub1
Rough Set Based Clustering Using Active Learning Approach

Rough Set Based Clustering Using Active Learning Approach

Rekha Kandwal, Prerna Mahajan, Ritu Vijay
Copyright: © 2011 |Volume: 2 |Issue: 4 |Pages: 12
ISSN: 1947-3087|EISSN: 1947-3079|EISBN13: 9781613505762|DOI: 10.4018/jalr.2011100102
Cite Article Cite Article

MLA

Kandwal, Rekha, et al. "Rough Set Based Clustering Using Active Learning Approach." IJALR vol.2, no.4 2011: pp.12-23. http://doi.org/10.4018/jalr.2011100102

APA

Kandwal, R., Mahajan, P., & Vijay, R. (2011). Rough Set Based Clustering Using Active Learning Approach. International Journal of Artificial Life Research (IJALR), 2(4), 12-23. http://doi.org/10.4018/jalr.2011100102

Chicago

Kandwal, Rekha, Prerna Mahajan, and Ritu Vijay. "Rough Set Based Clustering Using Active Learning Approach," International Journal of Artificial Life Research (IJALR) 2, no.4: 12-23. http://doi.org/10.4018/jalr.2011100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper revisits the problem of active learning and decision making when the cost of labeling incurs cost and unlabeled data is available in abundance. In many real world applications large amounts of data are available but the cost of correctly labeling it prohibits its use. In such cases, active learning can be employed. In this paper the authors propose rough set based clustering using active learning approach. The authors extend the basic notion of Hamming distance to propose a dissimilarity measure which helps in finding the approximations of clusters in the given data set. The underlying theoretical background for this decision is rough set theory. The authors have investigated our algorithm on the benchmark data sets from UCI machine learning repository which have shown promising results.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.