z-logo
open-access-imgOpen Access
Cosine-Based Clustering Algorithm Approach
Author(s) -
Mohammed Lubbad,
Wesam M. Ashour
Publication year - 2012
Publication title -
international journal of intelligent systems and applications
Language(s) - English
Resource type - Journals
eISSN - 2074-9058
pISSN - 2074-904X
DOI - 10.5815/ijisa.2012.01.07
Subject(s) - cluster analysis , computer science , data mining , trigonometric functions , algorithm , outlier , property (philosophy) , cluster (spacecraft) , transformation (genetics) , pattern recognition (psychology) , artificial intelligence , mathematics , philosophy , biochemistry , chemistry , geometry , epistemology , gene , programming language
Due to many applications need the management of spatial data; clustering large spatial databases is an important problem which tries to find the densely populated regions in the feature space to be used in data mining, knowledge discovery, or efficient information retrieval. A good clustering approach should be efficient and detect clusters of arbitrary shapes. It must be insensitive to the outliers (noise) and the order of input data. In this paper Cosine Cluster is proposed based on cosine transformation, which satisfies all the above requirements. Using multi-resolution property of cosine transforms, arbitrary shape clusters can be effectively identified at different degrees of accuracy. Cosine Cluster is also approved to be highly efficient in terms of time complexity. Experimental results on very large data sets are presented, which show the efficiency and effectiveness of the proposed approach compared to other recent clustering methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom