Hierarchic document clustering using ward's method

Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986

Volumn , Issue , 1986, Pages 149-156

  El Hamdouchi, A ^a   Willett, P ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; HEURISTIC METHODS; INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; NEAREST NEIGHBOR SEARCH;

AUTOMATIC CLASSIFICATION; CLUSTERING METHODS; DISSIMILARITY MATRIX; DOCUMENT CLUSTERING; NEAREST NEIGHBOUR; WARD'S METHOD;

CLUSTERING ALGORITHMS;

EID: 84984723939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/253168.253200     Document Type: Conference Paper

References (29)

1. [BENT80] Bentley, J. L., Weide, B.W. and Yao, A.C. (1980), "Optimal Expected-Time Algorithms for Closest Point Problems, " ACH Transactions on Mathematical Software, 6, 563-580.
2. [CROF77] Croft, W.B. (1977), "Clusterir Urge Files of Docunents Using the Single-Link Method, " Journal of the Anerlcan Society for Information Science, 28, 341-344.
3. [CROF80] Croft, W.B. (1980), "A Hodel of Cluster Searching Using Classification, " Information Systems, 5, 189-195.
4. [DAIE84] Day, W.H.E and Edelsbrmner, H. (1984), "Efficient Algorithms for Agglaneratlve Hierarchical Clustering Methods, " Journal of Classification, 1, 7-24.
5. [DEFA77] Defays, D. (1977), "An Efficient Algorithm for a Complete Link Method, " Computer Journal, 20, 93-95.
6. [FRIE77] Friedman, J. H., Bentley, J.L. and Finkel, R.A. (1977), "An Algorithm for Findii® Best Hatches in Logarithmic Expected lime, " ACM Transactions on Ha them at leal Software. 3, 209226.
7. [GOFF69] Goffman, W. (1969), "An Indirect Method of Information Retrieval, " Information Storage and Retrieval, 1, 363-373.
8. [GRIF8 ] Griffiths, A., Robinson, L. A. and Hillett, P. (1984), "Hierarchic Agglcmerative Clustering Methods for Automatic Ebcunent Classification!" Journal of Docmentation, MO, 175-205.
9. [GRIF 86 ] Griffiths, A., Luckhurst, H.C. and Willett, P. (1986), "Vsine Inter-Doc unent Similarity Information in Dbcunent Betrieval Systems, " Journal of the American Society for Information Science, 37, 3-11.
10. [JARD71a] Jardine, N. and Sibson, R. (1971), Mathematical Taxonomy New York! Wiley.
11. [JARD71 b] Jardine, M. and Van Rijsbergen, C.J. (1971), "The Use of Hierarchic Clustering in Information Retrieval, " Information Storage and Retrieval, 7, 217-210.
12. [KITT 78] Kittler, J. (1978), "A Method for Determining K-Nearest Neighbours, " Kybernetes, 7, 313-315.
13. CLANC67 Lance, G.N. and Williams, W.T. (1967), "A General Die ory of Classif icator y Sorting Strategies. I. Hierarchical Systems, " Computer Journal, 9, 373-380.
14. [MURT82] Hurtagh, F. (1982), "A Very Fast, Exact Nearest neighbor Algorithm for Use in Information Retrieval, " Information Technology; Research and Development, 1, 275-283.
15. [MURT833] Hurtagh, F. (1983), "A Survey of Recent Advances in Hierarchical Clustering Algorithms, " Computer Journal, 26, 351-359.
16. [MURT84a] Hurtagh, F. (1984), "Complexities of Hierarchic Clustering Algorlthns: State of the Art, " Computational Statistics Quarterly, 1, 101-113.
17. [MURT84b] Hurtagh, F. (1984), "A Review of Fast Techniques for Nearest neighbor Searching, " in CCHP5TAT 1984, Vienna: Fhysica-Verls.
18. [NORE77] Noreault, T., Koll, M. and McGill, H.J. (1977), "Automatic Ranked Output from Boolean Searches in SIRE, " Journal of the American Society for Information Science, 28, 333-339.
19. [PERR83] Perry, S.A. and Willett, P. (1983), "A Review of the Use of Inverted Files for Best Match Retrieval in Information Retrieval Systems, " Journal of Information Science 6, 59-66.
20. [POGU84] Pogue, C. A. and Willett, P. (1984), "An Evaluation of Document Retrieval from Serial Files Using the ICL Distributed tray ProcessorOnline Review 8, 569-584.
21. [S ALT 71] Salton, G. (1971), The 31ART Retrieval System, New Jersey; ft-entice-Hall.
22. [SALT 81] Salton, G. and Bergmark, D. (1981), "Parallel Computations in Information Retrieval, " Lecture tfotes in Computer Science, 111, 328-342.
23. [SALT 83] Salton, G. and McGill, M.J. (1983), Introduction to Modern Information Retrieval, New Tfork: McQ-Aw-Hill.
24. [SIBS73] Sibson, R. (1973), "SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method, " Computer Journal, 16, 30 -34.
25. [SMEA81] Smeaton, A.F. and Van Rijsbergen, C.J. (1981), "The Nearest Neighbour Problem in Information Retrieval. An Algorithm Using Upper boundsACH S.I0IR Form, 16, 83-87.
26. [VANR743] Van Rijsbergen, C.J. (1974), "Further Experiments with Hierarchic Clustering in Docunent RetrievalInformation Storage and Retrieval, 10, 1-14.
27. [VANR753] Van Rijsbergen, C.J. and Q-oft, W.B. (1975), "Docunent Clustering: An Evaluation of sane Experiments with the Cranfield 1400 Collection, " Information Storage and Retrieval, 11, 171-182.
28. [VANR793] Van Rijsbergen, C.J. (1979), Information Retrieval tondon: Butterworth.
29. [WEIS 813] Weiss, S.F. (1981), "A Probabilistic Algorlthn for Nearest Neighbour Searching, " iin Oddy, R.N. et al. (eds.) Information Retrieval Research, london: Eutterworth.