Sciweavers

1880 search results - page 14 / 376
» Bayesian Clustering by Dynamics
Sort
View
JMLR
2002
73views more  JMLR 2002»
14 years 9 months ago
Variational Learning of Clusters of Undercomplete Nonsymmetric Independent Components
We apply a variational method to automatically determine the number of mixtures of independent components in high-dimensional datasets, in which the sources may be nonsymmetricall...
Kwokleung Chan, Te-Won Lee, Terrence J. Sejnowski
ICML
2008
IEEE
15 years 10 months ago
Statistical models for partial membership
We present a principled Bayesian framework for modeling partial memberships of data points to clusters. Unlike a standard mixture model which assumes that each data point belongs ...
Katherine A. Heller, Sinead Williamson, Zoubin Gha...
CIT
2004
Springer
15 years 3 months ago
Associativity Based Mobility-Adaptive K-Clustering in Mobile Ad-Hoc Networks
To solve the scalability issue of ad hoc network, a new cluster maintenance protocol is proposed. Clusters may change dynamically, reflecting the mobility of the underlying networ...
Chinnappan Jayakumar, Chenniappan Chellappan
BMVC
1998
14 years 11 months ago
A Method for Dynamic Clustering of Data
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
Arnaldo J. Abrantes, Jorge S. Marques
74
Voted
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
15 years 4 months ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey