Symeonidis, Panagiotis ; Nanopoulos, Alexandros ; Manolopoulos, Yannis:
Tag recommendations based on tensor dimensionality reduction.
In: RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems.
New York, NY, USA
: ACM,
2008. - ISBN
978-1-60558-093-7,
S. 43--50
Brandes, Ulrik ; Delling, Daniel ; Gaertler, Marco ; Görke, Robert ; Hoefer, Martin ; Nikoloski, Zoran ; Wagner, Dorothea ; Brandstädt, Andreas (Bearb.) ; Kratsch, Dieter (Bearb.) ; Müller, Haiko (Bearb.):
On Finding Graph Clusterings with Maximum Modularity
In: Graph-Theoretic Concepts in Computer Science.
4769.
Berlin / Heidelberg
: Springer,
2007
Lecture Notes in Computer Science).
- ISBN-978-3-540-74838-0,
S. 121-132
Spielman, D.A.:
Spectral Graph Theory and its Applications.
In: Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
(2007),
S. 29-38
Newman, MEJ:
{Finding community structure in networks using the eigenvectors of matrices}.
In: Physical Review E,
74
(2006),
Nr. 3,
S. 36104
Schmitz, Christoph ; Hotho, Andreas ; Jäschke, Robert ; Stumme, Gerd
; Sure, York (Bearb.) ; Domingue, John (Bearb.):
Content Aggregation on Knowledge Bases using Graph Clustering.
4011.
In: The Semantic Web: Research and Applications.
Heidelberg
: Springer,
2006
(LNAI),
S. 530-544
Dias, Vânia M.F. ; de Figueiredo, Celina M.H. ; Szwarcfiter, Jayme L.:
Generating bicliques of a graph in lexicographic order.
In: Theoretical Computer Science,
337
(2005),
Nr. 1-3,
S. 240 - 248
Diestel, Reinhard:
Graph Theory.
3 (electronic edition)
: Springer-Verlag Heidelberg, New York,
2005
Haveliwala, T.H. ; Kamvar, S.D.:
{The second eigenvalue of the Google matrix}.
In: A Stanford University Technical Report http://dbpubs. stanford. edu
(2003)
Yu, Stella X. ; Shi, Jianbo:
Multiclass Spectral Clustering.
In: Proc. International Conference on Computer Vision (ICCV 03).
Nice, France,
2003
Blelloch, Guy:
Graph Separators,
2002. -
Dhillon, Inderjit S.:
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.
New York, NY, USA
: ACM Press,
2001. - ISBN
158113391X,
S. 269--274
Monien, B.: On Spectral Bounds for the k-Partitioning of Graphs,
2001
Ranade, A.G.:
{Some uses of spectral methods},
2000. -
Chung, F. R. K.:
Spectral Graph Theory
: American Mathematical Society,
1997
Chan, Pak K. ; Schlag, Martine D. F. ; Zien, Jason Y.:
Spectral K-way ratio-cut partitioning and clustering..
In: IEEE Trans. on CAD of Integrated Circuits and Systems,
13
(1994),
Nr. 9,
S. 1088-1096
Hagen, Lars W. ; Kahng, Andrew B.:
New spectral methods for ratio cut partitioning and clustering..
In: IEEE Trans. on CAD of Integrated Circuits and Systems,
11
(1992),
Nr. 9,
S. 1074-1085
Mohar, B.:
{The Laplacian spectrum of graphs}.
In: Graph Theory, Combinatorics, and Applications,
2
(1991),
S. 871--898
Pothen, A. ; Simon, H.D. ; Liou, K.P.:
{Partitioning Sparse Matrices with Eigenvectors of Graphs}.
In: SIAM J. MATRIX ANAL. APPLIC.,
11
(1990),
Nr. 3,
S. 430--452
Johnson, David S. ; Papadimitriou, Christos H.:
On generating all maximal independent sets.
In: Inf. Process. Lett.,
27
(1988),
Nr. 3,
S. 119--123
Fiedler, M.:
{A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}.
In: Czechoslovak Mathematical Journal,
25
(1975),
Nr. 100,
S. 619--633