1 CS 430 / INFO 430 Information Retrieval Lecture 27 Classification 2

2 Course Administration

3 Cluster Analysis Methods that divide a set of n objects into m non- overlapping subsets. For information discovery, cluster analysis is applied to terms for thesaurus construction documents to divide into categories (sometimes called automatic classification, but classification usually requires a pre-determined set of categories).

4 Cluster Analysis Metrics  Documents clustered on the basis of a similarity measure calculated from the terms that they contain.  Documents clustered on the basis of co-occurring citations.  Terms clustered on the basis of the documents in which they co-occur.

5 Non-hierarchical and Hierarchical Methods Non-hierarchical methods Elements are divided into m non-overlapping sets where m is predetermined. Hierarchical methods m is varied progressively to create a hierarchy of solutions. Agglomerative methods m is initially equal to n, the total number of elements, where every element is considered to be a cluster with one element. The hierarchy is produced by incrementally combining clusters.

6 Simple Hierarchical Methods: Single Link x x x xx x x x x x x x Similarity between clusters is similarity between most similar elements Concept

7 Single Link A simple agglomerative method. Initially, each element is its own cluster with one element. At each step, calculate the similarity between each pair of clusters as the most similar pair of elements that are not yet in the same cluster. Merge the two clusters that are most similar. May lead to long, straggling clusters (chaining). Very simple computation.

8 Similarities: Incidence array D 1 : alpha bravo charlie delta echo foxtrot golf D 2 : golf golf golf delta alpha D 3 : bravo charlie bravo echo foxtrot bravo D 4 : foxtrot alpha alpha golf golf delta alphabravocharliedeltaechofoxtrotgolf D D D D n

9 Term similarity matrix alphabravocharliedeltaechofoxtrotgolf alpha bravo charlie delta echo foxtrot 0.33 golf Using incidence matrix and dice weighting

10 Example -- single link alpha delta golf bravo echo charlie foxtrot 1 Agglomerative: step 1

11 Example -- single link alpha delta golf bravo echo charlie foxtrot 1 2 Agglomerative: step 2

12 Example -- single link alpha delta golf bravo echo charlie foxtrot Agglomerative: step 3

13 Example -- single link alpha delta golf bravo echo charlie foxtrot This style of diagram is called a dendrogram.

14 Simple Hierarchical Methods: Complete Linkage x x x xx x x x x x x x Similarity between clusters is similarity between least similar elements Concept

15 Complete linkage A simple agglomerative method. Initially, each element is its own cluster with one element. At each step, calculate the similarity between each pair of clusters as the similarity between the least similar pair of elements in the two clusters. Merge the two clusters that are most similar. Generates small, tightly bound clusters

16 Term similarity matrix alphabravocharliedeltaechofoxtrotgolf alpha bravo charlie delta echo foxtrot 0.33 golf Using incidence matrix and dice weighting

17 Example – complete linkage Cluster abcdefg elements Least similar pair / distance a-ab/.2ac/.2ad/.5ae/.2af/.33ag/.5 b-bc/.5bd/.2be/.5bf/.4bg/.2 c-cd/.2ce/.5cf/.4cg/.2 d-de/.2df/.33dg/.5 e-ef/.4eg/.2 f-fg/.33 g- Step 1. Merge clusters {a} and {d}

18 Example – complete linkage Clustera,dbcefg elements Least similar pair / distance a,d-ab/.2ac/.2ae/.2df/.33ag/.5 b-bc/.5be/.5bf/.4bg/.2 c-ce/.5cf/.4cg/.2 e-ef/.4eg/.2 f-fg/.33 g- Step 2. Merge clusters {a,d} and {g}

19 Example – complete linkage Clustera,d,gbcef elements Least similar pair / distance a,d,g-ab/.2ac/.2ae/.2af/.33 b-bc/.5be/.5bf/.4 c-ce/.5cf/.4 e-ef/.4 f- Step 3. Merge clusters {b} and {c}

20 Example – complete linkage Clustera,d,gb,cef elements Least similar pair / distance a,d,g-ab/.2ae/.2af/.33 b,c-be/.5bf/.4 e-ef/.4 f- Step 4. Merge clusters {b,c} and {e}

21 Example -- complete linkage alpha delta golf bravo charlie echo foxtrot Step 1 Step 6 Step 5 Step 2 Step 4 Step 3

22 Non-Hierarchical Methods: K-means 1Define a similarity measure between any two points in the space (e.g., square of distance). 2Choose k points as initial group centroids. 3Assign each object to the group that has the closest centroid. 4When all objects have been assigned, recalculate the positions of the k centroids. 5Repeat Steps 3 and 4 until the centroids no longer move. This produces a separation of the objects into groups from which the metric to be minimized can be calculated.

23 K-means Iteration converges under a very general set of conditions Results depend on the choice of the k initial centroids Methods can be used to generate a sequence of solutions for k increasing from 1 to n. Note that, in general, the results will not be hierarchical.

24 Problems with cluster analysis in information retrieval  Selection of attributes on which items are clustered  Choice of similarity measure and algorithm  Computational resources  Assessing validity and stability of clusters  Updating clusters as data changes  Method for using the clusters in information retrieval

25 Example 1: Concept Spaces for Scientific Terms Large-scale searches can only match terms specified by the user to terms appearing in documents. Cluster analysis can be used to provide information retrieval by concepts, rather than by terms. Bruce Schatz, William H. Mischo, Timothy W. Cole, Joseph B. Hardin, Ann P. Bishop (University of Illinois), Hsinchun Chen (University of Arizona), Federating Diverse Collections of Scientific Literature, IEEE Computer, May Federating Diverse Collections of Scientific Literature

26 Concept Spaces: Methodology Concept space: A similarity matrix based on co-occurrence of terms. Approach: Use cluster analysis to generate "concept spaces" automatically, i.e., clusters of terms that embrace a single semantic concept. Arrange concepts in a hierarchical classification.

27 Concept Spaces: INSPEC Data Data set 1: All terms in 400,000 records from INSPEC, containing 270,000 terms with 4,000,000 links. [24.5 hours of CPU on 16-node Silicon Graphics supercomputer.] computer-aided instruction see also education UF teaching machines BT educational computing TT computer applications RT education RT teaching

28 Concept Space: Compendex Data Data set 2: (a) 4,000,000 abstracts from the Compendex database covering all of engineering as the collection, partitioned along classification code lines into some 600 community repositories. [ Four days of CPU on 64-processor Convex Exemplar.] (b) In the largest experiment, 10,000,000 abstracts, were divided into sets of 100,000 and the concept space for each set generated separately. The sets were selected by the existing classification scheme.

29 Objectives Semantic retrieval (using concept spaces for term suggestion) Semantic interoperability (vocabulary switching across subject domains) Semantic indexing (concept identification of document content) Information representation (information units for uniform manipulation)

30 Use of Concept Space: Term Suggestion

31 Future Use of Concept Space: Vocabulary Switching "I'm a civil engineer who designs bridges. I'm interested in using fluid dynamics to compute the structural effects of wind currents on long structures. Ocean engineers who design undersea cables probably do similar computations for the structural effects of water currents on long structures. I want you [the system] to change my civil engineering fluid dynamics terms into the ocean engineering terms and search the undersea cable literature."

32 Example 2: Visual thesaurus for geographic images Methodology: Divide images into small regions. Create a similarity measure based on properties of these images. Use cluster analysis tools to generate clusters of similar images. Provide alternative representations of clusters. Marshall Ramsey, Hsinchun Chen, Bin Zhu, A Collection of Visual Thesauri for Browsing Large Collections of Geographic Images, May Thesaurus.html

33

34 The End Search index Return hits Browse content Return objects Scan results