Sciweavers

39 search results - page 2 / 8
» Spectral clustering for multi-type relational data
Sort
View
AUSAI
2009
Springer
13 years 8 months ago
Adapting Spectral Co-clustering to Documents and Terms Using Latent Semantic Analysis
Abstract. Spectral co-clustering is a generic method of computing coclusters of relational data, such as sets of documents and their terms. Latent semantic analysis is a method of ...
Laurence A. F. Park, Christopher Leckie, Kotagiri ...
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 7 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
NIPS
2008
13 years 6 months ago
Learning Taxonomies by Dependence Maximization
We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the ...
Matthew B. Blaschko, Arthur Gretton
DATESO
2010
148views Database» more  DATESO 2010»
13 years 2 months ago
Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
Gamila Obadi, Pavla Drázdilová, Jan ...
UAI
2003
13 years 6 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey