Similar concepts
Pages with this concept
| Similarity |
Page |
Snapshot |
| 176 |
conjoint structure
...The analysis is not limited to the two factors precision and recall,it could equally well be carried out for say the pair fallout and recall
...Presentation of experimental results In my discussion of micro,macro evaluation,and expected search length,various ways of averaging the effectiveness measure of the set of queries arose in a natural way
...In this section the discussion will be restricted to single number measures such as a normalised symmetric difference,normalised recall,etc
...The measurements we have therefore are Za Q 1,Za Q 2,... |
| 47 |
that a search strategy will infallibly find the class of documents containing the relevant documents
...Note that the Cluster Hypothesis refers to given document descriptions
...As can be seen from the above,the Cluster Hypothesis is a convenient way of expressing the aim of such operations as document clustering
...The use of clustering in information retrieval There are a number of discussions in print now which cover the use of clustering in IR
...In choosing a cluster method for use in experimental IR,two,often conflicting,criteria have frequently been used
...1 the method produces a clustering which is unlikely to be altered drastically when further objects are incorporated,i
...2 the method is stable in the sense that small errors in the description of the objects lead to small changes in the clustering;3 the method is independent of the initial ordering of the objects
...These conditions have been adapted from Jardine and Sibson [2]... |
| 48 |
The second criterion for choice is the efficiency of the clustering process in terms of speed and storage requirements
...Efficiency is really a property of the algorithm implementing the cluster method
...In the main,two distinct approaches to clustering can be identified:1 the clustering is based on a measure of similarity between the objects to be clustered;2 the cluster method proceeds directly from the object descriptions
...The most obvious examples of the first approach are the graph theoretic methods which define clusters in terms of a graph derived from the measure of similarity
...A string is a connected sequence of objects from some starting point
...A connected component is a set of objects such that each object is connected to at least one other member of the set and the set is maximal with respect to this property
...A maximal complete subgraph is a subgraph such that each node is connected to every other node in the subgraph and the set is maximal with respect to this property,i
...node were included anywhere the completeness condition would be violated
...A large class of hierarchic cluster methods is based on the initial measurement of similarity
... |
|
|
