Non-hierarchical document clustering using the ICL distribution array processor
Published 1 January 1987Open access
Edie Rasmussen, Peter Willett
Citations10
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The results suggest that the parallel architecture of the DAP is not well suited to the variable-length records which characterise bibliographic data.
Abstract
This paper considers the suitability and efficiency of a highly parallel computer, the ICL Distributed Array Processor (DAP), for document clustering. Algorithms are described for the implementation of the single-pass and reallocation clustering methods on the DAP and on a conventional mainframe computer. These methods are used to classify the Cranfield, Vaswani and UKCIS document test collections. The results suggest that the parallel architecture of the DAP is not well suited to the variable-length records which characterise bibliographic data.
Keywords
Computer Science
Microprocessors and MicrosystemsComputer architecture and parallel processing
1,200 Citations1985Yigal Hoffner
Virtual Defense Library (Ministerio de Defensa)Computer Architecture and Parallel Processing
1,005 Citations1984Kai Hwang, Fayé A. Briggs
The authors have divided the use of computers into the following four levels of sophistication: data processing, information processing, knowledge processing, and intelligence processing.
IEEE Transactions on ComputersClustering Using a Similarity Measure Based on Shared Near Neighbors
957 Citations1973R.A. Jarvis, Edward A. Patrick
A nonparametric clustering technique incorporating the concept of similarity based on the sharing of near neighbors is presented, which is an essentially paraliel approach and is applicable to a wide class of practical problems involving large sample size and high dimensionality.
Proceedings of the IEEEVery high-speed computing systems
943 Citations1966Michael Flynn
The constituents of a system: storage, execution, and instruction handling (branching) are discussed with regard to recent developments and/or systems limitations.
Information Storage and RetrievalThe use of hierarchic clustering in information retrieval
522 Citations1971N. Jardine, C. J. van Rijsbergen
It is shown that cluster-based retrieval strategies can be devised which are as effective as linear associative retrieval strategies and much more efficient.
Advances in computersClustering Methodologies in Exploratory Data Analysis
287 Citations1980Richard C. Dubes, Anil Jain
The chapter focuses on the four operations highlighted by reviewing techniques for assessing the tendency of the data to cluster, performing the clustering itself, and evaluating the validity of the results, and introduces the concept of intrinsic dimensionality that helps determine an appropriate number of factors for representing data.
eCommons (Cornell University)The Effectiveness and Efficiency of Agglomerative Hierarchic Clustering in Document Retrieval
122 Citations1985Ellen M. Voorhees
The main goal of this thesis is to compare clustered file searches and inverted file searches in order to determine under what circumstances one search is to be preferred over the other.
Journal of DocumentationHIERARCHIC AGGLOMERATIVE CLUSTERING METHODS FOR AUTOMATIC DOCUMENT CLASSIFICATION
117 Citations1984Alan Griffiths, Lesley A. Robinson +1 more
The results would suggest that the single linkage method, which has been used extensively in previous work on document clustering, is not the most effective procedure of those tested, although it should be emphasized that the experiments have used only small document test collections.
Journal of Chemical Information and Computer SciencesImplementation of nonhierarchic cluster analysis methods in chemical information systems: selection of compounds for biological testing and clustering of substructure search output
106 Citations1986Peter Willett, Vivienne Winterman +1 more
FigshareSynchronized and asynchronous parallel algorithms for multiprocessors
87 Citations2018H. T. Kung
Parallel algorithms for multiprocessors are classified into synchronized and asynchronous algorithms, and several examples of the two types of algorithms are described in depth.
Journal of the American Society for Information ScienceClustering large files of documents using the single‐link method
77 Citations1977W. Bruce Croft
A comparison of clustering times with other methods show that large files can be clustered by single-link in a time at least comparable to various heuristic algorithms which theoretically require fewer operations.
IEEE Transactions on Pattern Analysis and Machine IntelligenceA VLSI Systolic Architecture for Pattern Clustering
71 Citations1985Lionel M. Ni, Anil K. Jain
A two-level pipelined systolic pattern clustering array is proposed and the modularity and the regularity of the system architecture make it suited for VLSI implementations.
Journal of Information ScienceA review of the use of inverted files for best match searching in information retrieval systems
62 Citations1983Shirley A. Perry, Peter Willett
A critical evaluation is presented of a range of algorithms which have been described for the matching of documents with queries, and particular attention is paid to the computational efficiency of the various procedures.
Journal of Information ScienceDocument clustering using an inverted file approach
40 Citations1980Peter Willett
An automatic document clustering procedure is described which does not require the use of an inter-document similar ity matrix and which is independent of the order in which the documents are processed.
Information Processing & ManagementA fast procedure for the calculation of similarity coefficients in automatic classification
31 Citations1981Peter Willett
A fast algorithm is described for comparing the lists of terms representing documents in automatic classification experiments, using an inverted file to the terms in the document collection.
IEEE Transactions on ComputersThe Measurement of Performance on a Highly Parallel System
24 Citations1983Parkinson, Liddell
The problems of measuring the performance of a highly parallel multiple processor system, such as the 4096 element ICL Distributed Array Processor are presented in relation to the conventional methods used for serial processors in order to provide a framework for the discussion.
Journal of the American Society for Information ScienceBibliographic pattern matching using the ICL Distributed Array Processor
20 Citations1988David M. Carroll, Christine A. Pogue +1 more
The ICL Distributed Array Processor (DAP), a highly parallel array processor containing 4096 processing elements, is used for pattern‐matching operations in a bibliographic retrieval system with the relative advantage of the DAP increasing linearly with a decrease in the number of query patterns.
Online ReviewAn evaluation of document retrieval from serial files using the ICL Distributed Array Processor
14 Citations1984Christine A. Pogue, Peter Willett
Best match retrieval experiments with three collections of documents and queries show that the DAP is very much more efficient than a conventional mainframe computer in calculating a measure of similarity between a query and each of the documents in a large collection.
Lecture notes in computer scienceParallel computations in information retrieval
12 Citations2007Gerard Salton, Donna Bergmark
In the present study a number of parallelprocessing methods are described that serve to enhance retrieval services and evidence is given to demonstrate the usefulness of parallel processing and fast computational facilities in information retrieval.
Elsevier eBooksDistributed processing power in memory
11 Citations1983Danny Hunt, S.F. Reddaway
The ICL Distributed Array Processor is discussed in detail and applications are assessed, finding that operations on low precision, symbol and Boolean data give even higher performance than floating point work.
Computer Physics CommunicationsDrooling — A non-parametric multidimensional clustering algorithm for distributed array processor
2 Citations1982Akpojaro Jackson, H.M. Sykes +1 more
A novel clustering algorithm which can find application in several disciplines is described which could be implemented on a serial computer once the proposed ANSII vector extensions to Fortran are available.