Sciweavers

177 search results - page 2 / 36
» Multi-way Clustering on Relation Graphs
Sort
View
RSA
2011
124views more  RSA 2011»
12 years 11 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ISBRA
2007
Springer
13 years 11 months ago
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
Italo Zoppis, Daniele Merico, Marco Antoniotti, Bu...
TKDE
2011
362views more  TKDE 2011»
12 years 11 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
CORR
2011
Springer
139views Education» more  CORR 2011»
12 years 8 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 5 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu