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

An Efficient Algorithm for Reliability Upper Bound of Distributed Systems with Unreliable Nodes

Abstract— The reliability of distributed systems in which the communication links are considered reliable while the computing nodes may fail with certain probabilities have been modeled by a probabilistic network or a gr...

MESSAGE INDUCED SOFT CHEKPOINTING FOR RECOVERY IN MOBILE ENVIRONMENTS

Checkpointing is one of the commonly used techniques to provide fault tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are cons...

A Heuristic Approach to the Disease Diagnose System Using Machine Learning Algorithms

Abstract--The paper deals with the concepts of expert system and data mining belongs to the Artificial Intelligence fields. The main task of expert system is to ratiocination, while the machine learning algorithm is to f...

Wide Area Network’s Reliability Redundancy Design Using Simulation

Reliability is the main characteristic to evaluate the performance of WAN's. The devices used in the network and their availability in the market make the network to give services without interruptions. Redundant network...

INTERNAL COMPACT PRINTED LOOP ANTENNA WITH MATCHING ELEMENT FOR LAPTOP APPLICATIONS

An internal compact printed loop antenna with matching element is presented for laptop applications. Bending to the printed loop structure is employed to reduce the size of antenna. A matching element is used at backside...

Download PDF file
  • EP ID EP92670
  • DOI -
  • Views 99
  • Downloads 0

How To Cite

Ashwina Tyagi, Sheetal Sharma (2012). Implementation Of ROCK Clustering Algorithm For The Optimization Of Query Searching Time. International Journal on Computer Science and Engineering, 4(5), 809-815. https://europub.co.uk/articles/-A-92670