ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Hybrid approaches for clustering

Kankanala, Laxmi and Narasimha Murty, M (2007) Hybrid approaches for clustering. In: Proceedings of Pattern Recognition and Machine Intelligence (PREMI 2007), Lecture Notes in Computer Science, LNCS 4815, Springer.

[img] PDF
Hybrid_Approaches.pdf - Published Version
Restricted to Registered users only

Download (294Kb) | Request a copy
Official URL: http://www.springerlink.com/content/74530j06662n54...

Abstract

Applications in various domains often lead to very large and frequently high-dimensional data. Successful algorithms must avoid the curse of dimensionality but at the same time should be computationally efficient. Finding useful patterns in large datasets has attracted considerable interest recently. The primary goal of the paper is to implement an efficient Hybrid Tree based clustering method based on CF-Tree and KD-Tree, and combine the clustering methods with KNN-Classification. The implementation of the algorithm involves many issues like good accuracy, less space and less time. We will evaluate the time and space efficiency, data input order sensitivity, and clustering quality through several experiments.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 18 Oct 2011 04:50
Last Modified: 18 Oct 2011 04:50
URI: http://eprints.iisc.ernet.in/id/eprint/41494

Actions (login required)

View Item View Item