Thomas, J.; Moallemy-Oureh, A.; Beddar-Wiesing, S. & Holzhüter, C. (2023), 'Graph Neural Networks Designed for Different Graph Types: A Survey', Transactions on Machine Learning Research .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Graphs are ubiquitous in nature and can therefore serve as models for many practical but also theoretical problems. For this purpose, they can be defined as many different types which suitably reflect the individual contexts of the represented problem. To address cutting-edge problems based on graph data, the research field of Graph Neural Networks (GNNs) has emerged. Despite the field’s youth and the speed at which new models are developed, many recent surveys have been published to keep track of them. Nevertheless, it has not yet been gathered which GNN can process what kind of graph types. In this survey, we give a detailed overview of already existing GNNs and, unlike previous surveys, categorize them according to their ability to handle different graph types and properties. We consider GNNs operating on static and dynamic graphs of different structural constitutions, with or without node or edge attributes. Moreover, we distinguish between GNN models for discrete-time or continuous-time dynamic graphs and group the models according to their architecture. We find that there are still graph types that are not or only rarely covered by existing GNN models. We point out where models are missing and give potential reasons for their absence.

Krompass, D.; Nickel, M. & Tresp, V. (2014), Large-scale factorization of type-constrained multi-relational data, in 'International Conference on Data Science and Advanced Analytics, DSAA 2014, Shanghai, China, October 30 - November 1, 2014' , IEEE, , pp. 18--24 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2013

Doerfel, S. & Jäschke, R. (2013), An analysis of tag-recommender evaluation procedures, in 'Proceedings of the 7th ACM conference on Recommender systems' , ACM, New York, NY, USA , pp. 343--346 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.

Bildeten die Keimzellen des Internet noch kleine und einfach strukturierte Netze, so vergrößerten sich sowohl seine physikalischen als auch seine logischen Topologien später rasant. Wuchs einerseits das Netz aus Rechnern als Knoten und Verbindungsleitungen als Kanten immer weiter, so bedienten sich andererseits gleichzeitig immer mehr Anwendungen dieser Infrastruktur, um darüber ihrerseits immer größere und komplexere virtuelle Netze zu weben, z. B. das WWW oder soziale Online-Netze. Auf jeder Ebene dieser Hierarchie lassen sich die jeweiligen Netztopologien mithilfe von Graphen beschreiben und so mathematisch untersuchen. So ergeben sich interessante Einblicke in die Struktureigenschaften unterschiedlicher Graphentypen, die großen Einfluss auf die Leistungsfähigkeit des Internet haben. Hierzu werden charakteristische Eigenschaften und entsprechende Kenngrößen verschiedener Graphentypen betrachtet wie der Knotengrad, die Durchschnittsdistanz, die Variation der Kantendichte in unterschiedlichen Netzteilen und die topologische Robustheit als Widerstandsfähigkeit gegenüber Ausfällen und Angriffen. Es wird dabei Bezug genommen auf analytische, simulative und zahlreiche empirische Untersuchungen des Internets und hingewiesen auf Simulationsprogramme sowie Abbildungen von Internetgraphen im Internet.

Landia, N.; Doerfel, S.; Jäschke, R.; Anand, S. S.; Hotho, A. & Griffiths, N. (2013), 'Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations', cs.IR 1310.1498 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.

2012

Liu, X.; Zhang, J. & Guo, C. (2012), 'Full-Text Citation Analysis: A New Method to Enhance Scholarly Network', Journal of the American Society for Information Science and Technology .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Pereira Nunes, B.; Kawase, R.; Dietze, S.; Taibi, D.; Casanova, M. A. & Nejdl, W. (2012), Can Entities be Friends?, in Giuseppe Rizzo; Pablo Mendes; Eric Charton; Sebastian Hellmann & Aditya Kalyanpur, ed., 'Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference' , pp. 45--57 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

The richness of the (Semantic) Web lies in its ability to link related resources as well as data across the Web. However, while relations within particular datasets are often well defined, links between disparate datasets and corpora of Web resources are rare. The increasingly widespread use of cross-domain reference datasets, such as Freebase and DBpedia for annotating and enriching datasets as well as document corpora, opens up opportunities to exploit their inherent semantics to uncover semantic relationships between disparate resources. In this paper, we present an approach to uncover relationships between disparate entities by analyzing the graphs of used reference datasets. We adapt a relationship assessment methodology from social network theory to measure the connectivity between entities in reference datasets and exploit these measures to identify correlated Web resources. Finally, we present an evaluation of our approach using the publicly available datasets Bibsonomy and USAToday.

