Sciweavers

208 search results - page 19 / 42
» A Bayesian Graph Clustering Approach Using the Prior Based o...
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 56 sec ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
JCB
2007
198views more  JCB 2007»
13 years 8 months ago
Bayesian Hierarchical Model for Large-Scale Covariance Matrix Estimation
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
Dongxiao Zhu, Alfred O. Hero III
CMOT
2004
141views more  CMOT 2004»
13 years 8 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
IPPS
2008
IEEE
14 years 3 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ATAL
2006
Springer
14 years 10 days ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer