Hybrid Clustering Approach for Term Partitioning in Document Data Sets
K.Thammi Reddy , M.Shashi  , L. Prathap Reddy 
Journal of Digital Information Management, Vol. 6, No. 3, 2008.
DOI: 
Link: http://www.dirf.org/jdim/v6n3a5.asp
Abstract:
Information retrieval is one of the major research areas due to accumulation of huge information in digital form. Various techniques of Information retrieval are based on the fact that terms contained in a document along with their frequency of occurrence signify the semantics of the document. Recent attempts to find the relevant document for a context represents documents in a vector space model as document-term vector containing term weights for every index term in that document. As there will be enormous number of index terms this leads to high dimensionality problem. We can reduce the dimensionality based on the observation that groups of terms associated with related concepts occur together or do not occur in a document based on whether the document is relevant or not to that concept. Such a group of terms is identified as an equivalence class and can be viewed as a single dimension in a Rough set based information retrieval system. In this paper we present a hybrid clustering approach for the formation of equivalence classes of terms associated with related concepts. It uses the outcome of hierarchical clustering to provide seed points for implementing Incremental K-means algorithm. Due to the sparsity of the term vector the cosine similarity estimate was found to be ineffective for term clustering. Another promising measure of proximity estimate used in information retrieval namely Euclidian distance has a drawback that it is biased towards changes in the term frequencies in larger documents when the term weights are represented by tf-idf estimates. Hence we propose normalization for tf-idf estimates while representing a term as a vector in a document space before clustering the terms.