Neuer Professor für Web Science
Dr. Jérôme Kunegis
B 122
Latest blog entry: The Surprising Equality of the Mean and Median Path Length in Online Networks
Blog ∼ LinkedIn ∼ Xing ∼ Twitter ∼ DBLP ∼ ACM ∼ Videolectures ∼ Slideshare
Teaching
- Network Theory and Dynamic Systems (in English), SoSe 2013
- Proseminar "Soziale Netzwerke" (Social Networks), SoSe 2013
- Grundlagen der Datenbanken (Database Systems), WiSe 2012/2013
- Proseminar "Soziale Netzwerke" (Social Networks), SoSe 2012
- Grundlagen der Datenbanken (Database Systems), WiSe 2011/2012
- Grundlagen der Datenbanken (Database Systems), WiSe 2010/2011
Projects
Current projects:
- KONECT – Koblenz Network Collection)
- ROBUST (EU FP7)
- Social Sensor (EU FP7)
Former projects:
Interests
- Analysis of large networks
- Spectral graph theory
- Graphs with special structure: signed graphs, directed graphs, weighted graphs and semantic networks
I study the Web using spectral methods. This includes studying individual networks such as Facebook, Twitter, Wikipedia, etc., as well as the Web as a whole in the form of semantic networks. My PhD thesis is about the spectral analysis of individual networks; my post-doctoral work will expand to semantic networks.
My work can be applied on three levels:
- Network characteristics: Connectedness, balance, conflict, clustering, etc.
- Node characteristics: Trust, popularity, centrality, etc.
- Link analysis: link prediction, rating prediction, recommendation, personalized ranking, etc.
The methods I use are spectral, i.e. they are based on characteristic graph matrices such as the adjacency matrix and the Laplacian matrix. I am particularly interested in ways to formulate network mining algorithms algebraically to find connections to other algorithms. In fact, my view is that all link prediction algorithms can be expressed over all paths between two nodes in the network, given suitable operations for aggregating adjacent and parallel edges. These two operations can be reduced to multiplication and addition in a suitable semiring, where link prediction functions can be expressed as a function of the corresponding adjacency matrix. This justifies algebraic graph theory. If additionally the operations form a field, spectral analysis can be used to simplify the computation of link prediction functions, because most of them can be seen as spectral transformations of the adjacency matrix.
To apply spectral methods to the Semantic Web, I am looking for ways to extend algebraic graph theory to arbitrary edge labels. A first step in this direction is to analyse networks with negatively weighted edges, of which the Slashdot Zoo is a prime example. In this case, the real adjacency matrix can be used, and spectral analysis is possible.
PhD Thesis
I wrote my PhD thesis On the Spectral Evolution of Large Networks under supervision of Prof. Dr. Steffen Staab, Prof. Dr. Klaus Obermayer and Prof. Dr. Christian Bauckhage in 2011.
Download: "On the Spectral Evolution of Large Networks" (print version)
In my PhD thesis, I studied the spectral characteristics of large dynamic networks and formulate the spectral evolution model. The spectral evolution model applies to networks that evolve over time, and describes their spectral decompositions such as the eigenvalue and singular value decomposition. My main result is an interpretation of the spectrum and eigenvectors of networks in terms of global and local effects. I show empirically that the spectrum describes a network on the global level, whereas eigenvectors describe a network at the local level, and derive from this several new link prediction methods.
Conferences
Chairs
- INFORMATIK, 2013, Publicity Chair.
- Conf. on Web Science (WebSci), 2011, Publicity Chair.
- Special Session on Uncertainty in Network Mining (UNM) at the Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU), 2010, Technical Chair.
Publications
2013
Kunegis, Jérôme; Preusse, Julia; Schwagereit, Felix (2013): What Is the Added Value of Negative Links in Online Social Networks?. In: Proc. Int. World Wide Web Conf..
Kunegis, Jérôme; Blattner, Marcel; Moser, Christine (2013): Preferential Attachment in Online Networks: Measurement and Explanations. In: Proc. Web Science Conf..
Preusse, Julia; Kunegis, Jérôme; Thimm, Matthias; Gottron, Thomas; Staab, Steffen (2013): Structural Dynamics of Knowledge Networks. In: Proc. Int. Conf. on Weblogs and Social Media.
Kunegis, Jérôme (2013): KONECT -- The Koblenz Network Collection. In: Proc. Int. Web Observatory Workshop.
Fay, Damien; Kunegis, Jérôme; Yoneki, Eiko (2013): Centrality and Mode Detection in Dynamic Contact Graphs; a Joint Diagonalisation Approach. In: Proc. Int. Conf. on Advances in Social Networks Analysis and Mining.
2012
Kunegis, Jérôme (2012): KONECT Cloud - Large Scale Network Mining in the Cloud. In: Proc. Spring 2012 Future SOC Lab Day.
Che Alhadi, Arifah; Gottron, Thomas; Kunegis, Jérôme; Naveed, Nasir (2012): LiveTweet: Monitoring and Predicting Interesting Microblog Posts. In: Proc. European Conf. on Information Retrieval Demonstrations. S. 569-570.
Kunegis, Jérôme; Sizov, Sergej; Schwagereit, Felix; Fay, Damien (2012): Diversity Dynamics in Online Networks. In: Proc. Conf. on Hypertext and Social Media. S. 255-264.
Kunegis, Jérôme; Fay, Damien; Christian, Bauckhage (2012): Spectral Evolution in Dynamic Networks. In: J. Knowledge and Information Systems. Bd. 10.1007/s10115-012-0575-9. S. 1-36.
Kunegis, Jérôme; Preusse, Julia (2012): Fairness on the Web: Alternatives to the Power Law. In: Proc. Web Science Conf.. S. 175-184.
Kunegis, Jérôme; Gröner, Gerd; Gottron, Thomas (2012): Online Dating Recommender Systems: The Split-complex Number Approach. In: Proc. Workshop on Recommender Systems and the Social Web. S. 37-44.
Kunegis, Jérôme; Fliege, Jörg (2012): Predicting Directed Links using Nondiagonal Matrix Decomposition. In: Proc. Int. Conf. on Data Mining. S. 948-953.
2011
Spiegel, Stephan; Clausen, Jan; Albayrak, Sahin; Kunegis, Jérôme (2011): Link Prediction on Evolving Data using Tensor Factorization. In: Proc. Workshop on Behavior Informatics.
Gottron, Thomas; Kunegis, Jérôme; Scherp, Ansgar; Staab, Steffen (2011): One Community Does Not Rule Them All. In: Proc. Web Science Conf..
Naveed, Nasir; Gottron, Thomas; Kunegis, Jérôme; Che Alhadi, Arifah (2011): Bad News Travel Fast: A Content-based Analysis of Interestingness on Twitter. In: Proc. Web Science Conf..
Fay, Damien; Haddadi, Hamed; Uhlig, Steve; Kilmartin, Liam; Moore, Andrew W.; Kunegis, Jérôme; Iliofotou, Marios (2011): Discriminating Graphs through Spectral Projections. In: Computer Networks. Bd. 55. Nr. 15. S. 3458-3468.
Naveed, Nasir; Gottron, Thomas; Kunegis, Jérôme; Che Alhadi, Arifah (2011): Searching Microblogs: Coping with Sparsity and Document Quality. In: Proc. Int. Conf. on Information and Knowledge Management.
Fay, Damien; Kunegis, Jérôme; Yoneki, Eiko (2011): On Joint Diagonalisation for Dynamic Network Analysis. University of Cambridge.
Che Alhadi, Arifah; Gottron, Thomas; Kunegis, Jérôme; Naveed, Nasir (2011): LiveTweet: Microblog Retrieval Based on Interestingness and an Adaptation of the Vector Space Model. In: Proc. Text REtrieval Conference (TREC).
Gottron, Thomas; Naveed, Nasir; Kunegis, Jérôme; Che Alhadi, Arifah (2011): Challenges in Mining Social Media: Sparsity and Quality. In: Challenges in Document Mining (Dagstuhl Seminar 11171). S. 73.
2010
De Luca, Ernesto W.; Plumbaum, Till; Kunegis, Jérôme; Albayrak, Sahin (2010): Multilingual Ontology-based User Profile Enrichment. In: Proc. Workshop on the Multilingual Semantic Web. S. 41-42.
Kunegis, Jérôme; Schmidt, Stephan; Lommatzsch, Andreas; Lerner, Jürgen (2010): Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization. In: Proc. SIAM Int. Conf. on Data Mining. S. 559-570.
Kunegis, Jérôme; Fay, Damien; Bauckhage, Christian (2010): Network Growth and the Spectral Evolution Model. In: Proc. Int. Conf. on Information and Knowledge Management. S. 739-748.
Kunegis, Jérôme; De Luca, Ernesto W.; Albayrak, Sahin (2010): The Link Prediction Problem in Bipartite Networks. In: Proc. Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-based Systems. S. 380-389.
Said, Alan; Kunegis, Jérôme; Luca, Ernesto William De; Albayrak, Sahin (2010): Exploiting Hierarchical Tags for Context-awareness. In: Proc. Workshop on Exploiting Semantic Annotations for Information Retrieval. S. 35-36.
Karatas, Baris; Schmidt, Torsten; Kunegis, Jérôme; Plumbaum, Till (2010): Connecting Senior Citizens through Interactive TV. In: Proc. Ambient Assisted Living.
2009
Kunegis, Jérôme; Lommatzsch, Andreas; Bauckhage, Christian (2009): The Slashdot Zoo: Mining a Social Network with Negative Edges. In: Proc. Int. World Wide Web Conf.. S. 741-750.
Kunegis, Jérôme; Lommatzsch, Andreas (2009): Learning Spectral Graph Transformations for Link Prediction. In: Proc. Int. Conf. on Machine Learning. S. 561-568.
Spiegel, Stephan; Kunegis, Jérôme; Li, Fang (2009): Hydra: A Hybrid Recommender System [Cross-Linked Rating and Content Information]. In: Proc. Workshop on Complex Networks in Information and Knowledge Management. S. 75-80.
2008
Kunegis, Jérôme; Schmidt, Stephan; Bauckhage, Christian; Mehlitz, Martin; Albayrak, Sahin (2008): Modeling Collaborative Similarity with the Signed Resistance Distance Kernel. In: Proc. European Conf. on Artificial Intelligence. S. 261-265.
Kunegis, Jérôme; Lommatzsch, Andreas; Bauckhage, Christian; Albayrak, Sahin (2008): On the Scalability of Graph Kernels Applied to Collaborative Recommenders. In: Proc. ECAI Workshop on Recommender Systems. S. 35-38.
Kunegis, Jérôme; Lommatzsch, Andreas; Bauckhage, Christian (2008): Alternative Similarity Functions for Graph Kernels. In: Proc. Int. Conf. on Pattern Recognition.
2007
Hahne, Michael; Jung, Corinna; Kunegis, Jérôme; Lommatzsch, Andreas; Paus, André (2007): Ein gradualisiertes Community-Modell zur Bildung wissenschaftlicher Gemeinschaften. In: Analyse sozialer Netzwerke und Social Software - Grundlagen und Anwendungsbeispiele.
Kunegis, Jérôme; Schmidt, Stephan (2007): Collaborative Filtering using Electrical Resistance Network Models with Negative Edges. In: Proc. Industrial Conf. on Data Mining. S. 269-282.
Kunegis, Jérôme; Lommatzsch, Andreas; Mehlitz, Martin; Albayrak, Sahin (2007): Assessing the Value of Unrated Items in Collaborative Filtering. In: Proc. Int. Conf. on Digital Information Management. S. 212-216.
Kunegis, Jérôme; Albayrak, Sahin (2007): Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression. In: Proc. Int. Conf. on Information Reuse and Integration.
Lommatzsch, Andreas; Mehlitz, Martin; Kunegis, Jérôme (2007): A Multi-agent Framework for Personalized Information Filtering. In: Proc. German e-Science.
Mehlitz, Martin; Bauckhage, Christian; Kunegis, Jérôme; Albayrak, Sahin (2007): A New Evaluation Measure for Information Retrieval Systems. In: Proc. Int. Conf. on Systems, Man and Cybernetics.
Mehlitz, Martin; Kunegis, Jérôme; Albayrak, Sahin (2007): Using Novel IR Measures to Learn Optimal Cluster Structures for Web Information Retrieval. In: Proc. Int. Conf. Web Intelligence.
Schmidt, Stephan; Kunegis, Jérôme (2007): Scalable Bandwidth Optimization in Advance Reservation Networks. In: Proc. Int. Conf. on Networks. S. 95-100.
Milosevic, Dragan; Kunegis, Jérôme; Albayrak, Sahin (2007): Resource-Aware Update Policy for Highly Dynamic P2P Networks. In: Proc. WI Workshops.
Address
Jérôme Kunegis Institute for Web Science and Technologies Universität Koblenz Universitätsstraße 1 56070 Koblenz Germany
My Name
The correct spelling of my name is Jérôme Kunegis, including an acute accent on the first E and a circumflex accent on the O. I do not have other first names or a middle name.
The pronunciation of my name is [ʒe.ʁoːm ky.ne.ʒis] in French and [ʒə.ˈʁoːm ku.ˈneː.ɡɪs] in German. (See French and German phonology)
Kontakt