2011

Batagelj, V. & Zaveršnik, M. (2011), 'Fast algorithms for determining (generalized) core groups in social networks', Advances in Data Analysis and Classification 5 (2) , 129-145 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “ k -cores”, proposed in 1983 by Seidman. Together with connectivity components, cores are one among few concepts that provide efficient decompositions of large graphs and networks. In this paper we propose an efficient algorithm for determining the cores decomposition of a given network with complexity $$O(m)$$, where m is the number of lines (edges or arcs). In the second part of the paper the classical concept of k -core is generalized in a way that uses a vertex property function instead of degree of a vertex. For local monotone vertex property functions the corresponding generalized cores can be determined in $$O(motn))$$ time, where n is the number of vertices and Δ is the maximum degree. Finally the proposed algorithms are illustrated by the analysis of a collaboration network in the field of computational geometry.

Ugander, J.; Karrer, B.; Backstrom, L. & Marlow, C. (2011), 'The Anatomy of the Facebook Social Graph' , cite arxiv:1111.4503Comment: 17 pages, 9 figures, 1 table .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We study the structure of the social graph of active Facebook users, the largest social network ever analyzed. We compute numerous features of the graph including the number of users and friendships, the degree distribution, path lengths, clustering, and mixing patterns. Our results center around three main observations. First, we characterize the global structure of the graph, determining that the social network is nearly fully connected, with 99.91% of individuals belonging to a single large connected component, and we confirm the "six degrees of separation" phenomenon on a global scale. Second, by studying the average local clustering coefficient and degeneracy of graph neighborhoods, we show that while the Facebook graph as a whole is clearly sparse, the graph neighborhoods of users contain surprisingly dense structure. Third, we characterize the assortativity patterns present in the graph by studying the basic demographic and network properties of users. We observe clear degree assortativity and characterize the extent to which "your friends have more friends than you". Furthermore, we observe a strong effect of age on friendship preferences as well as a globally modular community structure driven by nationality, but we do not find any strong gender homophily. We compare our results with those from smaller social networks and find mostly, but not entirely, agreement on common structural network characteristics.

2010

Chakrabarti, S.; Pathak, A. & Gupta, M. (2010), 'Index design and query processing for graph conductance search', The VLDB Journal , 1-26 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Graph conductance queries, also known as personalized PageRank and related to random walks with restarts, were originally proposed to assign a hyperlink-based prestige score to Web pages. More general forms of such queries are also very useful for ranking in entity-relation (ER) graphs used to represent relational, XML and hypertext data. Evaluation of PageRank usually involves a global eigen computation. If the graph is even moderately large, interactive response times may not be possible. Recently, the need for interactive PageRank evaluation has increased. The graph may be fully known only when the query is submitted. Browsing actions of the user may change some inputs to the PageRank computation dynamically. In this paper, we describe a system that analyzes query workloads and the ER graph, invests in limited offline indexing, and exploits those indices to achieve essentially constant-time query processing, even as the graph size scales. Our techniques—data and query statistics collection, index selection and materialization, and query-time index exploitation—have parallels in the extensive relational query optimization literature, but is applied to supporting novel graph data repositories. We report on experiments with five temporal snapshots of the CiteSeer ER graph having 74–702 thousand entity nodes, 0.17–1.16 million word nodes, 0.29–3.26 million edges between entities, and 3.29–32.8 million edges between words and entities. We also used two million actual queries from CiteSeer’s logs. Queries run 3–4 orders of magnitude faster than whole-graph PageRank, the gap growing with graph size. Index size is smaller than a text index. Ranking accuracy is 94–98% with reference to whole-graph PageRank.

Isella, L.; Stehlé, J.; Barrat, A.; Cattuto, C.; Pinton, J.-F. & den Broeck, W. V. (2010), 'What's in a crowd? Analysis of face-to-face behavioral networks', CoRR abs/1006.1260 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Mitzlaff, F.; Benz, D.; Stumme, G. & Hotho, A. (2010), Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy, in 'Proceedings of the 21st ACM conference on Hypertext and hypermedia' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2009

Akoglu, L. & Faloutsos, C. (2009), RTG: A Recursive Realistic Graph Generator Using Random Typing., in Wray L. Buntine; Marko Grobelnik; Dunja Mladenic & John Shawe-Taylor, ed., 'ECML/PKDD (1)' , Springer, , pp. 13-28 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Berlingerio, M.; Bonchi, F.; Bringmann, B. & Gionis, A. (2009), Mining Graph Evolution Rules., in Wray L. Buntine; Marko Grobelnik; Dunja Mladenic & John Shawe-Taylor, ed., 'ECML/PKDD (1)' , Springer, , pp. 115-130 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Fürnkranz, J.; Hüllermeier, E. & Vanderlooy, S. (2009), 'Binary Decomposition Methods for Multipartite Ranking', Machine Learning and Knowledge Discovery in Databases , 359--374 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Bipartite ranking refers to the problem of learning a ranking function from a training set of positively and negatively labeled examples. Applied to a set of unlabeled instances, a ranking function is expected to establish a total order in which positiveinstances precede negative ones. The performance of a ranking function is typically measured in terms of the AUC. In thispaper, we study the problem of multipartite ranking, an extension of bipartite ranking to the multi-class case. In this regard,we discuss extensions of the AUC metric which are suitable as evaluation criteria for multipartite rankings. Moreover, tolearn multipartite ranking functions, we propose methods on the basis of binary decomposition techniques that have previouslybeen used for multi-class and ordinal classification. We compare these methods both analytically and experimentally, not onlyagainst each other but also to existing methods applicable to the same problem.

Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these traditional methods often do not capture well the underlying structural information, clustering, and neighborhoods. In this paper, we describe GMap: a practical tool for visualizing relational data with geographic-like maps. We illustrate the effectiveness of this approach with examples from several domains All the maps referenced in this paper can be found in http://www.research.att.com/~yifanhu/GMap

Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually project such networks unto simple graphs composed of entities of a single type. In the process, they conflate relations between entities of different types and loose important structural information. We develop a mathematical framework that can be used to compactly represent and analyze heterogeneous networks that combine multiple entity and link types. We generalize Bonacich centrality, which measures connectivity between nodes by the number of paths between them, to heterogeneous networks and use this measure to study network structure. Specifically, we extend the popular modularity-maximization method for community detection to use this centrality metric. We also rank nodes based on their connectivity to other nodes. One advantage of this centrality metric is that it has a tunable parameter we can use to set the length scale of interactions. By studying how rankings change with this parameter allows us to identify important nodes in the network. We apply the proposed method to analyze the structure of several heterogeneous networks. We show that exploiting additional sources of evidence corresponding to links between, as well as among, different entity types yields new insights into network structure.

Maes, F.; Peters, S.; Denoyer, L. & Gallinari, P. (2009), Simulated Iterative Classification A New Learning Procedure for Graph Labeling., in Wray L. Buntine; Marko Grobelnik; Dunja Mladenic & John Shawe-Taylor, ed., 'ECML/PKDD (2)' , Springer, , pp. 47-62 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Collective classification refers to the classification of interlinked and relational objects described as nodes in a graph. The Iterative Classification Algorithm (ICA) is a simple, efficient and widely used method to solve this problem. It is representative of a family of methods for which inference proceeds as an iterative process: at each step, nodes of the graph are classified according to the current predicted labels of their neighbors. We show that learning in this class of models suffers from a training bias. We propose a new family of methods, called Simulated ICA, which helps reducing this training bias by simulating inference during learning. Several variants of the method are introduced. They are both simple, efficient and scale well. Experiments performed on a series of 7 datasets show that the proposed methods outperform representative state-of-the-art algorithms while keeping a low complexity.

Murata, T. (2009), Modularities for Bipartite Networks, in 'HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia' , ACM, New York, NY, USA .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Real-world relations are often represented as bipartite networks, such as paper-author networks and event-attendee networks. Extracting dense subnetworks (communities) from bipartite networks and evaluating their qualities are practically important research topics. As the attempts for evaluating divisions of bipartite networks, Guimera and Barber propose bipartite modularities. This paper discusses the properties of these bipartite modularities and proposes another bipartite modularity that allows one-to-many correspondence of communities of different vertex types. Preliminary experimental results for the bipartite modularities are also described.

2008

Filippone, M.; Camastra, F.; Masulli, F. & Rovetta, S. (2008), 'A survey of kernel and spectral methods for clustering', Pattern recognition 41 (1) , 176--190 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Jackson, M. (2008), 'Average Distance, Diameter, and Clustering in Social Networks with Homophily', Internet and Network Economics , 4--11 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

I examine a random network model where nodes are categorized by type and linking probabilities can differ across types. I show that as homophily increases (so that the probability to link to other nodes of the same type increases and the probabilityof linking to nodes of some other types decreases) the average distance and diameter of the network are unchanged, while theaverage clustering in the network increases.

Nicosia, V.; Mangioni, G.; Carchiolo, V. & Malgeri, M. (2008), 'Extending the definition of modularity to directed graphs with
overlapping communities' , cite arxiv:0801.1647 Comment: 22 pages, 11 figures .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Complex networks topologies present interesting and surprising properties, such as community structures, which can be exploited to optimize communication, to find new efficient and context-aware routing algorithms or simply to understand the dynamics and meaning of relationships among nodes. Complex networks are gaining more and more importance as a reference model and are a powerful interpretation tool for many different kinds of natural, biological and social networks, where directed relationships and contextual belonging of nodes to many different communities is a matter of fact. This paper starts from the definition of modularity function, given by M. Newman to evaluate the goodness of network community decompositions, and extends it to the more general case of directed graphs with overlapping community structures. Interesting properties of the proposed extension are discussed, a method for finding overlapping communities is proposed and results of its application to benchmark case-studies are reported. We also propose a new dataset which could be used as a reference benchmark for overlapping community structures identification.

Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y. (2008), Tag recommendations based on tensor dimensionality reduction, in 'RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems' , ACM, New York, NY, USA , pp. 43--50 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2007

Baur, M.; Gaertler, M.; Görke, R.; Krug, M. & Wagner, D. (2007), Generating Graphs with Predefined k-Core Structure, in 'Proceedings of the European Conference of Complex Systems' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

The modeling of realistic networks is of great importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches. Our novel model is based on the well-know concept of k-cores, originally introduced in social network analysis. Recent studies exposed the significant k-core structure of several real world systems, e.g. the AS network of the Internet. We present a simple and efficient method for generating networks which strictly adhere to the characteristics of a given k-core structure, called core fingerprint. We show-case our algorithm in a comparative evaluation with two well-known AS network generators.

Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D. (2007), On Finding Graph Clusterings with Maximum Modularity, in Andreas Brandstädt; Dieter Kratsch & Haiko Müller, ed., 'Graph-Theoretic Concepts in Computer Science' , Springer, Berlin / Heidelberg , pp. 121-132 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.

Spielman, D. (2007), 'Spectral Graph Theory and its Applications', Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on , 29-38 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Zesch, T. & Gurevych, I. (2007), Analysis of the Wikipedia Category Graph for NLP Applications, in 'Proceedings of the TextGraphs-2 Workshop (NAACL-HLT)' , Association for Computational Linguistics, Rochester , pp. 1--8 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

In this paper, we discuss two graphs in Wikipedia (i) the article graph, and (ii) the category graph. We perform a graph-theoretic analysis of the category graph, and show that it is a scale-free, small world graph like other well-known lexical semantic networks. We substantiate our findings by transferring semantic relatedness algorithms defined on WordNet to the Wikipedia category graph. To assess the usefulness of the category graph as an NLP resource, we analyze its coverage and the performance of the transferred semantic relatedness algorithms.

2006

Cantador, I. & Castells, P. (2006), 'Building Emergent Social Networks and Group Profiles by Semantic User Preference Clustering', .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Hotho, A.; Jäschke, R.; Schmitz, C. & Stumme, G. (2006), Information Retrieval in Folksonomies: Search and Ranking, in York Sure & John Domingue, ed., 'The Semantic Web: Research and Applications' , Springer, Heidelberg , pp. 411-426 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies,called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to findcommunities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset.

