Sciweavers

522 search results - page 44 / 105
» Energy Models for Graph Clustering
Sort
View
SIROCCO
2008
15 years 6 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
COLT
2007
Springer
15 years 10 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 11 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
JMLR
2010
179views more  JMLR 2010»
14 years 11 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
15 years 10 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors