Sciweavers

1285 search results - page 141 / 257
» On the Complexity of Ordinal Clustering
Sort
View
BMCBI
2010
202views more  BMCBI 2010»
13 years 10 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
15 years 3 days 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»
14 years 10 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»
14 years 10 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
SSD
2009
Springer
149views Database» more  SSD 2009»
14 years 4 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...