Receive a 20% Discount on All Purchases Directly Through IGI Global's Online Bookstore

Yuchi Huang (General Electric Global Research, USA)

Copyright: © 2013
|Pages: 18

DOI: 10.4018/978-1-4666-3994-2.ch019

Chapter Preview

TopIn computer vision and other applied machine learning problems, a fundamental task is to cluster a set of data in a manner such that elements of the same cluster are more similar to each other than elements in different clusters. In these problems, we generally assume pairwise relationships among the objects of our interest. For example, a common distance measure for data points lying in a vector space is the Euclidean distance, which is used in a lot of unsupervised central clustering methods such as *k*-means (Macqueen, 1967), *k*-centers clustering (Macqueen, 1967) and affinity propagation (Frey, 2007). Actually, a data set endowed with pairwise relationships can be naturally organized as a pairwise graph (for simplicity, we denote the pairwise graph as simple graph in the following). The simple graph partitioning problem in mathematics consists of dividing a graph G into k pieces, such that the pieces are of about the same size and there are few connections between the pieces. With a few notable exceptions, the similarities between objects in a simple graph are utilized to present the pairwise relationships. The simple graph can be undirected or directed, depending on whether the relationships among objects are symmetric or not. Usually a computed kernel matrix is associated to a directed or undirected graph, a lot of methods for unsupervised and semi-supervised learning can then be formulated in terms of operations on this simple graph and achieve better clustering results compared to central clustering methods (Shi, 2000) (Ng, 2001) (Luxburg,2008).

However, in many real world problems, it is not complete to represent the relations among a set of objects as simple graphs. This point of view is illustrated in a good example used in (Zhou, 2006). In this example, a collection of articles need to be grouped into different clusters by topics. The only information that we have is the authors of all the articles. One way to solve this problem is to construct an undirected graph in which two vertices are connected by an edge if they have at least one common author (Table 1 and Figure 1), and then spectral graph clustering can be applied (Fieldler, 1973) (Chan, 1993) (Shi, 2000). Each edge weight of this undirected graph may be assigned as the number of authors in common between two articles. It is an easy, nevertheless, not natural way to represent the relations between the articles because this graph construction loses the information whether the same person is the author of three or more articles or not. Such information loss is unexpected because the articles by the same person likely belong to the same topic and hence the information is useful for our grouping task. A more natural way to remedy the information is to represent the data points as a hypergraph. An edge in a hypergraph is called a hyperedge, which can connect more than two vertices; that is, a hyperedge is a subset of vertices. For this article clustering problem, it is quite straightforward to construct a hypergraph with the vertices representing the articles, and the hyperedges the authors (Figure 1). Each hyperedge contains all articles by its corresponding author. Furthermore, positive weights may be put on hyperedges to emphasize or weaken specific authors’ work. For those authors working on a smaller range of fields, we may assign a larger weight to the corresponding hyperedge. Compared to a simple pairwise graph, in this example hypergraph structure more completely illustrates the complex relationships among authors and articles.

An author set *E*={*e*_{1},*e*_{2},*e*_{3}} and an article set *V*={*v*_{1},*v*_{2},*v*_{3},*v*_{4},*v*_{5},*v*_{6},*v*_{7}}. The entry (*v*_{i},e_{j}) is set to 1 if *e*_{j} is an author of article *v*_{i }and 0 otherwise.

e_{1} | e_{2} | e_{3} | |

v_{1} | 1 | 0 | 0 |

v_{2} | 1 | 0 | 1 |

v_{3} | 0 | 0 | 1 |

v_{4} | 0 | 0 | 1 |

v_{5} | 0 | 1 | 0 |

v_{6} | 0 | 1 | 1 |

v_{7} | 0 | 1 | 0 |

Search this Book:

Reset

Copyright © 1988-2018, IGI Global - All Rights Reserved