Newman, M. E. J. (2006), 'Modularity and community structure in networks', Proceedings of the National Academy of Sciences 103 (23) , 8577--8582 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as “modularity” over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.

Newman, M. (2006), 'Finding community structure in networks using the eigenvectors of matrices', Physical Review E 74 (3) , 36104 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Newman, M. (2006), 'Modularity and community structure in networks', Proceedings of the National Academy of Sciences 103 (23) , 8577--8582 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006), Content Aggregation on Knowledge Bases using Graph Clustering, in York Sure & John Domingue, ed., 'The Semantic Web: Research and Applications' , Springer, Heidelberg , pp. 530-544 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.

2005

Dhillon, I. S.; Guan, Y. & Kulis, B. (2005), 'A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts' (TR-04-25) , Technical report, University of Texas Dept. of Computer Science .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Recently, a variety of clustering algorithms have been proposed to handle data that is not linearly separable. Spectral clustering and kernel k-means are two such methods that are seemingly quite different. In this paper, we show that a general weighted kernel k-means objective is mathematically equivalent to a weighted graph partitioning objective. Special cases of this graph partitioning objective include ratio cut, normalized cut and ratio association. Our equivalence has important consequences: the weighted kernel k-means algorithm may be used to directly optimize the graph partitioning objectives, and conversely, spectral methods may be used to optimize the weighted kernel k-means objective. Hence, in cases where eigenvector computation is prohibitive, we eliminate the need for any eigenvector computation for graph partitioning. Moreover, we show that the Kernighan-Lin objective can also be incorporated into our framework, leading to an incremental weighted kernel k-means algorithm for local optim ization of the objective. We further discuss the issue of convergence of weighted kernel k-means for an arbitrary graph affinity matrix and provide a number of experimental results. These results show that non-spectral methods for graph partitioning are as effective as spectral methods and can be used for problems such as image segmentation in addition to data clustering.

Dias, V. M.; de Figueiredo, C. M. & Szwarcfiter, J. L. (2005), 'Generating bicliques of a graph in lexicographic order', Theoretical Computer Science 337 (1-3) , 240 - 248 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipartite set B is a subset of vertices admitting a bipartition B=X[union or logical sum]Y, such that both X and Y are independent sets, and all vertices of X are adjacent to those of Y. If both X,Y[not equal to][empty set], then B is called proper. A biclique is a maximal proper complete bipartite set of a graph. We present an algorithm that generates all bicliques of a graph in lexicographic order, with polynomial-time delay between the output of two successive bicliques. We also show that there is no polynomial-time delay algorithm for generating all bicliques in reverse lexicographic order, unless P=NP. The methods are based on those by Johnson, Papadimitriou and Yannakakis, in the solution of these two problems for independent sets, instead of bicliques.

Lerner, J. (2005), Role Assignments, in Ulrik Brandes & Thomas Erlebach, ed., 'Network Analysis' , Springer, Berlin / Heidelberg , pp. 216-252 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

9.0. 9.0.1. Preliminaries 9.0.2. Role Graph 9.1. Structural Equivalence 9.1.1. Lattice of Equivalence Relations 9.1.2. Lattice of Structural Equivalences 9.1.3. Computation of Structural Equivalences 9.2. Regular Equivalence 9.2.1. Elementary Properties 9.2.2. Lattice Structure and Regular Interior 9.2.3. Computation of Regular Interior 9.2.4. The Role Assignment Problem 9.2.5. Existence of k-Role Assignments 9.3. Other Equivalences 9.3.1. Exact Role Assignments 9.3.2. Automorphic and Orbit Equivalence 9.3.3. Perfect Equivalence 9.3.4. Relative Regular Equivalence 9.4. Graphs with Multiple Relations 9.5. The Semigroup of a Graph 9.5.1. Winship-Pattison Role Equivalence 9.6. Chapter Notes

2004

