원문정보
초록
영어
Examining data to find similar data is a major problem in data mining and information retrieval. There are abundant documents that contain information. Most of those documents are duplicates or near duplicates and they increase storage space and cost time for searching for information needed. Reduction of dimensionality and well organization of data are the ways that can be used to solve the problem of efficiency. In this paper we proposed a method based mined frequent terms from each document to reduce the data size and efficient method for clustering documents that have close similarity between them. Using our method only 36.4% of original size has been used. The similarity between documents is based on frequent terms shared. Our method performs well on running time of O(n) whereas the current methods for clustering require O(n3).
목차
1. Introduction
2. Related Works
3. Proposed Method
3.1. Algorithm Description
3.2. Time Complexity Comparison
4. Experiment Results
5. Conclusion
Acknowledgements
References