| A dynamic cluster maintenance system for information retrieval |
| Full text |
Pdf
(938 KB)
|
| Source
|
Annual ACM Conference on Research and Development in Information Retrieval
archive
Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
table of contents
New Orleans, Louisiana, United States
Pages: 123 - 131
Year of Publication: 1987
ISBN:0-89791-232-2
|
|
Authors
|
|
F. Can
|
Dept. of System Analysis, Miami University, Oxford, Ohio
|
|
E. Ozkarahan
|
Dept. of Compute Science, Arizona State University, Tempe, Arizona
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 26, Citation Count: 3
|
|
|
ABSTRACT
Partitioning by clustering of very large databases is a necessity to reduce the space/time complexity of retrieval operations. However, the contemporary and modern retrieval environments demand dynamic maintenance of clusters. A new cluster maintenance strategy is proposed and its similarity/stability characteristics, cost analysis, and retrieval behavior in comparison with unclustered and completely reclustered database environments have been examined by means of a series of experiments.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Anderberg, M.R. Cluster Analysis for Applications. New York: Academic Press; 1973.
|
 |
2
|
|
| |
3
|
Can, F., 0zkarahan, E.A. Two Partitioning ~e C2ustering Algorithms. Journal of the erican Society for Information Science. Vol.35, No.5, pp.268-276; 1984.
|
| |
4
|
Can, F. A New CZustering Scheme for Infovma: tion Retrieval Systems Incorporating the Support of a Database Machine. Ph.D. dissertation, Department of Computer Engineering, Middle East Technical University; Ankara, January 1985.
|
 |
5
|
|
| |
6
|
Crouch, D.B., A File Organization and Maintenance Procedure for Dynamic Document Collec tions. Ii~orlTlIation Processing and Management. Vol. 11, pp. 11-21; 1975.
|
 |
7
|
|
| |
8
|
Kutluay, S. Validity Analysis of the Cover Coefficient Concept on 52ustering. Msc Thesis, Dept. of Electrical and Electronic Eng., Middle East Technical University; Ankara, 1986.
|
| |
9
|
Milligan, G.W., Soon, S.C., Sokol, L.M. The Effect of Cluster Size, D~mensionality, and Number of ~2usters on Recovery of True Cluster Structure. ~ Transactions on Pattern Analysis and Machine Intelligence. Vol.-PAMI-5 No. 1; 1983.
|
| |
10
|
|
| |
11
|
|
 |
12
|
|
| |
13
|
|
 |
14
|
|
| |
15
|
|
| |
16
|
Ural, M.H. Performanze Evaluation of the Cover Coefficient Based ~2ustering and C~uster Maintenance Methodology in Information Retrieval. Msc Thesis, Dept. of Electrical and Electronic Eng., Middle East Technical University; Ankara, 1986.
|
| |
17
|
|
CITED BY 3
|
|
|
|
|
Moses Charikar , Chandra Chekuri , Tomás Feder , Rajeev Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.626-635, May 04-06, 1997, El Paso, Texas, United States
|
|
|
|
|