Probabilistic algorithms

Similar concepts

Similarity Concept
Information retrieval definition
Experimental information retrieval
Operational information retrieval
Cluster based retrieval
Automatic classification
Information retrieval system
Probabilistic retrieval
Automatic indexing
Cluster methods
Clustering

Pages with this concept

Similarity Page Snapshot
184 Eight THE FUTURE Future research In the preceding chapters I have tried to bring together some of the more elaborate tools that are used during the design of an experimental information retrieval system ...1 ...Substantial evidence that large document collections can be handled successfully by means of automatic classification will encourage new work into ways of structuring such collections ...It is therefore of some importance that using the kind of data already in existence,that is using document descriptions in terms of keywords,we establish that document clustering on large document collections can be both effective and efficient ...
132 calculated more efficiently based on than one based on the full EMIM ...as a measure of association ...2 ...There are numerous published algorithms for generating an MST from pairwise association measures,the most efficient probably being the recent one due to Whitney [21]...It is along these lines that Bentley and Friedman [22]have shown that by exploiting the geometry of the space in which the index terms are points the computation time for generating the MST can be shown to be almost always 0 n log n ...One major inefficiency in generating the MST is of course due to the fact that all n n 1 2 associations are computed whereas only a small number are in fact significant in the sense that they are non zero and could therefore be chosen for a weight of an edge in the spanning tree ...