### Table 6: Two-level Clustering.

2004

Cited by 1

### Table 2: Number of clusters and their average size (in parentheses) generated in a two-level architecture.

"... In PAGE 6: ...75. Table2 shows the number of clusters and their average size generated in the two-level architecture using di erent clustering methods.... ..."

### Table 2: Number of clusters and their average size (in parentheses) generated in a two-level architecture.

"... In PAGE 6: ...75. Table2 shows the number of clusters and their average size generated in the two-level architecture using di erent clustering methods.... ..."

### Table 2: Declaration Counts at Snapshot 16, Two-Level clustering with Rocchio Adaptation

"... In PAGE 20: ... Figure 8 shows the results for a set of runs within this configuration. Table2 provides distribu- tional data extracted from snapshot 16 comparing the Two-Level Rocchio adaptation configuration with and without noun phrases.... ..."

### Table 5: Declaration Counts at Snapshot 16, Two-Level Rocchio with Declaration Adaptation and Noun Phrases

"... In PAGE 27: ...ation active. For this experiment we changed the ceiling on break threshold from 0.45 to 0.75. As shown in Figure 12, there is a marked improvement in performance for the high initial threshold configurations, but a decline in performance in the remaining configurations*. Table5 shows that the counts of declared documents for the lower threshold configurations are still very high, with roughly comparable numbers in each category. The higher threshold configurations, however, re- trieved roughly only half as many unjudged as on-topic documents.... ..."

### Table 3: Distribution of Topics for Two-Level Rocchio with Adaptation of Declaration Threshold [0.10, 0.50, (0.25)]

"... In PAGE 26: ... Note that we now extend our parameterization notation to indicate via parentheses when a parameter is set to the specified initial value when then is potentially adapted by the system during the run. Table3 contains a breakdown at regular intervals (roughly one year of data) of the adaptation of thresholds. By the end of the run, 25 of the 50 topics have increased their declaration thresholds above 0.... ..."

### Table 2. Number of Distance Computations (n) for the single-link clustering algorithm and a two-level divide and conquer algorithm.

"... In PAGE 36: ...elabel the original pattern matrix. We depict this two-level algorithm in Figure 23. It is possible to extend this algorithm to any number of levels; more levels are required if the data set is very large and the main memory size is very small [138]. If the single-link algorithm is used for obtaining 5 clusters, then there is a substantial savings in the number of computations as shown in Table2 for optimally chosen p when the number of clusters is xed at 5. However, this algorithm works well only when the points in each block are reasonably homogeneous which is often satis ed... ..."

### Table II. Number of Distance Computations (n) for the Single-Link Clustering Algorithm and a Two-Level Divide and Conquer Algorithm

### Table II. Number of Distance Computations (n) for the Single-Link Clustering Algorithm and a Two-Level Divide and Conquer Algorithm

in AND