An, Y.; Janssen, J. & Milios, E. E. (2004), 'Characterizing and Mining the Citation Graph of the Computer Science Literature', Knowl. Inf. Syst. 6 , 664--678 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability proportional to its degree. This process was introduced by Barabási and Albert [3], as a simple model of the growth of real-world graphs such as the world-wide web. Computer experiments presented by Barabási, Albert and Jeong [1,5] and heuristic arguments given by Newman, Strogatz and Watts [23] suggest that after n steps the resulting graph should have diameter approximately log n. We show that while this holds for m=1, for m=2 the diameter is asymptotically log n/log log n. ER -

Drineas, P.; Frieze, A.; Kannan, R.; Vempala, S. & Vinay, V. (2004), 'Clustering large graphs via the singular value decomposition', Machine Learning 56 (1) , 9--33 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Flake, G.; Tarjan, R. & Tsioutsiouliklis, K. (2004), 'Graph clustering and minimum cut trees', Internet Mathematics 1 (4) , 385--408 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2003

Batagelj, V. & Zaversnik, M. (2003), 'An O(m) Algorithm for Cores Decomposition of Networks' , cite arxiv:cs/0310049 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Brandes, U.; Gaertler, M. & Wagner, D. (2003), 'Experiments on graph clustering algorithms', Lecture notes in computer science , 568--579 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Estrada, E. & Rodriguez-Velázquez, J. (2003), 'Spectral measures of bipartivity in complex networks', SIAM Rev Phys Rev E 72 , 046105 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Haveliwala, T. & Kamvar, S. (2003), 'The second eigenvalue of the Google matrix', A Stanford University Technical Report http://dbpubs. stanford. edu .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Verma, D. & Meila, M. (2003), 'A comparison of spectral clustering algorithms', University of Washington, Tech. Rep. UW-CSE-03-05-01 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Yu, S. X. & Shi, J. (2003), Multiclass Spectral Clustering, in 'Proc. International Conference on Computer Vision (ICCV 03)' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2002

Brandes, U. & Willhalm, T. (2002), Visualization of bibliographic networks with a reshaped landscape metaphor, in 'Proceedings of the symposium on Data Visualisation 2002' , Eurographics Association, Aire-la-Ville, Switzerland, Switzerland , pp. 159--ff .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We describe a novel approach to visualize bibliographic networks that facilitates the simultaneous identification of clusters (e.g., topic areas) and prominent entities (e.g., surveys or landmark papers). While employing the landscape metaphor proposed in several earlier works, we introduce new means to determine relevant parameters of the landscape. Moreover, we are able to compute prominent entities, clustering of entities, and the landscape's surface in a surprisingly simple and uniform way. The effectiveness of our network visualizations is illustrated on data from the graph drawing literature.

Snijders, T. (2002), 'Markov chain Monte Carlo estimation of exponential random graph models', Journal of Social Structure 3 (2) , 1--40 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2001

Dhillon, I. S. (2001), Co-clustering documents and words using bipartite spectral graph partitioning, in 'KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining' , ACM Press, New York, NY, USA , pp. 269--274 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Newman, M.; Strogatz, S. & Watts, D. (2001), 'Random graphs with arbitrary degree distributions and their applications', Arxiv preprint cond-mat/0007235 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Ng, A. Y.; Jordan, M. I. & Weiss, Y. (2001), On spectral clustering: Analysis and an algorithm, in 'Advances in Neural Information Processing Systems 14' , MIT Press, , pp. 849--856 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Despite many empirical successes of spectral clustering methods| algorithms that cluster points using eigenvectors of matrices derived from the data|there are several unresolved issues. First, there are a wide variety of algorithms that use the eigenvectors in slightly dierent ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems. 1

2000

Gansner, E. R. & North, S. C. (2000), 'An open graph visualization system and its applications to software engineering', Software Practice & Experience 30 (11) , 1203--1233 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, high-quality static and dynamic layout algorithms, and the ability to handle sizable graphs. We conclude with a description of the applications of this package to a variety of software engineering tools.

1999

Anderson, C.; Wasserman, S. & Crouch, B. (1999), 'A p* primer: Logit models for social networks', Social Networks 21 (1) , 37--66 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Barabasi, A. L. & Albert, R. (1999), 'Emergence of scaling in random networks', Science 286 (5439) , 509--512 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Batagelj, V.; Mrvar, A. & Zaveršnik, M. (1999), Partitioning Approach to Visualization of Large Graphs, in Jan Kratochvíyl, ed., 'Graph Drawing' , Springer, Berlin / Heidelberg , pp. 90-97 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick’s world trade graph.

