Sciweavers

4009 search results - page 521 / 802
» Clustering on Complex Graphs
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
BMCBI
2010
202views more  BMCBI 2010»
15 years 6 months ago
NeMo: Network Module identification in Cytoscape
Background: As the size of the known human interactome grows, biologists increasingly rely on computational tools to identify patterns that represent protein complexes and pathway...
Corban G. Rivera, Rachit Vakil, Joel S. Bader
ECCV
2008
Springer
16 years 8 months ago
Unsupervised Structure Learning: Hierarchical Recursive Composition, Suspicious Coincidence and Competitive Exclusion
Abstract. We describe a new method for unsupervised structure learning of a hierarchical compositional model (HCM) for deformable objects. The learning is unsupervised in the sense...
Long Zhu, Chenxi Lin, Haoda Huang, Yuanhao Chen, A...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 7 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 6 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010