Axioms to Characterize Efficient Incremental Clustering

Bandyopadhyay, Sambaran and Murty, M Narasimha (2017) Axioms to Characterize Efficient Incremental Clustering. In: 23rd International Conference on Pattern Recognition (ICPR), DEC 04-08, 2016, Mexican Assoc Comp Vis Robot & Neural Comp, Cancun, MEXICO, pp. 450-455.

PDF Int_Con_Pat_Rec_450_2017.pdf - Published Version Restricted to Registered users only Download (276kB) | Request a copy

Abstract

Although clustering is one of the central tasks in machine learning for the last few decades, analysis of clustering irrespective of any particular algorithm was not undertaken for a long time. In the recent literature, axiomatic frameworks have been proposed for clustering and its quality. But none of the proposed frameworks has concentrated on the computational aspects of clustering, which is essential in current big data analytics. In this paper, we propose an axiomatic framework for clustering which considers both the quality and the computational complexity of clustering algorithms. The axioms proposed by us necessarily associate the problem of clustering with the important concept of incremental learning and divide and conquer learning. We also propose an order independent incremental clustering algorithm which satisfies all of these axioms in some constrained manner.

Item Type:	Conference Paper
Series.:	International Conference on Pattern Recognition
Additional Information:	Copy right for this article belongs to the IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	07 Oct 2017 06:06
Last Modified:	07 Oct 2017 06:06
URI:	http://eprints.iisc.ac.in/id/eprint/57996

Actions (login required)

View Item