Implementation Of ROCK Clustering Algorithm For The Optimization Of Query Searching Time
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 5
Abstract
Clustering is a data mining technique of grouping similar type of data or queries together which helps in identifying similar subject areas. The major problem is to identify heterogeneous subject areas where frequent queries are asked. There are number of agglomerative clustering algorithms which are used to cluster the data. The problem with these algorithms is that they make use of distance measures to calculate similarity. So the best suited algorithm for clustering the categorical data is Robust Clustering Using Links (ROCK) [1] algorithm because it uses Jaccard coefficient instead of using the distance measures to find the similarity between the data or documents to classify the clusters. The mechanism for classifying the clusters based on the similarity measure shall be used over a given set of data. This method will make clusters of the data corresponding to different subject areas so that a prior knowledge about similarity can be maintained which in turn will help to discover accurate and consistent clusters and will reduce the query response time. The main objective of our work is to implement ROCK [1] and to decrease the query response time by searching the documents in the resulted clusters instead of searching the whole database. This technique actually reduces the searching time of documents from the database.
Authors and Affiliations
Ashwina Tyagi , Sheetal Sharma
Keywords
Related Articles
- EP ID EP92670
- DOI -
- Views 110
- Downloads 0
A PATTERN BASED KEY GENERATION TO AUTHENTICATION FOR MULTIHOP ROUTING IN WMSN
Recent research work in the Wireless Sensor Networks involves the homogeneous networks in which the sensor nodes in the specific cluster can get the key value from any other cluster. Most existing key management schemes...
Meta-Content framework for back index generation
Book reading is a common thing which every one of us does in our life. A common strategy to spot a page for reading is to use front index and back index. A front index generally contains the sections and subsections topi...
A Proposed Encoding and Hiding Text in an Image by using Fractal Image Compression
The problem of protecting data and information originates from the dependency upon encryption and steganography separately. Therefore, it is easy to break them and detecting the contents of the secret massages available...
Backpropagation Learning Algorithms for Email Classification.
Today email has become one the fastest and most effective form of communication. The popularity of this mode of transmitting goods, information and services has motivated spammers to perfect their technical skills to foo...
SUPPORT VECTOR MACHINE BASED GUJARATI NUMERAL RECOGNITION
In this paper we propose the Support Vector Machine (SVM) based recognition scheme towards the recognition of Gujarati handwritten numerals. The preprocessing is done considering morphological operations. For computing t...