1998

Brin, S. & Page, L. (1998), The Anatomy of a Large-Scale Hypertextual Web Search Engine, in 'Computer Networks and ISDN Systems' , pp. 107--117 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://infolab.stanford.edu/~backrub/google.html To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description w...

Guattery, S. & Miller, G. (1998), 'On the quality of spectral separators', SIAM Journal on Matrix Analysis and Applications 19 (3) , 701--719 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Karypis, G. & Kumar, V. (1998), Multilevel k-way Hypergraph Partitioning, in 'In Proceedings of the Design and Automation Conference' , pp. 343--348 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

In this paper, we present a new multilevel k-way hypergraph partitioning algorithm that substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way partitioning. both for optimizing local as well as global objectives. Experiments on the ISPD98 benchmark suite show that the partitionings produced by our scheme are on the average 15% to 23% better than those produced by the K-PM/LR algorithm, both in terms of the hyperedge cut as well as the (K - 1) metric. Furthermore, our algorithm is significantly faster, requiring 4 to 5 times less time than that required by K-PM/LR. 1 Introduction Hypergraph partitioning is an important problem with extensive application to many areas, including VLSI design [10], efficient storage of large databases on disks [14], and data mining [13]. The problem is to partition the vertices of a hypergraph into k roughly equal parts, such that a certain objective function defined over the hyperedges is optimized. A commonly used obje...

1997

Karypis, G.; Aggarwal, R.; Kumar, V. & Shekhar, S. (1997), 'Multilevel hypergraph partitioning: Application in VLSI domain', , 526--529 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Mohar, B. (1997), 'Some applications of Laplace eigenvalues of graphs', Graph Symmetry: Algebraic Methods and Applications 497 , 227--275 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1996

Spielman, D. A. & Teng, S. (1996), 'Spectral Partitioning Works: Planar Graphs and Finite Element Meshes' , University of California at Berkeley , Berkeley, CA, USA .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1995

Alpert, C. J.; Kahng, A. B. & zen Yao, S. (1995), Spectral partitioning: The more eigenvectors, the better, in 'Proc. ACM/IEEE Design Automation Conf' , pp. 195--200 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Molloy, M. & Reed, B. (1995), 'A critical point for random graphs with a given degree sequence' , Random Structures & Algorithms 6 , 161-179 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1994

Bolla, M. & Tusnády, G. (1994), 'Spectra and optimal partitions of weighted graphs', Discrete Math. 128 (1-3) , 1--20 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Chan, P. K.; Schlag, M. D. F. & Zien, J. Y. (1994), 'Spectral K-way ratio-cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems 13 (9) , 1088-1096 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1992

Hagen, L. W. & Kahng, A. B. (1992), 'New spectral methods for ratio cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems 11 (9) , 1074-1085 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1991

1990

Pothen, A.; Simon, H. & Liou, K. (1990), 'Partitioning Sparse Matrices with Eigenvectors of Graphs', SIAM J. MATRIX ANAL. APPLIC. 11 (3) , 430--452 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1988

Frank, O. (1988), 'Random sampling and social networks: a survey of various approaches', Math. Sci. Humaines 104 , 19--33 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Johnson, D. S. & Papadimitriou, C. H. (1988), 'On generating all maximal independent sets', Inf. Process. Lett. 27 (3) , 119--123 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1983

Social network researchers have long sought measures of network cohesion, Density has often been used for this purpose, despite its generally admitted deficiencies. An approach to network cohesion is proposed that is based on minimum degree and which produces a sequence of subgraphs of gradually increasing cohesion. The approach also associates with any network measures of local density which promise to be useful both in characterizing network structures and in comparing networks.

1982

1981

1977

A Family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced. These measures define centrality in terms of the degree to which a point falls on the shortest path between others and therefore has a potential for control of communication. They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.

1975

Fiedler, M. (1975), 'A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory', Czechoslovak Mathematical Journal 25 (100) , 619--633 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

1973

Donath, W. & Hoffman, A. (1973), 'Lower bounds for the partitioning of graphs', IBM Journal of Research and Development 17 (5) , 420--425 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]